Skip to main content
SpringerLink
Log in

Fast abstract interpretation using sequential algorithms

  • Conference paper
  • First Online:
Book cover Static Analysis (WSA 1993)

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

Included in the following conference series:

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. G. Baraki. A Note on Abstract Interpretation of Polymorphic Functions. In ACM Functional Programming and Computer Architecture, Boston, 1991.

    Google Scholar 

  2. G. Berry and P.-L. Curien. Sequential Algorithms on Concrete Data Structures. Theoretical Computer Science, 20:265–321, 1982.

    Google Scholar 

  3. G. Burn, C. Hankin, and S. Abramsky. The Theory of Strictness Analysis of Higher Order Functions. In H. Ganzinger and N. D. Jones, editors, Proceedings of the Workshop on Programs as Data Objects, Lecture Notes in Computer Science, volume 217, pages 42–62. Springer-Verlag, October 1985.

    Google Scholar 

  4. P. Cousot and R. Cousot. Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proc. 4th ACM Symp. on Principles of Programming Languages, Los Angeles, 1977.

    Google Scholar 

  5. T.-R. Chuang and B. Goldberg. A Syntactic Approach to Fixed Point Computation on Finite Domains. In Lisp and Functional Programming. ACM, 1992.

    Google Scholar 

  6. C. Clack and S. L. Peyton Jones. Strictness Analysis—a Practical Approach. In Proceedings 1985 Conference on Functional Programming Languages and Computer Architecture, pages 35–49, Nancy, France, 1985.

    Google Scholar 

  7. P.-L. Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. Research Notes in Theoretical Computer Science. Pitman, 1986.

    Google Scholar 

  8. A. Ferguson and J. Hughes. Abstract Interpretation of Higher-Order Functions using Concrete Data Structures. In Functional Programming, Workshops in Computing, Glasgow, 1992. Springer-Verlag.

    Google Scholar 

  9. J. Hughes and A. Ferguson. A Loop-detecting Interpreter for Lazy, Higher-order Programs. In Functional Programming, Workshops in Computing, Glasgow, 1992. Springer-Verlag.

    Google Scholar 

  10. S. Hunt and C. Hankin. Fixed points and frontiers: a new perspective. Journal of Functional Programming, 1(1), January 1991.

    Google Scholar 

  11. C. Hankin and S. Hunt. Approximate Fixed Points in Abstract Interpretation. In European Symposium on Programming, volume 582 of LNCS, Rennes, 1992. Springer-Verlag.

    Google Scholar 

  12. S. Hunt. Frontiers and open sets in abstract interpretation. In D. MacQueen, editor, Functional Programming Languages and Computer Architecture. ACM Publications, 1989.

    Google Scholar 

  13. S. Hunt. Abstract Interpretation of Functional Languages: From Theory to Practice. PhD thesis, Imperial College, London, October 1991.

    Google Scholar 

  14. P. Hudak and J. Young. Higher-order Strictness Analysis in Untyped Lambdacalculus. In ACM Principles of Programming Languages, pages 97–109, St. Petersburg, Florida, January 1986.

    Google Scholar 

  15. J. Launchbury. Projection Factorisations in Partial Evaluation (PhD thesis), volume 1 of Distinguished Dissertations in Computer Science. Cambridge University Press, 1991.

    Google Scholar 

  16. C. Martin and C. Hankin. Finding Fixed Points in Finite Lattices. In G. Kahn, editor, ACM Conf. on Functional Programming and Computer Architecture, LNCS, Portland, Oregon, 1987. Springer-Verlag.

    Google Scholar 

  17. F. Nielson. A Denotational Framework for Data Flow Analysis. Acta Informatica, 18:265–287, 1982.

    Google Scholar 

  18. P. Sestoft. Analysis and Efficient Implementation of Functional Programs. PhD thesis, DIKU, University of Copenhagen, Denmark, October 1991.

    Google Scholar 

  19. J. Seward. Polymorphic Strictness Analysis using Frontiers. In ACM Symp. on Partial Evaluation and Semantics-Based Program Manipulation, pages 186–193, Copenhagen, June 1993.

    Google Scholar 

  20. Phil Wadler. Strictness Analysis on Non-Flat Domains (by Abstract Interpretation over Finite Domains. In S. Abramsky and Chris Hankin, editors, Abstract Interpretation of Declarative Languages, pages 266–275. Ellis Horwood, 1987.

    Google Scholar 

  21. J. Young and P. Hudak. Finding Fixpoints on Function Spaces. Research Report YALEU/DCS/RR-505, Dept. of Computer Science, Yale University, December 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept of Computing Science, University of Glasgow, G12 8QQ, Glasgow, Scotland

    Alex Ferguson

  2. Informationsbehandling, Chalmers Tekniska Högskola, Göteborg, Sweden

    John Hughes

Authors
  1. Alex Ferguson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John Hughes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Patrick Cousot Moreno Falaschi Gilberto Filé Antoine Rauzy

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ferguson, A., Hughes, J. (1993). Fast abstract interpretation using sequential algorithms. In: Cousot, P., Falaschi, M., Filé, G., Rauzy, A. (eds) Static Analysis. WSA 1993. Lecture Notes in Computer Science, vol 724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57264-3_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-57264-3_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57264-0

  • Online ISBN: 978-3-540-48027-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation