Skip to main content
SpringerLink
Log in

Static Complexity Analysis of Higher Order Programs

  • Conference paper
Book cover Foundational and Practical Aspects of Resource Analysis (FOPARA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6324))

Abstract

In the paper’s first part, we present a method for certifying that the values computed by a first order imperative program will be bounded by polynomials in the program’s inputs. Our method does not yield concrete polynomials, but shows existence of polynomial bounds and upper bounds to their polynomial degrees. In the second part of the paper, we lift our method to allow analysis of higher order programs.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ben-Amram, A.M., Jones, N.D., Kristiansen, L.: Linear, polynomial or exponential? Complexity inference in polynomial time. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 67–76. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. Benzinger, R.: Automated higher-order complexity analysis. Theor. Comput. Sci. 318(1-2), 79–103 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bonfante, G., Marion, J.-Y., Moyen, J.-Y.: Quasi-interpretations, a way to control resources. Theoretical Computer Science (to appear)

    Google Scholar 

  4. Crolard, T., Polonowski, E., Valarcher, P.: Extending the loop language with higher-order procedural variables. ACM Trans. Comput. Logic 10(4), 1–37 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Jones, N.D., Kristiansen, L.: A flow calculus of mwp-bounds for complqexity analysis. ACM Trans. Comput. Logic 10(4), 1–41 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kristiansen, L., Jones, N.D.: The flow of data and the complexity of algorithms. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 263–274. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Marion, J.-Y., Péchoux, R.: Sup-interpretations, a semantic method for static analysis of program resources. ACM Trans. Comput. Logic 10(4), 1–31 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Meyer, A.R., Ritchie, D.M.: The complexity of loop programs. In: ACM ’67: Proceedings of the 1967 22nd National Conference, pp. 465–469. ACM, New York (1967)

    Chapter  Google Scholar 

  9. Niggl, K.-H., Wunderlich, H.: Certifying polynomial time and linear/polynomial space for imperative programs. SIAM J. Comput. 35(5), 1122–1147 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DIKU, University of Copenhagen, Denmark

    James Avery

  2. Department of Mathematics, University of Oslo, Norway

    Lars Kristiansen

  3. LIPN, UMR 7030, CNRS, Université Paris 13, F-93430, Villetaneuse, France

    Jean-Yves Moyen

Authors
  1. James Avery
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lars Kristiansen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jean-Yves Moyen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Computing and Information Sciences, Radboud Universiteit Nijmegen, P.O. Box 9102, 6500 HC, Nijmegen, The Netherlands

    Marko van Eekelen

  2. Institute for Computing and Information Sciences, Radboud University Nijmegen, The Netherlands

    Olha Shkaravska

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Avery, J., Kristiansen, L., Moyen, JY. (2010). Static Complexity Analysis of Higher Order Programs. In: van Eekelen, M., Shkaravska, O. (eds) Foundational and Practical Aspects of Resource Analysis. FOPARA 2009. Lecture Notes in Computer Science, vol 6324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15331-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15331-0_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15330-3

  • Online ISBN: 978-3-642-15331-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation