We present a collection of ideas that allows the pipeline verification method pioneered by Burch and Dill [5] to scale very efficiently to dual-issue superscalar processors. We achieve a significant speedup in the verification of such processors, compared to the result by Burch [6], while using an entirely automatic tool. Instrumental to our success are exploiting the properties of positive equality [3][4] and the simplification capabilities of BDDs. </p
We compare SAT-checkers and decision diagrams on the evaluation of Boolean formulas produced in the...
The logic of equality with uninterpreted functions (EUF) provides a means of abstracting the ma-nipu...
We extend the Burch and Dill flushing technique [6] for formal verification of microprocessors to be...
We present a collection of ideas that allows the pipeline verification method pioneered by Burch and...
We study the applicability of the logic of Positive Equality with Uninterpreted Functions (PEUF) [2]...
We study the applicability of the logic of Positive Equality with Uninterpreted Functions (PEUF) [2...
We extend the Burch and Dill flushing technique [6] for formal verification of microprocessors to be...
We extend the Burch and Dill flushing technique [6] for formal verification of microprocessors to be...
The logic of Equality with Uninterpreted Functions (EUF) provides a means of abstracting the manipul...
We describe an efficient validity checker for the quantifier-free logic of equality with uninterpret...
In using the logic of equality with unininterpreted functions to verify hardware systems, specific ...
. The logic of equality with uninterpreted functions has been proposed for verifying abstract hardwa...
Modern processors have relatively simple specificationsbased on their instruction set architectures....
AbstractWe compare SAT-checkers and decision diagrams on the evaluation of Boolean formulae produced...
The logic of equality with uninterpreted functions (EUF) provides a means of abstracting the manipul...
We compare SAT-checkers and decision diagrams on the evaluation of Boolean formulas produced in the...
The logic of equality with uninterpreted functions (EUF) provides a means of abstracting the ma-nipu...
We extend the Burch and Dill flushing technique [6] for formal verification of microprocessors to be...
We present a collection of ideas that allows the pipeline verification method pioneered by Burch and...
We study the applicability of the logic of Positive Equality with Uninterpreted Functions (PEUF) [2]...
We study the applicability of the logic of Positive Equality with Uninterpreted Functions (PEUF) [2...
We extend the Burch and Dill flushing technique [6] for formal verification of microprocessors to be...
We extend the Burch and Dill flushing technique [6] for formal verification of microprocessors to be...
The logic of Equality with Uninterpreted Functions (EUF) provides a means of abstracting the manipul...
We describe an efficient validity checker for the quantifier-free logic of equality with uninterpret...
In using the logic of equality with unininterpreted functions to verify hardware systems, specific ...
. The logic of equality with uninterpreted functions has been proposed for verifying abstract hardwa...
Modern processors have relatively simple specificationsbased on their instruction set architectures....
AbstractWe compare SAT-checkers and decision diagrams on the evaluation of Boolean formulae produced...
The logic of equality with uninterpreted functions (EUF) provides a means of abstracting the manipul...
We compare SAT-checkers and decision diagrams on the evaluation of Boolean formulas produced in the...
The logic of equality with uninterpreted functions (EUF) provides a means of abstracting the ma-nipu...
We extend the Burch and Dill flushing technique [6] for formal verification of microprocessors to be...