Abstract. This paper presents a constraint-based method for generating universally quantified loop invariants over array and scalar variables. Constraints are solved by means of an SMT solver, thus leveraging recent advances in SMT solving for the theory of non-linear arithmetic. The method has been implemented in a prototype of program analyzer, and a wide sample of examples illustrating its power is shown.
Paper REF presents a constraint-based invariant generation method for generating universally quantified loop invariants over arrays, and paper [1] proposes a model checker for verifying universally quantified safety properties of arrays.
SMT-Based Array Invariant Generation
VMCAI
Computer Science