Partial-order reduction in symbolic state space exploration

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

Volumn 1254, Issue , 1997, Pages 340-351

  Alur, R ^a   Brayton, R K ^a   Henzinger, T A ^a   Qadeer, S ^a   Rajamani, S K ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER AIDED ANALYSIS; FORMAL VERIFICATION; MODEL CHECKING; NETWORK PROTOCOLS; SPACE RESEARCH;

ASYNCHRONOUS NETWORKS; BINARY DECISION DIAGRAMS (BDDS); BREADTH-FIRST SEARCH; PARTIAL ORDER REDUCTIONS; PARTIAL-ORDER METHODS; STATE-SPACE EXPLOSION; SYMBOLIC STATE SPACE; TRANSITION RELATIONS;

BINARY DECISION DIAGRAMS;

EID: 84947438108     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63166-6_34     Document Type: Conference Paper

References (14)

1. J.R. Butch, E.M. Clarke, and D.E. Long. Symbolic Model Checking with Partitioned Transition Relations. In Proc. of the 28th Design Automation Conference, pages 403-407, 1991.
2. J.R. Butch, E.M. Clarke, K.L. McMillan, and D.L. Dill. Symbolic Model Checking: 102o States and Beyond. Information and Computation, 98:142-170, 1992.
3. R.K. Bmyton, G.D. Hachtel, A. Sangiovanni-Vincentelli, E. Somenzi, A. Aziz, S.-T. Cheng, S. Edwards, S. Khatri, Y. Kukimoto, A. Pardo, S. Qadeer, R.K. Ranjan, S. Sarwary, T.R. Shiple, G. Swamy, and T. Villa. VIS:. A System for Verification and Synthesis. In Proc. of the 8th International Conference on Computer-Aided Verification, vol. 1102 of Lecture Notes in Computer Science, pages 428-432. Springer, 1996.
4. C.-T. Chou and D.A. Peled. Formal Verification of a Partial-Order Reduction Technique for Model Checking. In Proc. of the Second International Workshop on Tools and Algorithms for the Construction and Analysis of Systems, vol. 1055 of Lecture Notes in Computer Science, pages 241-257. Springer, 1996.
5. D.L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits. MIT Press, 1989.
6. D. Dolev, M. Klawe, and M. Rodeh. An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle. Journal of Algorithms, 3:245-260, 1982.
7. E Godefroid. Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem, vol. 1032 of Lecture Notes in Computer Science. Springer, 1996.
8. P. Godefroid and E Wolper. A Partial Approach to Model Checking. Information and Computation, 110:305-326, 1994.
9. G.J. Holzmann and D.A. Peled. An Improvement in Formal Verification. In Proc. of the 7th International Conference on FormalDescription Techniques, pages 197-211. Chapman & Hall, 1994.
10. A. Mazurkiewicz. Basic Notions of Trace Theory. In Workshop on Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency, vol. 354 of Lecture Notes in Computer Science, pages 285-363. Springer, 1988.
11. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
12. D.A. Peled. All from One, One for All: On Model Checking Using Representatives. In Proc. of the 5th International Conference on Computer-Aided Verification, vol. 697 of Lecture Notes in Computer Science, pages 409-423. Springer, 1993.
13. R.K. Ranjan, A. Aziz, B. Plessier, C. Pixley, and R.K. Brayton. Efficient Formal Design Verification: Data Structures + Algorithms. In Workshop Notes of the International Workshop on Logic Synthesis, 1995.
14. A. Valmari. Stubborn Sets for Reduced State Space Generation. In Advances in Petri Nets, vol. 483 of Lecture. Notes in Computer Science, pages 491-515. Springer, 1991.