Abstract
Graph rewriting systems are the generalisation of term rewriting systems from (finite) trees to graphs. They provide the basis for an abstract treatment of graph reduction, a well-established technique for the implementation of declarative languages. Given this last observation, it is sensible to develop tools for the compile-time analysis of graph rewrite programs; it is to be expected that opportunities for optimisation which are difficult to detect in the source program might be exposed at this level. This paper summarises the work that we have done on semantics-based static analysis of programs represented by Term Graph Rewriting Systems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barendregt H. P., van Eekelen M., Glauert J., Kennaway J. R., Plasmeijer M. J. and Sleep M. R., Term Graph Rewriting, in Proceedings PARLE ‘87 Volume II, Springer Verlag LNCS 259, pp 141–158, 1987.
Clark D. and Hankin C. L., A Lattice of Abstract Graphs, to appear in PLILP’93, Estonia, 1993.
Cousot P. and Cousot R., Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction of Approximations of Fixed Points,4th POPL, pp238–252, 1977.
Goubault E. and Hankin C. L., A lattice for the abstract interpretation of term graph rewriting systems,In [12].
Ehrig H. and Kreowski H.-J. (eds), Graph Grammars and Their Application to Computer Science,(Proceedings of the 4th International Workshop, Bremen, Germany, March 1990), Springer-Verlag, LNCS 532.
Hankin C. L., Static Analysis of Term Graph Rewriting Systems, In Proceedings PARLE ‘81 Volume II, Springer Verlag LNCS 506, 1991.
Hudak P. and Young J., Finding Fixed Points on Function Spaces,Manuscript,1986.
Kennaway J. R., On “On Graph Rewritings”, Theoretical Computer Science, 52, pp 37–58, 1987.
Nöcker E., Strictness.Analysis based on Abstract Reduction,In proc. 2nd International Workshop on Implementation of Functional Languages on Parallel Architectures, University of Nijmegen, 1990.
Peyton Jones S. L., The Implementation of Functional Programming Languages, Prentice-Hall International, 1987.
Raoult J. C., On Graph Rewritings, Theoretical Computer Science, 32, pp 1–24, 1984.
Sleep M. R., Plasmeijer M. J. and van Eekelen M. C.(eds), Term Graph Rewriting: Theory and Practice, John Wiley & Sons Ltd., 1993.
Turner D. A., A New Implementation Technique for Applicative Languages, Software Practice and Experience, Vol. 9, January 1979.
van Eekelen M., Goubault E., Hankin C. L. and Nöcker E., Abstract Reduction: Towards a theory via abstract interpretation In [12].
Wadsworth C. P., Semantics and Pragmatics of the Lambda Calculus, Chapter 4, PhD thesis, Oxford, 1971.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 British Computer Society
About this paper
Cite this paper
Hankin, C. (1993). Graph Rewriting Systems and Abstract Interpretation. In: Burn, G., Gay, S., Ryan, M. (eds) Theory and Formal Methods 1993. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3503-6_3
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3503-6_3
Publisher Name: Springer, London
Print ISBN: 978-3-540-19842-0
Online ISBN: 978-1-4471-3503-6
eBook Packages: Springer Book Archive