Abstract. A central task in formal verification is the definition of invariants, which characterize the reachable states of the system. When a system is finite-state, invariants can be discovered automatically. Our experience in verifying microprocessors using symbolic logic is that finding adequate invariants is extremely time-consuming. We present three techniques for automating the discovery of some of these invariants. All of them are essentially syntactic transformations on a logical formula derived from the state transition function. The goal is to eliminate quantifiers and extract small clauses implied by the larger formula. We have implemented the method and exercised it on a description of the FLASH Protocol Processor (PP), a micro...
Designing modern processors is a great challenge as they involve millions of components. Traditional...
We describe an efficient validity checker for the quantifier-free logic of equality with uninterpret...
We describe IODINE, a tool to automatically extract likely design properties using dynamic analysis....
Abstract. Most of the properties established during program verification are either invariants or de...
Abstract—Program invariants are statements or assertions that are widely used in program analysis an...
Automatic verification tools, such as model checkers and tools based on static analysis or on abstra...
We present a way to abstract functional units in symbolic simulation of actual circuits, thus achiev...
We study the applicability of the logic of Positive Equality with Uninterpreted Functions (PEUF) [2...
AbstractFormal verification techniques are recognized as promising tools for the development of embe...
We study the applicability of the logic of Positive Equality with Uninterpreted Functions (PEUF) [2]...
We present a way to abstract functional units in symbolic simulation of actual circuits, thus achie...
Program verification increases the degree of confidence that a program will perform correctly. Manua...
Predicate abstraction provides a powerful tool for verifying properties of infinite-state systems us...
Modern processors have relatively simple specificationsbased on their instruction set architectures....
Microelectronics systems become more and more complex, making the detection of errors extremely diff...
Designing modern processors is a great challenge as they involve millions of components. Traditional...
We describe an efficient validity checker for the quantifier-free logic of equality with uninterpret...
We describe IODINE, a tool to automatically extract likely design properties using dynamic analysis....
Abstract. Most of the properties established during program verification are either invariants or de...
Abstract—Program invariants are statements or assertions that are widely used in program analysis an...
Automatic verification tools, such as model checkers and tools based on static analysis or on abstra...
We present a way to abstract functional units in symbolic simulation of actual circuits, thus achiev...
We study the applicability of the logic of Positive Equality with Uninterpreted Functions (PEUF) [2...
AbstractFormal verification techniques are recognized as promising tools for the development of embe...
We study the applicability of the logic of Positive Equality with Uninterpreted Functions (PEUF) [2]...
We present a way to abstract functional units in symbolic simulation of actual circuits, thus achie...
Program verification increases the degree of confidence that a program will perform correctly. Manua...
Predicate abstraction provides a powerful tool for verifying properties of infinite-state systems us...
Modern processors have relatively simple specificationsbased on their instruction set architectures....
Microelectronics systems become more and more complex, making the detection of errors extremely diff...
Designing modern processors is a great challenge as they involve millions of components. Traditional...
We describe an efficient validity checker for the quantifier-free logic of equality with uninterpret...
We describe IODINE, a tool to automatically extract likely design properties using dynamic analysis....