Skip to Main content Skip to Navigation
Conference papers

Extending Constraint-Only Representation of Polyhedra with Boolean Constraints

Abstract : We propose a new relational abstract domain for analysing programs with numeric and Boolean variables. The main idea is to represent an abstract state as a set of linear constraints over numeric variables, with every constraint being enabled by a formula over Boolean variables. This allows us, unlike in some existing approaches, to avoid duplicating linear constraints shared by multiple Boolean formulas. To perform domain operations, we adapt algorithms from constraint-only representation of convex polyhedra, most importantly Fourier-Motzkin elimination and projection-based convex hull. We made a prototype implementation of the new domain in our abstract interpreter for Horn clauses. Our initial experiments are, in our opinion, promising and show directions for future improvement.
Document type :
Conference papers
Complete list of metadata

Cited literature [52 references]  Display  Hide  Download
Contributor : Alexey Bakhirkin Connect in order to contact the contributor
Submitted on : Wednesday, January 23, 2019 - 7:21:51 PM
Last modification on : Wednesday, November 3, 2021 - 4:28:25 AM


Files produced by the author(s)




Alexey Bakhirkin, David Monniaux. Extending Constraint-Only Representation of Polyhedra with Boolean Constraints. 25th Static Analysis Symposium (SAS 2018), Aug 2018, Freiburg im Breisgau, Germany. pp.127-145, ⟨10.1007/978-3-319-99725-4_10⟩. ⟨hal-01841837v2⟩



Record views


Files downloads