Satisfiability Checking for Logic with Equality and Uninterpreted Functions under Equivalence Constraints

Authors:
Hiroaki Kozawa;Kiyoharu Hamaguchi;Toshinobu Kashiwabara
Affiliations:
-;-;-
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2007

Citing 4
Cited 1

GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Automatic formal verification of DSP software

Proceedings of the 37th Annual Design Automation Conference
Compiler generation techniques for embedded processors and their application to HW/SW codesign

System-level synthesis
Refinement strategies for verification methods based on datapath abstraction

ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference

Approximate Invariant Property Checking Using Term-Height Reduction for a Subset of First-Order Logic

ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

For formal verification of large-scale digital circuits, a method using satisfiability checking of logic with equality and uninterpreted functions has been proposed. This logic, however, does not consider specific properties of functions or predicates at all, e.g. associative property of addition. In order to ease this problem, we introduce “equivalence constraint” that is a set of formulas representing the properties of functions and predicates, and check the satisfiability of formulas under the constraint. In this report, we show an algorithm for checking satisfiability with equivalence constraint and also experimental results.