Skip to main content
SpringerLink
Log in

A lattice of abstract graphs

  • Conference paper
  • First Online:
Progamming Language Implementation and Logic Programming (PLILP 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 714))

Abstract

This paper concerns the abstract interpretation of Term Graph Rewriting systems. We introduce a new lattice of abstract graphs; this improves over previous work in that the ordering is defined directly on the graph structure rather than via unravelling into trees. We use the lattice in sketching the correctness of Nöcker's abstract reduction algorithm; an efficient strictness analysis used in the Concurrent Clean system.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H.P. Barendregdt, M.C.J.D. Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, and M.R. Sleep. Term graph rewriting. In PARLE '87 (Volume II), pages 141–158. Springer Verlag LNCS 259, 1987.

    Google Scholar 

  2. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixed points. In 4th POPL, pages 238–252, 1977.

    Google Scholar 

  3. E. Goubault and C. L. Hankin. A lattice for the abstract interpretation of term graph rewriting systems. In M. J. Plasmeijer M. R. Sleep and M. C. van Eekelen, editors, Term Graph Rewriting: Theory and Practice. John Wiley and Sons Ltd., 1993.

    Google Scholar 

  4. C. Hankin. Static analysis of term graph rewriting systems. In PARLE '91 (Volume II), pages 367–384. Springer Verlag LNCS 506, 1991.

    Google Scholar 

  5. A. Mycroft. Abstract Interpretation and Optimising Transformations for Applicative Programs. PhD thesis, University of Edinburgh, 1981.

    Google Scholar 

  6. E.G.J.M.H. Nöcker. Strictness analysis based on abstract reduction. In Proceedings of the Second International Workshop on Implementation of Functional Languages on Parallel Architectures, pages 297–321. University of Nijmegen Technical Report 90–16, 1990.

    Google Scholar 

  7. E.G.J.M.H. Nöcker, J.E.W. Smetsers, M.C.J.D. van Eekelen, and M.J. Plasmeijer. Concurrent clean. In PARLE '91 (Volume II), pages 202–219. Springer Verlag LNCS 506, 1991.

    Google Scholar 

  8. M.C. van Eekelen, E. Goubault, C.L. Hankin, and E.G.J.M.H. Nöcker. Abstract reduction: Towards a theory via abstract interpretation. In M. J. Plasmeijer M. R. Sleep and M. C. van Eekelen, editors, Term Graph Rewriting: Theory and Practice. John Wiley and Sons Ltd., 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computing, Imperial College of Science, Technology and Medicine, 180 Queen's Gate, SW7 2BZ, London, UK

    David Clark & Chris Hankin

Authors
  1. David Clark
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chris Hankin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Maurice Bruynooghe Jaan Penjam

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Clark, D., Hankin, C. (1993). A lattice of abstract graphs. In: Bruynooghe, M., Penjam, J. (eds) Progamming Language Implementation and Logic Programming. PLILP 1993. Lecture Notes in Computer Science, vol 714. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57186-8_88

Download citation

  • DOI: https://doi.org/10.1007/3-540-57186-8_88

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57186-5

  • Online ISBN: 978-3-540-47945-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation