Brotherston, J;
Gorogiannis, N;
(2014)
Cyclic abduction of inductively defined safety and termination preconditions.
In:
Cyclic Abduction of Inductively Defined Safety and Termination Precondition.
(pp. 68 - 84).
Springer International Publishing: Switzerland.
Preview |
PDF
cyclic_abduction_SAS14.pdf Available under License : See the attached licence file. Download (434kB) |
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.
Type: | Proceedings paper |
---|---|
Title: | Cyclic abduction of inductively defined safety and termination preconditions |
Event: | 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. |
ISBN-13: | 9783319109350 |
Open access status: | An open access version is available from UCL Discovery |
DOI: | 10.1007/978-3-319-10936-7_5 |
Language: | English |
Additional information: | The original publication is available at www.springerlink.com |
UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
URI: | https://discovery.ucl.ac.uk/id/eprint/1451944 |
Archive Staff Only
View Item |