851 search results - page 9 / 171 » Inaccessibility in Decision Procedures |
CADE
2005
Springer
14 years 7 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
AISC
2004
Springer
14 years 28 days ago
2004
Springer
The equality logic with uninterpreted functions (EUF) has been proposed for processor verification. A procedure for proving satisfiability of formulas in this logic is introduced...
FMCAD
2009
Springer
13 years 11 months ago
2009
Springer
Abstract--The theory of arrays is ubiquitous in the context of software and hardware verification and symbolic analysis. The basic array theory was introduced by McCarthy and allow...
DAGSTUHL
2007
13 years 9 months ago
2007
Abstract. The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitabl...
CADE
2007
Springer
14 years 7 months ago
2007
Springer
We present a multi-context focused sequent calculus whose derivations are in bijective correspondence with normal natural deductions in the propositional fragment of the intuitioni...