Skip to main content
SpringerLink
Log in

Amortized Complexity Verified

  • Conference paper
  • First Online:
Interactive Theorem Proving (ITP 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9236))

Included in the following conference series:

Abstract

A framework for the analysis of the amortized complexity of (functional) data structures is formalized in Isabelle/HOL and applied to a number of standard examples and to three famous non-trivial ones: skew heaps, splay trees and splay heaps.

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 EPUB and 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

References

  1. Atkey, R.: Amortised resource analysis with separation logic. Logical Methods Comput. Sci. 7(2), 33 (2011)

    Article  MathSciNet  Google Scholar 

  2. Charguéraud, A., Pottier, F.: Machine-checked verification of the correctness and amortized complexity of an efficient union-find implementation. In: Urban, C., Zhang, X. (ed.) ITP 2015. LNCS, vol. 9236, pp. 137–154. Springer, Heidelberg (2015)

    Google Scholar 

  3. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, New York (1990)

    MATH  Google Scholar 

  4. Fredman, M.L., Sedgewick, R., Sleator, D.D., Tarjan, R.E.: The pairing heap: A new form of self-adjusting heap. Algorithmica 1(1), 111–129 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  5. Harrison, J.: Verifying nonlinear real formulas via sums of squares. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol. 4732, pp. 102–118. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Hoffmann, J., Aehlig, K., Hofmann, M.: Multivariate amortized resource analysis. ACM Trans. Program. Lang. Syst. 34(3), 14 (2012)

    Article  MATH  Google Scholar 

  7. Hofmann, M., Jost, S.: Static prediction of heap space usage for first-order functional programs. In: Proceedings of the 30th ACM Symposium Principles of Programming Languages, pp. 185–197 (2003)

    Google Scholar 

  8. Kaldewaij, A., Schoenmakers, B.: The derivation of a tighter bound for top-down skew heaps. Inf. Process. Lett. 37, 265–271 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  9. Nipkow, T.: Amortized complexity verified. Archive of Formal Proofs (2014). http://afp.sf.net/entries/Amortized_Complexity.shtml. Formal proof development

  10. Okasaki, C.: Purely Functional Data Structures. Cambridge University Press, Cambridge (1998)

    Book  Google Scholar 

  11. Schoenmakers, B.: A systematic analysis of splaying. Inf. Process. Lett. 45, 41–50 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  12. Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM 32(3), 652–686 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  13. Sleator, D.D., Tarjan, R.E.: Self-adjusting heaps. SIAM J. Comput. 15(1), 52–69 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  14. Tarjan, R.E.: Amortized complexity. SIAM J. Alg. Disc. Meth. 6(2), 306–318 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  15. Traytel, D., Berghofer, S., Nipkow, T.: Extending hindley-milner type inference with coercive structural subtyping. In: Yang, H. (ed.) APLAS 2011. LNCS, vol. 7078, pp. 89–104. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Acknowledgement

Berry Schoenmakers patiently answered many questions about his work whenever I needed help.

Author information

Authors and Affiliations

  1. Technische Universität München, Munich, Germany

    Tobias Nipkow

Authors
  1. Tobias Nipkow
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tobias Nipkow .

Editor information

Editors and Affiliations

  1. Department of Informatics, King's College London, London, United Kingdom

    Christian Urban

  2. PLA University of Science and Technology, Nanjing, China

    Xingyuan Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Nipkow, T. (2015). Amortized Complexity Verified. In: Urban, C., Zhang, X. (eds) Interactive Theorem Proving. ITP 2015. Lecture Notes in Computer Science(), vol 9236. Springer, Cham. https://doi.org/10.1007/978-3-319-22102-1_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22102-1_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22101-4

  • Online ISBN: 978-3-319-22102-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation