Sciweavers

63 search results - page 5 / 13
» Predicate Abstraction via Symbolic Decision Procedures
Sort
View
TACAS
2004
Springer
110views Algorithms» more  TACAS 2004»
14 years 3 months ago
An Interpolating Theorem Prover
We present a method of deriving Craig interpolants from proofs in the quantifier-free theory of linear inequality and uninterpreted function symbols, and an interpolating theorem...
Kenneth L. McMillan
CAV
2005
Springer
122views Hardware» more  CAV 2005»
14 years 3 months ago
Interpolant-Based Transition Relation Approximation
Abstract. In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, sof...
Ranjit Jhala, Kenneth L. McMillan
ICALP
2005
Springer
14 years 3 months ago
Combining Intruder Theories
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...
Yannick Chevalier, Michaël Rusinowitch
FSTTCS
2006
Springer
14 years 1 months ago
Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper...
Véronique Cortier, Steve Kremer, Ralf K&uum...
CAV
2008
Springer
139views Hardware» more  CAV 2008»
13 years 11 months ago
CSIsat: Interpolation for LA+EUF
We present CSIsat, an interpolating decision procedure for the quantifier-free theory of rational linear arithmetic and equality with uninterpreted function symbols. Our implementa...
Dirk Beyer, Damien Zufferey, Rupak Majumdar