Automatic verification of asynchronous circuits

E. Clarke, B. Mishra

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationLogics of Programs - Workshop
EditorsEdmund Clarke, Dexter Kozen
PublisherSpringer Verlag
Pages101-115
Number of pages15
ISBN (Print)9783540128960
DOIs
StatePublished - 1984
EventWorkshop on Logics of Programs, 1983 - Pittsburgh, United States
Duration: Jun 6 1983Jun 8 1983

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume164 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherWorkshop on Logics of Programs, 1983
CountryUnited States
CityPittsburgh
Period6/6/836/8/83

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Automatic verification of asynchronous circuits'. Together they form a unique fingerprint.

Cite this