Partial-Order Reduction in Symbolic State Space Exploration
暂无分享,去创建一个
Robert K. Brayton | Thomas A. Henzinger | Rajeev Alur | Sriram K. Rajamani | Shaz Qadeer | R. Brayton | S. Qadeer | T. Henzinger | S. Rajamani | R. Alur
[1] Pierre Wolper,et al. A Partial Approach to Model Checking , 1994, Inf. Comput..
[2] Patrice Godefroid,et al. Partial-Order Methods for the Verification of Concurrent Systems , 1996, Lecture Notes in Computer Science.
[3] Doron A. Peled,et al. Formal Verification of a Partial-Order Reduction Technique for Model Checking , 1996, TACAS.
[4] Raymond R. Devillers,et al. Partial-order Methods for the Veriication of Concurrent Systems an Approach to the State-explosion Problem Th Ese Pr Esent Ee Par , 1995 .
[5] Tiziano Villa,et al. Exact Minimization of Binary Decision Diagrams Using Implicit Techniques , 1998, IEEE Trans. Computers.
[6] Antoni W. Mazurkiewicz,et al. Basic notions of trace theory , 1988, REX Workshop.
[7] Edmund M. Clarke,et al. Symbolic Model Checking with Partitioned Transistion Relations , 1991, VLSI.
[8] Doron A. Peled,et al. All from One, One for All: on Model Checking Using Representatives , 1993, CAV.
[9] Tiziano Villa,et al. VIS: A System for Verification and Synthesis , 1996, CAV.
[10] Tiziano Villa,et al. Multi-valued decision diagrams: theory and applications , 1998 .
[11] Kenneth L. McMillan,et al. Symbolic model checking: an approach to the state explosion problem , 1992 .
[12] Gerard J. Holzmann,et al. An improvement in formal verification , 1994, FORTE.
[13] David L. Dill,et al. Trace theory for automatic hierarchical verification of speed-independent circuits , 1989, ACM distinguished dissertations.
[14] Sérgio Vale Aguiar Campos,et al. Symbolic Model Checking , 1993, CAV.
[15] Frank Thomson Leighton,et al. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits , 1988 .
[16] Antti Valmari,et al. A stubborn attack on state explosion , 1990, Formal Methods Syst. Des..
[17] Edmund M. Clarke,et al. Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..
[18] Antti Valmari. A stubborn attack on state explosion , 1992, Formal Methods Syst. Des..
[19] Grzegorz Rozenberg,et al. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.
[20] R. Brayton,et al. Efficient Formal Design Verification : Data Structure + Algorithms , 1994 .
[21] Robert K. Brayton,et al. Heuristic Minimization of BDDs Using Don't Cares , 1994, 31st Design Automation Conference.
[22] Danny Dolev,et al. An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle , 1982, J. Algorithms.
[23] Antti Valmari,et al. Stubborn sets for reduced state space generation , 1991, Applications and Theory of Petri Nets.