Reduced Functional Consistency of Uninterpreted Functions

Authors:
Amir Pnueli;Ofer Strichman
Affiliations:
New-York University, NY, USA and the Weizmann Institute, Rehovot, Israel;Technion, Haifa, Israel
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 7
Cited 0

Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic

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

Information and Computation
Translation Validation

TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Deciding Equality Formulas by Small Domains Instantiations

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
ICS: Integrated Canonizer and Solver

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

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions

CADE-18 Proceedings of the 18th International Conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

A reduction of Equality Logic with Uninterpreted Functions (EUF) to Equality Logic with Ackermann's method suffers from a quadratic growth in the number of functional consistency constraints (constraints of the form x=y-F(x)=F(y)). We propose a framework in which syntactic characteristics of function instances (their signature) is used for guessing which constraints will possibly be needed for the proof. This framework can be either combined in an abstraction-refinement loop, or, in some cases, be used without refinement iterations. The framework is suitable for equivalence verification problems, which is one of the typical uses of Uninterpreted Functions. It enabled us to verify dozens of verification conditions resulting from Translation Validation that we could not prove otherwise.