Cyclic abduction of inductively defined safety and termination preconditions

Brotherston, James and Gorogiannis, Nikos ORCID logoORCID: (2014) Cyclic abduction of inductively defined safety and termination preconditions. Static Analysis: 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. Proceedings. In: 21st International Static Analysis Symposium, SAS 2014, 11-13 Sept 2014, Munich, Germany. ISBN 9783319109350. ISSN 0302-9743 [Conference or Workshop Item] (doi:10.1007/978-3-319-10936-7_5)

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


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
Depositing User: Nikos Gkorogiannis
Date Deposited: 12 May 2015 15:16
Last Modified: 06 Jun 2022 16:30

Actions (login required)

View Item View Item


Activity Overview
6 month trend
6 month trend

Additional statistics are available via IRStats2.