EufDpll - A Tool to Check Satisfiability of Equality Logic Formulas

Authors:
Olga Tveretina;Wieger Wesselink
Affiliations:
Institute for Computing and Information Sciences, Radboud University, Nijmegen, The Netherlands;Department of Computer Science, TU Eindhoven, Eindhoven, The Netherlands
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 11
Cited 0

Efficient annotated terms

Software—Practice & Experience
An algorithm for reasoning about equality

Communications of the ACM
A machine program for theorem-proving

Communications of the ACM
Boolean satisfiability with transitivity constraints

ACM Transactions on Computational Logic (TOCL)
The small model property: how small can it be?

Information and Computation
Validity Checking for Combinations of Theories with Equality

FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
BDD Based Procedures for a Theory of Equality with Uninterpreted Functions

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Automatic verification of Pipelined Microprocessor Control

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Generalizing DPLL and satisfiability for equalities

Information and Computation
Decision procedures for SAT, SAT modulo theories and beyond. the barcelogictools

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Yet another decision procedure for equality logic

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

Decision procedures for subsets of First-Order Logic form the core of many verification tools. Applications include hardware and software verification. The logic of Equality with Uninterpreted Functions (EUF) is a decidable subset of First-Order Logic. The EUF logic and its extensions have been applied for proving equivalence between systems. We present a branch and bound decision procedure for EUF logic based on the generalisation of the Davis-Putnam-Loveland-Logemann procedure (EUF-DPLL). EufDpll is a tool to check satisfiability of EUF formulas based on this procedure.