Sciweavers

394 search results - page 3 / 79
» An Abstract Domain of Uninterpreted Functions
Sort
View
CADE
2009
Springer
14 years 5 months ago
veriT: An Open, Trustable and Efficient SMT-Solver
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...
David Déharbe, Diego Caminha B. de Oliveira...
MJ
2006
102views more  MJ 2006»
13 years 5 months ago
Hybrid verification integrating HOL theorem proving with MDG model checking
In this paper, we describe a hybrid tool for hardware formal verification that links the HOL (higher-order logic) theorem prover and (multiway decision graphs) model checker. Our ...
Rabeb Mizouni, Sofiène Tahar, Paul Curzon
ICCD
2004
IEEE
137views Hardware» more  ICCD 2004»
14 years 2 months ago
Comparative Study of Strategies for Formal Verification of High-Level Processors
Compared are different methods for evaluation of formulas expressing microprocessor correctness in the logic of Equality with Uninterpreted Functions and Memories (EUFM) by transl...
Miroslav N. Velev
TABLEAUX
1998
Springer
13 years 9 months ago
A Tableau Calculus for Quantifier-Free Set Theoretic Formulae
Abstract. Set theory is the common language of mathematics. Therefore, set theory plays an important r^ole in many important applications of automated deduction. In this paper, we ...
Bernhard Beckert, Ulrike Hartmer
CAV
2008
Springer
139views Hardware» more  CAV 2008»
13 years 7 months ago
CSIsat: Interpolation for LA+EUF
We present CSIsat, an interpolating decision procedure for the quantifier-free theory of rational linear arithmetic and equality with uninterpreted function symbols. Our implementa...
Dirk Beyer, Damien Zufferey, Rupak Majumdar