Synthesizing invariants by solving solvable loops

Abstract : Formal program verification faces two problems. The first problem is related to the necessity of having automated solvers that are powerful enough to decide whether a formula holds for a set of proof obligations as large as possible, whereas the second manifests in the need of finding sufficiently strong invariants to obtain correct proof obligations. This paper focuses on the second problem and describes a new method for the automatic generation of loop invariants that handles polynomial and non deterministic assignments. This technique is based on the eigenvector generation for a given linear transformation and on the polynomial optimization problem, which we implemented on top of the open-source tool Pilat.
Document type :
Journal articles
Complete list of metadatas

https://hal-cea.archives-ouvertes.fr/cea-01808784
Contributor : Léna Le Roy <>
Submitted on : Wednesday, June 6, 2018 - 9:46:51 AM
Last modification on : Friday, July 26, 2019 - 4:26:20 PM

Links full text

Identifiers

Collections

Citation

S. Oliveira, S. Bensalem, V. Prevosto. Synthesizing invariants by solving solvable loops. Lecture Notes in Computer Science, Springer, 2017, 10482 LNCS, pp.327-343. ⟨10.1007/978-3-319-68167-2_22⟩. ⟨cea-01808784⟩

Share

Metrics

Record views

55