Cyclic abduction of inductively defined safety and termination preconditions

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.

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-10936-7_5

Published paper appears in: Static Analysis, Volume 8723 of the series Lecture Notes in Computer Science, pp 68-84