Abstract
In this paper we present a framework for the abstract interpretation of term graph rewriting systems. The framework is based on the approach taken by the Cousots for flowchart programs. We give an example of the use of the framework by presenting an interpretation which performs a form of type inference.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abramsky S. and Hankin C. L.(eds) Abstract Interpretation of Declarative Languages, Ellis Horwood, 1987.
Abramsky S. Abstract Interpretation, Logical Relations and Kan Extensions,to appear in Logic and Computation, 1 1.
Banach R. Dataflow Analysis of Term Graph Rewriting Systems,PARLE’89, Volume II, LNCS 366, Springer Verlag, pp 55-72.
Barendregt H. P., Eekelen M. C. J. D., Glauert J. R. W., Kennaway J. R., Plasmeijer M. J. and Sleep M. R. Term Graph Rewriting,PARLE’87, Volume Il, LNCS 259, Springer Verlag, pp 141-158.
Barendregt H. P., Kennaway J. R., Klop J. W. and Sleep M. R. Needed Reduction and Spine. Strategies for the Lambda Calculus, Information and Computation, 75 3, pp 191 - 231.
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.
Goldberg B. and Hudak P. Serial Combinators: Optimal Grains for Parallelism,2nd FPCA, LNCS 201, Springer Verlag, pp 382-399.
Hudak P. A semantic model of reference counting and its abstraction,in [AH87], pp45-62.
Jones N. D. Flow analysis of lazy higher-orderfunctional programs,in [AH87], pp103-l22.
Kennaway J. R. On “On Graph Rewritings”, Theoretical Computer Science, 52, pp 37 - 58.
Klop J. W. Term Rewriting Systems, Notes for the seminar on graph reduction machines, Ustica, September 1985. A revised version to appear in the “Handbook of Logic and Computer Science”, Oxford University Press, 1991.
Mishra P. and Keller R. M. Static inference of properties of applicative programs, 11th POPL, 1984.
Sands D. Complexity Analysis for a Lazy Higher-order Language,ESOP’90, LNCS 432, Springer Verlag, pp 361-376..
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hankin, C. (1991). Static Analysis of Term Graph Rewriting Systems. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds) Parle ’91 Parallel Architectures and Languages Europe. Lecture Notes in Computer Science, vol 505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-25209-3_48
Download citation
DOI: https://doi.org/10.1007/978-3-662-25209-3_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-23206-4
Online ISBN: 978-3-662-25209-3
eBook Packages: Springer Book Archive