Abstract
A form of dataflow analysis is presented as a technique for statically analysing aspects of term graph rewriting programs. In particular it is shown that non-trivial bounds on the set of symbols that might occur at a given position in the pattern of a rule can be obtained. The technique is extended to yield sufficient conditions for determining that for two positions in a given pattern of some rule, no matching homomorphism will ever map the two positions to the same graph node, in any execution of the program.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Abramsky, C. Hankin (eds.) 1987, Abstract Interpretation of Declarative Languages, Ellis Horwood.
A.V. Aho, R. Sethi, J.D. Ullman 1986, Compilers, Principles Techniques and Tools, Addison Wesley.
R. Banach, P. Watson 1988, Dealing with State on Flagship: The MONSTR Computational Model, in: Proceedings of the CONPAR 88 Conference, UMIST, U.K.
R. Banach, J. Sargeant, I. Watson, P. Watson, V. Woods 1988, The Flagship Project, in: Proceedings of the Alvey Technical Conference, Swansea, U.K.
R. Banach 1988, Implementing Term Graph Rewriting on a Loosely Synchronised Architectural Model, in preparation.
H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, M.R. Sleep 1987, Term Graph Rewriting, in: Parallel Architectures and Languages Europe, L.N.C.S. 259, 141–158.
H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, M.R. Sleep 1987, Towards an Intermediate Language based on Graph Rewriting, in: Parallel Architectures and Languages Europe, L.N.C.S. 259, 159–175.
J. Darlington 1977, Program Transformation and Synthesis: Present Capabilities, Technical Report 77/43, Dept. of Computer Science, Imperial College, U.K.
J.R.W. Glauert, J.R. Kennaway, M.R. Sleep 1987, Final Specification of DACTL, School of Information Systems, University of East Anglia, Norwich, U.K.
J.R.W. Glauert, K. Hammond, J.R. Kennaway, G.A. Papadopoulos, M.R. Sleep, 1988, DACTL: Some Introductory Papers. School of Information Systems, University of East Anglia, Norwich, U.K.
D.A. Turner 1979, A New Implementation Technique for Applicative Languages, Software Practise and Experience 9, 31–49.
C.P. Wadsworth 1971, Semantics and Pragmatics of the Lambda Calculus, D. Phil. thesis, Programming Research Group, Oxford University, U.K.
P. Watson, I. Watson 1987, Evaluating Functional Programs on the Flagship Machine, in: Functional Languages and Computer Architecture, L.N.C.S. 274, 80–97.
I. Watson, V. Woods, P. Watson, R. Banach, M. Greenberg, J. Sargeant 1988, Flagship: A Parallel Architecture for Declarative Programming, in: 15th Annual International Symposium on Computer Architecture, Hawaii.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Banach, R. (1989). Dataflow analysis of term graph rewriting systems. In: Odijk, E., Rem, M., Syre, JC. (eds) PARLE '89 Parallel Architectures and Languages Europe. PARLE 1989. Lecture Notes in Computer Science, vol 366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51285-3_33
Download citation
DOI: https://doi.org/10.1007/3-540-51285-3_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51285-1
Online ISBN: 978-3-540-46184-5
eBook Packages: Springer Book Archive