We present a method for automatic inference of conditions on the initial states of a program that guarantee that the safety assertions in the program are not violated. Constrained Horn clauses (CHCs) are used to model the program and assertions in a uniform way, and we use standard abstract interpretations to derive an over-approximation of the set of unsafe initial states. The precondition then is the constraint corresponding to the complement of that set, under-approximating the set of safe initial states. This idea of complementation is not new, but previous attempts to exploit it have suffered from the loss of precision. Here we develop an iterative specialisation algorithm to give more precise, and in some cases optimal safety conditions. The algorithm combines existing transformations, namely constraint specialisation, partial evaluation and a trace elimination transformation. The last two of these transformations perform polyvariant specialisation, leading to disjunctive constraints which improve precision. The algorithm is implemented and tested on a benchmark suite of programs from the literature in precondition inference and software verification competitions.
|Tidsskrift||Theory and Practice of Logic Programming|
|Status||Udgivet - jul. 2018|
|Begivenhed||34th International Conference on Logic Programming - Oxford, Storbritannien|
Varighed: 14 jul. 2018 → 17 jul. 2018
|Konference||34th International Conference on Logic Programming|
|Periode||14/07/2018 → 17/07/2018|
Kafle, B., Gallagher, J. P., Gange, G., Schachte, P., Søndergaard, H., & Stuckey, P. J. (2018). An iterative approach to precondition inference using constrained Horn clauses. Theory and Practice of Logic Programming, 18(3-4), 553-570. https://doi.org/10.1017/S1471068418000091