Amortised resource analysis with separation logic

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

101 Downloads (Pure)


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.
Original languageEnglish
Title of host publicationProceedings of 19th European Symposium on Programming, ESOP 2010
EditorsAndrew Gordon
Publication statusPublished - 2010

Publication series

NameLecture Notes in Computer Science


  • separation logic
  • programming languages


Dive into the research topics of 'Amortised resource analysis with separation logic'. Together they form a unique fingerprint.

Cite this