Symbolic Polytopes for Quantitative Interpolation and Verification [chapter]

Klaus von Gleissenthall, Boris Köpf, Andrey Rybalchenko
2015 Lecture Notes in Computer Science  
Proving quantitative properties of programs, such as bounds on resource usage or information leakage, often leads to verification conditions that involve cardinalities of sets. Existing approaches for dealing with such verification conditions operate by checking cardinality bounds for given formulas. However, they cannot synthesize formulas that satisfy given cardinality constraints, which limits their applicability for inferring cardinality-based inductive arguments. In this paper we present
more » ... algorithm for synthesizing formulas for given cardinality constraints, which relies on the theory of counting integral points in symbolic polytopes. We cast our algorithm in terms of a cardinality-constrained interpolation procedure, which we put to work in a solver for recursive Horn clauses with cardinality constraints based on abstraction refinement. We implement our technique and describe its evaluation on a number of representative examples.
doi:10.1007/978-3-319-21690-4_11 fatcat:rxmyywpcqjgh7liwjih424onwa