BDD Based Procedures for a Theory of Equality with Uninterpreted Functions

Authors:
Anuj Goel;Khurram Sajid;Hai Zhou;Adnan Aziz;Vigyan Singhal
Affiliations:
Department of ECE, The University of Texas at Austin;Intel;Department of ECE, Northwestern University;Department of ECE, The University of Texas at Austin;Tempus-Fugit
Venue:
Formal Methods in System Design
Year:
2003

Citing 17
Cited 4

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Introduction to algorithms

Introduction to algorithms
Verification of arithmetic circuits with binary moment diagrams

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Efficient validity checking for processor verification

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
GRASP—a new search algorithm for satisfiability

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Dynamic variable ordering for ordered binary decision diagrams

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Equivalence checking using cuts and heaps

DAC '97 Proceedings of the 34th annual Design Automation Conference
Exploiting positive equality and partial non-consistency in the formal verification of pipelined microprocessors

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
A Practical Decision Procedure for Arithmetic with Function Symbols

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Formal Verification of a Pipelined Microprocessor

IEEE Software
Validity Checking for Combinations of Theories with Equality

FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Verification Using Uninterpreted Functions and Finite Instantiations

FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Combining Constraint Solving and Symbolic Model Checking for a Class of a Systems with Non-linear Constraints

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Boolean Satisfiability with Transitivity Constraints

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

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
VIS: A System for Verification and Synthesis

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification

NuMDG: a new tool for multiway decision graphs construction

Journal of Computer Science and Technology - Special issue on natural language processing
Exploiting abstraction for efficient formal verification of DSPs with arrays of reconfigurable functional units

ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Automatic formal verification of multithreaded pipelined microprocessors

Proceedings of the International Conference on Computer-Aided Design
From propositional satisfiability to satisfiability modulo theories

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the study of asynchronous designs most authors use the interleaving model of concurrency when describing the behavior of a network; this is usually done for simplicity. The interleaving model assumes the behavior of an asynchronous circuit can ...