Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Handbook of theoretical computer science (vol. B)
Symbolic model checking: an approach to the state explosion problem
Symbolic model checking: an approach to the state explosion problem
Automated temporal reasoning about reactive systems
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Introduction to a Computational Theory and Implementation of Sequential Hardware Equivalence
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
| Hi-index | 0.00 |
When silicon is available, newly designed microprocessors are tested inspecially equipped hardware laboratories,where real applications can be run at hardware speeds.However, the large volumes of code being run, plus thelimited access to the internal nodes of the chip, make itextraordinarily difficult to characterize the nature of anyfailures that occur.In this paper, we describe how the formal verificationtechnique of temporal logic model checking was used toquickly characterize a design error exhibited during hardware testing of the PowerPC 620 microprocessor. Weclaim that model checking can efficiently characterize suchfailures when certain pre-conditions are met. We also showhow the same error could have been revealed early in thedesign cycle, by model checking a short and simple correctness specification. We discuss the implications of this forverification methodologies over the full design cycle.