Dataflow analysis of term graph rewriting systems

  • R. Banach
Submitted Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 366)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ABRA87]
    S. Abramsky, C. Hankin (eds.) 1987, Abstract Interpretation of Declarative Languages, Ellis Horwood.Google Scholar
  2. [AHO86]
    A.V. Aho, R. Sethi, J.D. Ullman 1986, Compilers, Principles Techniques and Tools, Addison Wesley.Google Scholar
  3. [BANA88a]
    R. Banach, P. Watson 1988, Dealing with State on Flagship: The MONSTR Computational Model, in: Proceedings of the CONPAR 88 Conference, UMIST, U.K.Google Scholar
  4. [BANA88b]
    R. Banach, J. Sargeant, I. Watson, P. Watson, V. Woods 1988, The Flagship Project, in: Proceedings of the Alvey Technical Conference, Swansea, U.K.Google Scholar
  5. [BANA88c]
    R. Banach 1988, Implementing Term Graph Rewriting on a Loosely Synchronised Architectural Model, in preparation.Google Scholar
  6. [BARE86a]
    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.Google Scholar
  7. [BARE86b]
    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.Google Scholar
  8. [DARL77]
    J. Darlington 1977, Program Transformation and Synthesis: Present Capabilities, Technical Report 77/43, Dept. of Computer Science, Imperial College, U.K.Google Scholar
  9. [GLAU88a]
    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.Google Scholar
  10. [GLAU88b]
    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.Google Scholar
  11. [TURN79]
    D.A. Turner 1979, A New Implementation Technique for Applicative Languages, Software Practise and Experience 9, 31–49.Google Scholar
  12. [WADS71]
    C.P. Wadsworth 1971, Semantics and Pragmatics of the Lambda Calculus, D. Phil. thesis, Programming Research Group, Oxford University, U.K.Google Scholar
  13. [WATS87a]
    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.Google Scholar
  14. [WATS87b]
    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.Google Scholar

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • R. Banach
    • 1
  1. 1.Department of Computer ScienceThe UniversityManchesterUK

Personalised recommendations