Symbolic model checking
E. Clarke, K.L. McMillan, Sérgio Campos et al. · Lecture notes in computer science · 1996
Cited by 2,839 works. doi:10.1007/3-540-61474-5_93
Authors
References
- Graph-Based Algorithms for Boolean Function Manipulation
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Symbolic model checking: 1020 States and beyond
- Symbolic Model Checking
- Symbolic Boolean manipulation with ordered binary-decision diagrams
- Model checking and abstraction
- Verification tools for finite-state concurrent systems
- Verification of the Futurebus+ cache coherence protocol
- Exploiting symmetry in temporal logic model checking
- Verification of the Futurebus+ Cache Coherence Protocol**This research was sponsored in part by the Avionics Laboratory, Wright Research and Development Center, Aeronautical Systems Division (AFSC), U.S. Air Force, Wright-Patterson AFB, Ohio 45433-6543 under Contract F33615-90-C-1465, ARPA Order No. 7597 and in part by the National Science Foundation under Grant no. CCR-9005992 and in part by the Semiconductor Research Corporation under Contract 92-DJ-294 and in part by the U.S.-Israeli Binational Science Foundation and in part by a Japan-U.S. cooperative research grant from the Japanese Society for the Promotion of Scientific Research and in part by U.S.-Japan cooperative research grant number INT-90-16694 from the National Science Foundation.The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the U.S. government.