Sciweavers

15 search results - page 1 / 3
» Assertion Checking over Combined Abstraction of Linear Arith...
Sort
View
FM
2009
Springer
104views Formal Methods» more  FM 2009»
15 years 4 months ago
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
Helmut Seidl, Vesal Vojdani, Varmo Vene
ESOP
2008
Springer
14 years 11 months ago
Cover Algorithms and Their Combination
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
Sumit Gulwani, Madan Musuvathi
SPIN
2012
Springer
12 years 12 months ago
SMTInterpol: An Interpolating SMT Solver
Abstract. Craig interpolation is an active research topic and has become a powerful technique in verification. We present SMTInterpol, an interpolating SMT solver for the quanti...
Jürgen Christ, Jochen Hoenicke, Alexander Nut...
VMCAI
2007
Springer
15 years 3 months ago
Invariant Synthesis for Combined Theories
We present a constraint-based algorithm for the synthesis of invariants expressed in the combined theory of linear arithmetic and uninterpreted function symbols. Given a set of pro...
Dirk Beyer, Thomas A. Henzinger, Rupak Majumdar, A...