Cyclic abduction of inductively defined safety and termination preconditions

Brotherston, James and Gorogiannis, Nikos (2014) Cyclic abduction of inductively defined safety and termination preconditions. In: 21st International Static Analysis Symposium, SAS 2014, 11-13 Sept 2014, Munich, Germany.

[img]
Preview
PDF - Final accepted version (with author's formatting)
Download (410kB) | Preview

Abstract

We introduce cyclic abduction: a new method for automatically inferring safety and termination preconditions of heap manipulating while programs, expressed as inductive definitions in separation logic. Cyclic abduction essentially works by searching for a cyclic proof of the desired property, abducing definitional clauses of the precondition as necessary in order to advance the proof search process.

We provide an implementation, Caber, of our cyclic abduction method, based on a suite of heuristically guided tactics. It is often able to automatically infer preconditions describing lists, trees, cyclic and composite structures which, in other tools, previously had to be supplied by hand.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Published paper appears in: Static Analysis, Volume 8723 of the series Lecture Notes in Computer Science, pp 68-84
Research Areas: A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 15929
Notes on copyright: The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-10936-7_5
Depositing User: Nikos Gkorogiannis
Date Deposited: 12 May 2015 15:16
Last Modified: 14 Mar 2018 08:10
URI: http://eprints.mdx.ac.uk/id/eprint/15929

Actions (login required)

Edit Item Edit Item

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year