30 search results - page 4 / 6 » First-Order Logic with Reachability Predicates on Infinite S... |
FSTTCS
2004
Springer
15 years 5 months ago
2004
Springer
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...
103
Voted
LICS
2006
IEEE
15 years 5 months ago
2006
IEEE
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....
92
Voted
AICOM
2010
14 years 11 months ago
2010
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...
111
Voted
CADE
2007
Springer
15 years 12 months ago
2007
Springer
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...
106
click to vote
CADE
2010
Springer
15 years 24 days ago
2010
Springer
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...