Ilinva: Using Abduction to Generate Loop Invariants

Mnacho Echenim 1 Nicolas Peltier 1 Yanis Sellami 1
1 LIG Laboratoire d'Informatique de Grenoble - CAPP
LIG - Laboratoire d'Informatique de Grenoble
Abstract : We describe a system to prove properties of programs. The key feature of this approach is a method to automatically synthesize in-ductive invariants of the loops contained in the program. The method is generic, i.e., it applies to a large set of programming languages and application domains; and lazy, in the sense that it only generates invariants that allow one to derive the required properties. It relies on an existing system called GPiD for abductive reasoning modulo theories [14], and on the platform for program verification Why3 [16]. Experiments show evidence of the practical relevance of our approach.
Document type :
Conference papers
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02323446
Contributor : Nicolas Peltier <>
Submitted on : Tuesday, November 5, 2019 - 10:07:43 AM
Last modification on : Thursday, November 7, 2019 - 11:38:26 AM

File

paper_10.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Mnacho Echenim, Nicolas Peltier, Yanis Sellami. Ilinva: Using Abduction to Generate Loop Invariants. Frontiers of Combining Systems - 12th International Symposium, 2019, London, United Kingdom. pp.77-93, ⟨10.1007/978-3-030-29007-8_5⟩. ⟨hal-02323446⟩

Share

Metrics

Record views

32

Files downloads

35