26 search results - page 2 / 6 » cade 2009 |
CADE
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We prove several results related to local proofs, interpolation and suion calculus and discuss their use in predicate abstraction and invariant generation. Our proofs and...
CADE
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. This article describes the first public version of the satisfiability modulo theory (SMT) solver veriT. It is open-source, proof-producing, and complete for quantifier-fr...
CADE
2009
Springer
14 years 5 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
CADE
2009
Springer
14 years 5 months ago
2009
Springer
In the symbolic analysis of security protocols, two classical notions of knowledge, deducibility and indistinguishability, yield corresponding decision problems. We propose a proce...
CADE
2009
Springer
14 years 5 months ago
2009
Springer
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...