80 search results - page 1 / 16 » A Decision Procedure for Equality Logic with Uninterpreted F... |
AISC
2004
Springer
13 years 10 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...
CAV
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. In using the logic of equality with unininterpreted functions to verify hardware systems, specific characteristics of the formula describing the correctness condition ca...
LATIN
2004
Springer
13 years 10 months ago
2004
Springer
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
DAC
2003
ACM
14 years 5 months ago
2003
ACM
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
ENTCS
2007
13 years 4 months ago
2007
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...