Abstract
Establishing the correctness of complicated asynchronous circuit is in general quite difficult because of the high degree of nondeterminism that is inherent in such devices. Nevertheless, it is also very important in view of the cost involved in design and testing of circuits. We show how to give specifications for circuits in a branching time temporal logic and how to mechanically verify them using a simple and efficient model checker. We also show how to tackle a large and complex circuit by verifying it hierarchically.
Original language | English (US) |
---|---|
Pages (from-to) | 269-291 |
Number of pages | 23 |
Journal | Theoretical Computer Science |
Volume | 38 |
Issue number | C |
DOIs | |
State | Published - 1985 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science