3342 search results - page 266 / 669 » Automating Abstract Interpretation |
105
click to vote
CADE
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. An extension of the superposition-based E-prover [8] is described. The extension allows terms with integer exponents [3] in the input language. Obviously, this possibilit...
139
Voted
CADE
2009
Springer
16 years 4 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...
141
click to vote
CADE
2008
Springer
16 years 4 months ago
2008
Springer
Abstract. This paper presents verified quantifier elimination procedures for dense linear orders (DLO), for real and for integer linear arithmetic. The DLO procedures are new. All ...
129
Voted
CADE
2006
Springer
16 years 4 months ago
2006
Springer
Abstract. We present a formally verified quantifier elimination procedure for the first order theory over linear mixed real-integer arithmetics in higher-order logic based on a wor...
101
click to vote
CADE
2005
Springer
16 years 4 months ago
2005
Springer
Abstract. We describe the instance store, a system for reasoning about individuals (i.e., instances of classes) in OWL ontologies. By using a hybrid reasoner/database architecture,...