Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

Amortised resource analysis with separation logic

Atkey, Robert (2010) Amortised resource analysis with separation logic. [Proceedings Paper]

[img]
Preview
PDF - Submitted Version
Download (256Kb) | Preview

    Abstract

    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.

    Item type: Proceedings Paper
    ID code: 36467
    Keywords: separation logic , programming languages, Electronic computers. Computer science
    Subjects: Science > Mathematics > Electronic computers. Computer science
    Department: Faculty of Science > Computer and Information Sciences
    Related URLs:
    Depositing user: Pure Administrator
    Date Deposited: 16 Dec 2011 16:30
    Last modified: 20 Jul 2013 21:36
    URI: http://strathprints.strath.ac.uk/id/eprint/36467

    Actions (login required)

    View Item

    Fulltext Downloads: