Automatic verification of timed circuits

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 818 LNCS, Issue , 1994, Pages 468-480

  Rokicki, Tomas G ^a   Myers, Chris J ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS; TIMING CIRCUITS;

AUTOMATIC VERIFICATION; BEHAVIORAL SEMANTICS; FULLY AUTOMATED; HIERARCHICAL VERIFICATION; SPACE REQUIREMENTS; TIMED TRACE THEORY; TIMING ALGORITHMS; VERIFICATION ALGORITHMS;

COMPUTER AIDED ANALYSIS;

EID: 85027193321     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58179-0_76     Document Type: Conference Paper

References (19)

1. Chris J. Myers and Teresa H.-Y. Meng. Synthesis of timed asynchronous circuits. 1EEE Transactions on VLSI Systems, 1(2):106-119, June 1993.
2. Alain J. Martin. Programming in VLSI: From communicating processes to delay-insensitive VLSI circuits. In C.A.R. Hoare, editor, UT Year of Programming Institute on Concurrent Programming. Addison-Wesley, 1990.
3. Martin Rem, Jan L. A. van de Snepscheut, and Jan Tijmen Udding. Trace theory and the definition of hierarchical components. In R. Bryant, editor, Third Caltech Conference on VLSI, pages 225-239. Computer Science Press, Inc., 1983.
4. David L. Dill. Trace theory for automatic hierarchial verification of speed-independent circuits. ACM Distinguished Dissertations, 1989.
5. Jerry R. Burch. Trace Algebra for Automatic Verification of Real-Time Concurrent Systems. PhD thesis, Carnegie Mellon University, 1992.
6. David L. Dill. Timing assumptions and verification of finite-state concurrent systems. In Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems, June 1989.
7. Harry R. Lewis. Finite-state analysis of asynchronous circuits with bounded temporal uncertainty. Technical report, Harvard University, July 1989.
8. Bernard Berthomieu and Michel Diaz. Modeling and verification of time dependent systems using time petri nets. IEEE Transactions on Software Engineering, 17(3), March 1991.
9. R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi. An implementation of three algorithms for timing verification based on automata emptiness. In Proceedings of the Real-Time Systems Symposium, pages 157-166. IEEE Computer Society Press, 1992.
10. Thomas Henzinger, Xavier Nicollin, Joseph Sifakis, and Sergio Yovine. Symbolic modelchecking for real-time systems. In Proceedings of the 7th Symposium Logics in Computers Science. IEEE Computer Society Press, 1992.
11. Nicolas Halbwachs. Delay analysis in synchronous programs. In Costas Courcoubetis, editor, Computer Aided Verification, pages 333-346. Springer-Vedag, 1993.
12. Tomohiro Yoneda, Atsufumi Shibayama, Bemd-Hologer Schlingloff, and Edmund M. Clarke. Efficient verification of parallel real-time systems. In Costas Courcoubetis, editor, Computer Aided Verification, pages 321-332. Springer-Vedag, 1993.
13. James L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice Hall, 1981.
14. Peter A. Beerel and Teresa H.-Y. Meng. Semi-modularity and testability of speedindependent circuits. INTEGRATION, the VLSljournal, 13(3):301-322, September 1992.
15. Tomas G. Rokicki. Representing and Modeling Circuits. PhD thesis, Stanford University, 1993.
16. Thomas A. Henzinger, Zohar Manna, and Amir Pnueli. What good are digital clocks? In 1CALP 92: Automata, Languages, and Programming, pages 545-547. Springer-Vedag, 1992.
17. Rajeev Alur. Techniques for Automatic Verification of Real-Time Systems. PhD thesis, Stanford University, August 1991.
18. Chris J. Myers andTeresa H.-Y. Meng. Automatic hazard-freedecomposition ofhigh-fanin gates in asynchronous circuit synthesis. To be published.
19. Ken Yun. Private communication, 1993.