VIAP - Automated System for Verifying Integer Assignment Programs with Loops

Viap 1.1

“…-Back-End: The system takes the set of translated first-order axioms and translates all the axioms to equations compatible with Z3 (Version 4.5) by preprocessing them using SymPy (Version 1.1.1). Then the proof engine applies different strategies and tries to prove post-conditions in Z3 [2].…”

“…The axioms in the set Π X P are generated inductively on the structure of P . The algorithm is described in detail in [1] and an implementation is explained in [2]. The inductive cases of translations are given in the table provided in the supplementary information 1 .…”

“…We work in a refutation-based proof schema, i.e., in order to prove that a formula is valid in a background theory T, we show that α ∧ Π X P ∧ ¬β is T-unsatisfiable. In VIAP, we implemented two different strategies whose details can be found in our previous work [2].…”

“…It translates a given program to a set of first-order axioms with natural number quantification using an algorithm proposed by Lin [1]. An earlier version of VIAP competed at SV-COMP 2018, and is described in [2,3]. A key feature of Lin's translation is that loops are translated to a set of recurrence relations.…”

Machine Theorem Discovery

“…Effectively, our system (Rajkhowa and Lin 2017) will translate it into the problem of proving …”