We present a way to abstract functional units in symbolic simulation of actual circuits, thus achieving the effect of uninterpreted functions at the bit-level. Additionally, we propose an efficient encoding technique that can be used to represent uninterpreted symbols with BDDs, while allowing these symbols to be propagated by simulation with a conventional bit-level symbolic simulator. Our abstraction and encoding techniques result in an automatic symmetry reduction and allow the control and forwarding logic of the actual circuit to be used unmodified. The abstraction method builds on the behavioral Efficient Memory Model [18][19] and its capability to dynamically introduce consistent initial state, which is identical for two simulation s...
Modern processors have relatively simple specificationsbased on their instruction set architectures....
The use of formal methods to verify the correctness of digital circuits is less constrained by the g...
The logic of Equality with Uninterpreted Functions (EUF) provides a means of abstracting the manipul...
We present a way to abstract functional units in symbolic simulation of actual circuits, thus achiev...
Abstract. We present a way to abstract functional units in symbolic simulation of actual circuits, t...
This paper makes the idea of memory shadowing [5] applicable to symbolic ternary simulation. Memory ...
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...
Abstract. This paper extends Burch and Dill’s pipeline verification method [4] to the bit level. We ...
This dissertation documents two contributions to automating the formal verification of hardware – pa...
A logic simulator can prove the correctness of a digital circuit if it can be shown that only circui...
A new approach to sequential verification of designs at different levels of abstraction by symbolic ...
A logic simulator can prove the correctness of a digital circuit when it can be shown that only circ...
The program MOSSYM simulates the behavior of a MOS circuit represented as a switch-level network sym...
A new approach to sequential verification of designs at different levels of abstraction by symbolic ...
Modern processors have relatively simple specificationsbased on their instruction set architectures....
The use of formal methods to verify the correctness of digital circuits is less constrained by the g...
The logic of Equality with Uninterpreted Functions (EUF) provides a means of abstracting the manipul...
We present a way to abstract functional units in symbolic simulation of actual circuits, thus achiev...
Abstract. We present a way to abstract functional units in symbolic simulation of actual circuits, t...
This paper makes the idea of memory shadowing [5] applicable to symbolic ternary simulation. Memory ...
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...
Abstract. This paper extends Burch and Dill’s pipeline verification method [4] to the bit level. We ...
This dissertation documents two contributions to automating the formal verification of hardware – pa...
A logic simulator can prove the correctness of a digital circuit if it can be shown that only circui...
A new approach to sequential verification of designs at different levels of abstraction by symbolic ...
A logic simulator can prove the correctness of a digital circuit when it can be shown that only circ...
The program MOSSYM simulates the behavior of a MOS circuit represented as a switch-level network sym...
A new approach to sequential verification of designs at different levels of abstraction by symbolic ...
Modern processors have relatively simple specificationsbased on their instruction set architectures....
The use of formal methods to verify the correctness of digital circuits is less constrained by the g...
The logic of Equality with Uninterpreted Functions (EUF) provides a means of abstracting the manipul...