Sciweavers

30 search results - page 4 / 6
» First-Order Logic with Reachability Predicates on Infinite S...
Sort
View
FSTTCS
2004
Springer
13 years 10 months ago
A Decidable Fragment of Separation Logic
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
LICS
2006
IEEE
13 years 11 months ago
Monadic Chain Logic Over Iterations and Applications to Pushdown Systems
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....
Dietrich Kuske, Markus Lohrey
AICOM
2010
127views more  AICOM 2010»
13 years 5 months ago
Interactive verification of concurrent systems using symbolic execution
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
Simon Bäumler, Michael Balser, Florian Nafz, ...
CADE
2007
Springer
14 years 5 months ago
System Description: E-KRHyper
The E-KRHyper system is a model generator and theorem prover for first-order logic with equality. It implements the new E-hyper tableau calculus, which integrates a superposition-b...
Björn Pelzer, Christoph Wernhard
CADE
2010
Springer
13 years 6 months ago
MCMT: A Model Checker Modulo Theories
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
Silvio Ghilardi, Silvio Ranise