Hierarchical Verification of Asynchronous Circuits Using Temporal Logic

The work

AuthorsBud Mishra; Edmund M. Clarke
Editors
Typearticle
Year1985
Citekeymishra1985hierarchical

Where it appeared

Published inTheoretical Computer Science
PublisherNorth-Holland
Volume38
Pages269--291

Related

Distinct frombozga2002verification
Distinct frombrowne1986automatic
Distinct fromburlyaev2015design
Distinct fromclarke1981design
Distinct fromtollec2024formal

From bibtex.

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.

A copy is held

pdf, 879.6 kB. Not published — it may be under copyright. The facts and links here are.

How it got here

How it got hereagent via bibtex
Added2026-09-17 07:55 UTC
Approved bya person 2026-09-18 14:22 UTC

Cite it as

@article{mishra1985hierarchical,
  title        = {Hierarchical Verification of Asynchronous Circuits Using Temporal Logic},
  author       = {Bud Mishra and Edmund M. Clarke},
  year         = {1985},
  journal      = {Theoretical Computer Science},
  publisher    = {North-Holland},
  volume       = {38},
  pages        = {269--291},
  doi          = {10.1016/0304-3975(85)90223-3},
}

This record lives at https://refs.drheap.org/mishra1985hierarchical/ and will keep doing so.