loading...
Automatic Verification of Asynchronous Circuits
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/54.350687Spring 1995 (vol. 12 no. 1) pp. 24-31
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The verification of asynchronous designs is difficult, since design errors may only be manifested under rare circumstances. We show how asynchronous designs can be modeled as programs in the general-purpose hardware description language Synchronized Transitions, translated into the verification language, and how this representation facilitates rigorous and efficient verification of the designs.
Citation:
Trevor W.S. Lee, Mark R. Greenstreet, Carl-Johan Seger, "Automatic Verification of Asynchronous Circuits," IEEE Design and Test of Computers, vol. 12, no. 1, pp. 24-31, Mar. 1995, doi:10.1109/54.350687
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions