Compressing Transitions for Model Checking
暂无分享,去创建一个
[1] Robert P. Kurshan,et al. Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach , 2014 .
[2] Doron A. Peled,et al. Relaxed Visibility Enhances Partial Order Reduction , 2001, Formal Methods Syst. Des..
[3] Doron A. Peled,et al. Combining Software and Hardware Verification Techniques , 2002, Formal Methods Syst. Des..
[4] Doron A. Peled,et al. Static Partial Order Reduction , 1998, TACAS.
[5] Doron A. Peled,et al. All from One, One for All: on Model Checking Using Representatives , 1993, CAV.
[6] Amir Pnueli,et al. The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[7] Patrice Godefroid,et al. Partial-Order Methods for the Verification of Concurrent Systems , 1996, Lecture Notes in Computer Science.
[8] Edsger W. Dijkstra,et al. Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.
[9] Marius Bozga,et al. State space reduction based on live variables analysis , 1999, Sci. Comput. Program..
[10] Antti Valmari. A stubborn attack on state explosion , 1992, Formal Methods Syst. Des..
[11] Hüsnü Yenigün,et al. SDLcheck: A Model Checking Tool , 2001, CAV.
[12] Leslie Lamport,et al. What Good is Temporal Logic? , 1983, IFIP Congress.
[13] Gerard J. Holzmann,et al. The Engineering of a Model Checker: The Gnu i-Protocol Case Study Revisited , 1999, SPIN.