Triggerless happy: Intermediate verification with a first-order prover
Paper i proceeding, 2017

SMT solvers have become de rigueur in deductive verification to automatically prove the validity of verification conditions. While these solvers provide an effective support for theories—such as arithmetic—that feature strongly in program verification, they tend to be more limited in dealing with first-order quantification, for which they have to rely on special annotations—known as triggers—to guide the instantiation of quantifiers. Writing effective triggers is necessary to achieve satisfactory performance with SMT solvers, but remains a tricky endeavor—beyond the purview of non-highly trained experts. In this paper, we experiment with the idea of using first-order provers instead of SMT solvers to prove the validity of verification conditions. First-order provers offer a native support for unrestricted quantification, but have been traditionally limited in theory reasoning. By leveraging some recent extensions to narrow this gap in the Vampire first-order prover, we describe a first-order encoding of verification conditions of programs written in the Boogie intermediate verification language. Experiments with a prototype implementation on a variety of Boogie programs suggest that first-order provers can help achieve more flexible and robust performance in program verification, while avoiding the pitfalls of having to manually guide instantiations by means of triggers.

Författare

Chen Yuting

Formella metoder

Carlo A Furia

Formella metoder

Lecture Notes in Computer Science - 13th International Conference on Integrated Formal Methods, IFM 2017, Turin, Italy, 20-22 September 2017

Vol. 10510 295-311

Ämneskategorier

Datavetenskap (datalogi)

DOI

10.1007/978-3-319-66845-1_19

ISBN

978-3-319-66844-4

Mer information

Skapat

2017-10-25