A cut-off approach for bounded verification of parameterized systems
暂无分享,去创建一个
[1] Pierre Ganty,et al. From Many Places to Few: Automatic Abstraction Refinement for Petri Nets , 2008, Fundam. Informaticae.
[2] Alain Finkel,et al. On the verification of broadcast protocols , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).
[3] Edmund M. Clarke,et al. Reasoning about networks with many identical finite-state processes , 1986, PODC '86.
[4] Kedar S. Namjoshi,et al. On model checking for non-deterministic infinite-state systems , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).
[5] A. Prasad Sistla,et al. Reasoning about systems with many processes , 1992, JACM.
[6] Giorgio Delzanno,et al. Towards the Automated Verification of Multithreaded Java Programs , 2002, TACAS.
[7] James C. Corbett,et al. Constructing compact models of concurrent Java programs , 1998, ISSTA '98.
[8] Robert P. Kurshan,et al. A structural induction theorem for processes , 1989, PODC.
[9] Edmund M. Clarke,et al. Avoiding the state explosion problem in temporal logic model checking , 1987, PODC '87.
[10] Philippe Schnoebelen,et al. Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..
[11] Richard M. Karp,et al. Parallel Program Schemata , 1969, J. Comput. Syst. Sci..
[12] Giorgio Delzanno,et al. Constraint-Based Model Checking for Parameterized Synchronous Systems , 2002, FroCoS.
[13] Helmut Veith,et al. Verification by Network Decomposition , 2004, CONCUR.
[14] Pierre Wolper,et al. Verifying Properties of Large Sets of Processes with Network Invariants , 1990, Automatic Verification Methods for Finite State Systems.
[15] Parosh Aziz Abdulla,et al. General decidability theorems for infinite-state systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
[16] Giorgio Delzanno,et al. Symbolic Representation of Upward-Closed Sets , 2000, TACAS.
[17] Charles Rackoff,et al. The Covering and Boundedness Problems for Vector Addition Systems , 1978, Theor. Comput. Sci..
[18] Kedar S. Namjoshi,et al. Automatic Verification of Parameterized Synchronous Systems (Extended Abstract) , 1996, CAV.
[19] Ahmed Bouajjani,et al. Verification of parametric concurrent systems with prioritised FIFO resource management , 2008, Formal Methods Syst. Des..
[20] Hassen Saïdi,et al. Construction of Abstract State Graphs with PVS , 1997, CAV.
[21] Krzysztof R. Apt,et al. Limits for Automatic Verification of Finite-State Concurrent Systems , 1986, Inf. Process. Lett..
[22] Vineet Kahlon,et al. Reducing Model Checking of the Many to the Few , 2000, CADE.
[23] Edmund M. Clarke,et al. Reasoning about Networks with Many Identical Finite State Processes , 1989, Inf. Comput..