Abstract: A verification task of proving the equivalence of two descriptions of the same device is examined for the case, when one of the descriptions is partially defined. In this case, the verification task is reduced to checking out whether logical descriptions are equivalent on the domain of the incompletely defined one. Simulation-based approach to solving this task for different vector forms of description representations is proposed. Fast Boolean computations over Boolean and ternary vectors having big sizes underlie the offered methods
A new approach to sequential verification of designs at different levels of abstraction by symbolic ...
Verifying the equivalence of sequential circuits is computationally expensive. Therefore it is inter...
. The logic of equality with uninterpreted functions has been proposed for verifying abstract hardwa...
A verification task of proving the equivalence of two descriptions of the same device is examined fo...
The problem under consideration is to check whether a given system of incompletely specified Boolea...
The problem under discussion is to check whether a given system of incompletely specified Boolean fu...
Functional verification is an important phase in the design flow of digital circuits as it is used t...
In this paper, we study the application of propositional deci-sion procedures in hardware verificati...
Today's digital systems are at the forefront of modern technology. Electronic chips with a billion t...
The increase in size and functional complexity of digital designs necessitates the development of ro...
AbstractThis dissertation examines the use of a new data structure called Boolean Expression Diagram...
This report formalizes a notion of witnesses as the basis of certifying the correctness of software....
The paper explores several ways to improve the speed and capacity of combinational equivalence check...
This Thesis is a study of automatic reasoning about finite state machines (FSMs). Two techniques use...
Abstract. Simulation and formal verification are two complementary techniques for checking the corre...
A new approach to sequential verification of designs at different levels of abstraction by symbolic ...
Verifying the equivalence of sequential circuits is computationally expensive. Therefore it is inter...
. The logic of equality with uninterpreted functions has been proposed for verifying abstract hardwa...
A verification task of proving the equivalence of two descriptions of the same device is examined fo...
The problem under consideration is to check whether a given system of incompletely specified Boolea...
The problem under discussion is to check whether a given system of incompletely specified Boolean fu...
Functional verification is an important phase in the design flow of digital circuits as it is used t...
In this paper, we study the application of propositional deci-sion procedures in hardware verificati...
Today's digital systems are at the forefront of modern technology. Electronic chips with a billion t...
The increase in size and functional complexity of digital designs necessitates the development of ro...
AbstractThis dissertation examines the use of a new data structure called Boolean Expression Diagram...
This report formalizes a notion of witnesses as the basis of certifying the correctness of software....
The paper explores several ways to improve the speed and capacity of combinational equivalence check...
This Thesis is a study of automatic reasoning about finite state machines (FSMs). Two techniques use...
Abstract. Simulation and formal verification are two complementary techniques for checking the corre...
A new approach to sequential verification of designs at different levels of abstraction by symbolic ...
Verifying the equivalence of sequential circuits is computationally expensive. Therefore it is inter...
. The logic of equality with uninterpreted functions has been proposed for verifying abstract hardwa...