: a new method for automatically inferring safety and termination preconditions of heap-manipulating
programs, expressed as inductive definitions in separation logic. Cyclic abduction essentially works by searching for a
of the desired property, abducing definitional clauses of the precondition as necessary in order to advance the proof search process.
We provide an implementation,
, 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.