851 search results - page 9 / 171 » Inaccessibility in Decision Procedures |
149
Voted
CADE
2005
Springer
16 years 4 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...
131
Voted
AISC
2004
Springer
15 years 9 months 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...
139
Voted
FMCAD
2009
Springer
15 years 7 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...
125
Voted
DAGSTUHL
2007
15 years 5 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...
135
Voted
CADE
2007
Springer
16 years 4 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...