Advertisement

Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits

  • K. L. McMillan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 663)

Keywords

Cutoff Point Mutual Exclusion Symbolic Model Check Linear Time Temporal Logic Local Configuration 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [BCL]
    J. R. Burch, E. M. Clarke, and D. E. Long. Symbolic model checking with partitioned transition relations. To appear in the Proceedings of VLSI'91.Google Scholar
  2. [BCM+90]
    J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and J. Hwang. Symbolic model checking: 1020 states and beyond. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, June 1990.Google Scholar
  3. [Dil88]
    D. Dill. Trace theory for automatic hierarchical verification of speed-independent circuits. Technical Report 88-119, Carnegie Mellon University, Computer Science Dept, 1988.Google Scholar
  4. [God90]
    P. Godefroid. Using partial orders to improve automatic verification methods. In Workshop on Computer Aided Verification, 1990.Google Scholar
  5. [GW91]
    P. Godefroid and P. Wolper. A partial approach to model checking. In LICS, 1991.Google Scholar
  6. [Mar85]
    A. J. Martin. The design of a self-timed circuit for distributed mutual exclusion. In Henry Fuchs, editor, 1985 Chapel Hill Conference on VLSI, pages 245–260. Computer Science Press, 1985.Google Scholar
  7. [PL89]
    D. K. Probst and H. F. Li. Abstract specification, composition, and proof of correctness of delay-insensitive circuits and systems. Technical report, Concordia University, Dept. of Computer Science, 1989.Google Scholar
  8. [PL90]
    D. K. Probst and H. F. Li. Using partial order semantics to avoid the state explosion problem in asynchronous systems. In Workshop on Computer Aided Verification, 1990.Google Scholar
  9. [PL91]
    D. K. Probst and H. F. Li. Partial-order model checking: A guide for the perplexed. In Third Workshop on Computer-aided Verification, pages 405–416, July 1991.Google Scholar
  10. [Sei80]
    C. L. Seitz. System timing. In Carver Mead and Lynn Conway, editors, Introduction to VLSI Systems, pages 218–262. Addison-Wesley, 1980.Google Scholar
  11. [Val89]
    A. Valmari. Stubborn sets for reduced state space generation. In 10th Int. Conf. on Application and Theory of Petri Nets, 1989.Google Scholar
  12. [Val90]
    A. Valmari. A stubborn attack on the state explosion problem. In Workshop on Computer Aided Verification, 1990.Google Scholar
  13. [YTK91]
    Tomohiro Yoneda, Yoshihiro Tohma, and Yutaka Kondo. Acceleration of timing verification method based on time Petri nets. Systems and Computers in Japan, 22(12):37–52, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • K. L. McMillan
    • 1
  1. 1.School of Computer ScienceCarnegie Mellon UniversityUSA

Personalised recommendations