Skip to main content
SpringerLink
Log in

Binding-time analysis and strictness analysis by abstract interpretation

  • Contributed Papers
  • Conference paper
  • First Online:
Static Analysis (SAS 1995)

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

Included in the following conference series:

Abstract

Given a description of inputs and parameters in a program, a Binding-Time Analysis determines parts of a program which can be evaluated at compile-time. A Strictness Analysis determines parts of a program, whose early evaluation does not change the value of the result. In this paper, we present an analysis which subsumes both analyses for a first-order functional language. The analysis is formulated in terms of Abstract Interpretation based upon approximation of a fixpoint collecting semantics using Galois connections.

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. P. Cousot & R. Cousot. Abstract Interpretation Frameworks. Journal of logic and computation. 1992.

    Google Scholar 

  2. P. Cousot & R. Cousot. Galois Connection Based Abstract Interpretation for Strictness Analysis. In LNCS 735, pages 98–127. Springer-Verlag, 1993.

    Google Scholar 

  3. P. Cousot & R. Cousot. Higher-Order Abstract Interpretation (and Application to Comportment Analysis Generalizing Strictness, Termination, Projection and PER Analysis of Functional Languages). 1994.

    Google Scholar 

  4. K. Davis. Higher-order Binding-time Analysis. In Proceedings PEPM'93, pages 80–87, Copenhagen, Denmark, 14–16 June 1993. ACM Press, 1993.

    Google Scholar 

  5. N. D. Jones & C. K. Gomard & P. Sestoft. Partial Evaluation and Automatic Program Generation, pages 1–100, Prentice Hall

    Google Scholar 

  6. P. Jouvelot & C. Consel. Separate Polyvariant Binding-Time Analysis.

    Google Scholar 

  7. A. Mycroft. Abstract Interpretation and Optimising Transformations for Applicative Programs. Ph.D. Dissertation, CST-15-81, Department of Computer Science, University of Edinburgh, Edinburgh, Scot., 1981.

    Google Scholar 

  8. J. Palsberg & M. I. Schwartzbach. Binding-time Analysis: Abstract Interpretation versus Type Inference.

    Google Scholar 

  9. S. Hunt & D. Sands. Binding Time Analysis: A New PERspective. Symposium on Partial Evaluation and Semantics-Based Program Manipulation. Proceedings PEPM'91, pages 154–165, Yale University, New Haven, Connecticut, USA, 17–19 June 1991. ACM Press, 1991.

    Google Scholar 

  10. M. Wand. Specifying the Correctness of Binding-Time Analysis. Symposium on Principles of Programming Languages. Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT, pages 137–143, Charleston, South Carolina, 10–13 January 1993. ACM Press, 1993.

    Google Scholar 

  11. J. Launchbury. Strictness and Binding-Time Analysis: two for the price of one. In Proceedings ACM SIGPLAN '91 Conference on Programming Language Design and Implementation, pages 80–91, 1991.

    Google Scholar 

  12. K. L. Solberg, H. R. Nielson and F. Nielson. Strictness and totality Analysis. First International Static Analysis Symposium. Proceedings SAS '94, pages 408–422, Namur, Belgium, September 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire Informatique de l'École Normale Supérieure, 45 rue d'Ulm, 75230, Paris Cedex 05, France

    Franck Védrine

Authors
  1. Franck Védrine
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alan Mycroft

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Védrine, F. (1995). Binding-time analysis and strictness analysis by abstract interpretation. In: Mycroft, A. (eds) Static Analysis. SAS 1995. Lecture Notes in Computer Science, vol 983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60360-3_52

Download citation

  • DOI: https://doi.org/10.1007/3-540-60360-3_52

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60360-3

  • Online ISBN: 978-3-540-45050-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation