Amortised Resource Analysis with Separation Logic

  • Robert Atkey
Conference paper

DOI: 10.1007/978-3-642-11957-6_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6012)
Cite this paper as:
Atkey R. (2010) Amortised Resource Analysis with Separation Logic. In: Gordon A.D. (eds) Programming Languages and Systems. ESOP 2010. Lecture Notes in Computer Science, vol 6012. Springer, Berlin, Heidelberg


Type-based amortised resource analysis following Hofmann and Jost—where resources are associated with individual elements of data structures and doled out to the programmer under a linear typing discipline—have been successful in providing concrete resource bounds for functional programs, with good support for inference. In this work we translate the idea of amortised resource analysis to imperative languages by embedding a logic of resources, based on Bunched Implications, within Separation Logic. The Separation Logic component allows us to assert the presence and shape of mutable data structures on the heap, while the resource component allows us to state the resources associated with each member of the structure.

We present the logic on a small imperative language with procedures and mutable heap, based on Java bytecode. We have formalised the logic within the Coq proof assistant and extracted a certified verification condition generator. We demonstrate the logic on some examples, including proving termination of in-place list reversal on lists with cyclic tails.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Robert Atkey
    • 1
  1. 1.LFCS, School of InformaticsUniversity of Edinburgh 

Personalised recommendations