Abstract
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. Since it is based on the DPLL method, the procedure can adopt its heuristics. Therefore the procedure can be used as a basis for efficient implementations of satisfiability checkers for EUF. A part of the introduced method is a technique for reducing the size of formulas, which can also be used as a preprocessing step in other approaches for checking satisfiability of EUF formulas. ©Springer-Verlag 2004.
Author supplied keywords
Cite
CITATION STYLE
Tveretina, O. (2004). A Decision Procedure for Equality Logic with Uninterpreted Functions. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3249, 66–79. https://doi.org/10.1007/978-3-540-30210-0_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
