Skip to main content
SpringerLink
Log in

Finiteness conditions for strictness analysis

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

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

Included in the following conference series:

Abstract

We give upper bounds on the number of times the fixed point operator needs to be unfolded for strictness analysis of functional languages with lists. This extends previous work both in the syntax-directed nature of the approach and in the ability to deal with Wadler's method for analysing lists. Limitations of the method are indicated.

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. S.Abramsky: Strictness Analysis and Polymorphic Invariance, Programs as Data Objects, Springer Lecture Notes in Computer Science 217 1–23, 1986.

    Google Scholar 

  2. G.L.Burn, C.Hankin, S.Abramsky: Strictness Analysis for Higher-Order Functions, Science of Computer Programming 7, 1986.

    Google Scholar 

  3. S.Hunt, C.Hankin: Fixed Points and Frontiers: a New Perspective, Journal of Functional Programming 1, 1991.

    Google Scholar 

  4. T.J.Marlowe, B.G.Ryder: Properties of Data Flow Frameworks — a Unified Model, Acta Informatica 28, 1990.

    Google Scholar 

  5. H.R.Nielson, F.Nielson: Bounded Fixed Point Iteration, Proceedings of the ACM Sympoisium on Principles of Programming Languages, 1992. An expanded version appeared in Journal of Logic and Computation 2 4, 1992.

    Google Scholar 

  6. F.Nielson, H.R.Nielson: Finiteness Conditions for Fixed Point Iteration (Extended Abstract), Proceedings of the ACM Symposium on LISP and Functional Programming, 1992. An extended version appeared as [7].

    Google Scholar 

  7. F.Nielson, H.R.Nielson: Finiteness Conditions for Fixed Point Iteration, Technical Report DAIMI PB-384, Aarhus University, Denmark, 1992. An extended abstract appeared as [6].

    Google Scholar 

  8. F.Nielson, H.R.Nielson: Two-Level Functional Languages, Cambridge Tracts in Theoretical Computer Science 34, Cambridge University Press, 1992.

    Google Scholar 

  9. F.Nielson, H.R.Nielson: Finiteness Conditions for Strictness Analysis, Technical Report DAIMI PB-447, Aarhus University, Denmark, 1993.

    Google Scholar 

  10. P.Wadler: Strictness Analysis on Non-Flat Domains (by Abstract Interpretation over Finite Domains), Abstract Interpretation of Declarative Languages, S.Abramsky and C.Hankin (eds.), Ellis Horwood, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Aarhus University, Ny Munkegade, DK-8000, Aarhus C, Denmark

    Flemming Nielson & Hanne Riis Nielson

Authors
  1. Flemming Nielson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hanne Riis Nielson
    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

Nielson, F., Nielson, H.R. (1993). Finiteness conditions for strictness analysis. 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_41

Download citation

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

  • 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