A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
EufDpll - A Tool to Check Satisfiability of Equality Logic Formulas
2009
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
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).
doi:10.1016/j.entcs.2008.12.089
fatcat:dcscllju5fhkbaq4ge42owctye