Efficient coverability analysis by proof minimization

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

Volumn 7454 LNCS, Issue , 2012, Pages 500-515

  Kaiser, Alexander ^a   Kroening, Daniel ^a   Wahl, Thomas ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COVERABILITY; COVERABILITY PROBLEM; COVERABLE; DOWNWARD CLOSURE; FINITE-STATE; MULTI-THREADED PROGRAMS; NUMBER OF THREADS; ORDERS OF MAGNITUDE; SAFETY PROPERTY; SEARCH STRUCTURES; WELL-STRUCTURED TRANSITION SYSTEMS;

SEARCH ENGINES;

ALGORITHMS;

EID: 84866656088     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32940-1_35     Document Type: Conference Paper

References (34)

1. Abdulla, P.A.: Well (and better) quasi-ordered transition systems. Bulletin of Symbolic Logic 16(4) (2010)
2. Abdulla, P.A., Cerans, K., Jonsson, B., Yih-Kuen, T.: General decidability theorems of infinite-state systems. In: Logic in Computer Science, LICS (1996)
3. Abdulla, P.A., Iyer, S.P., Nylén, A.: SAT-solving the coverability problem for Petri nets. Formal Methods in System Design, FMSD (2004)
4. Ball, T., Rajamani, S.: The SLAM project: debugging system software via static analysis. In: Principles of Programming Languages, POPL (2002)
5. Berthomieu, B., Vernadat, F.: The Tina tool, release 2.9.6, LAAS/CNRS (November 2009), http://homepages.laas.fr/bernard/tina/
6. Cardoza, E., Lipton, R.J., Meyer, A.R.: Exponential space complete problems for Petri nets and commutative semigroups: Preliminary report. In: STOC, pp. 50-54 (1976)
7. Clarke, E., Kroning, D., Sharygina, N., Yorav, K.: SATABS: SAT-Based Predicate Abstraction for ANSI-C. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 570-574. Springer, Heidelberg (2005)
8. Delzanno, G., Raskin, J.-F., Van Begin, L.: Attacking Symbolic State Explosion. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 298-310. Springer, Heidelberg (2001)
9. Delzanno, G., Raskin, J.-F., Van Begin, L.: Towards the Automated Verification of Multithreaded Java Programs. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 173-187. Springer, Heidelberg (2002)
10. Donaldson, A., Kaiser, A., Kroening, D., Wahl, T.: Symmetry-Aware Predicate Abstraction for Shared-Variable Concurrent Programs. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 356-371. Springer, Heidelberg (2011)
11. Emerson, A., Namjoshi, K.K.: On model checking for non-deterministic infinite-state systems. In: Logic in Computer Science (LICS), pp. 70-80 (1998)
12. Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: Logic in Computer Science, LICS (1999)
13. Esparza, J., Melzer, S.: Verification of safety properties using integer programming: Beyond the state equation. Formal Methods in System Design, FMSD (2000)
14. Finkel, A., Goubault-Larrecq, J.: Forward Analysis for WSTS, Part II: Complete WSTS. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 188-199. Springer, Heidelberg (2009)
15. Finkel, A., Raskin, J.-F., Samuelides, M., Begin, L.V.: Monotonic extensions of Petri nets: Forward and backward search revisited. ENTCS (2002)
16. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science, TCS (2001)
17. Flanagan, C., Qadeer, S.: Thread-Modular Model Checking. In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol. 2648, pp. 213-224. Springer, Heidelberg (2003)
18. Ganty, P., Meuter, C., Delzanno, G., Kalyon, G., Raskin, J.-F., Van Begin, L.: Symbolic data structure for sets of k-uples. Technical report, Université Libre de Bruxelles (2007)
19. Ganty, P., Raskin, J.-F., Van Begin, L.: A Complete Abstract Interpretation Framework for Coverability Properties of WSTS. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 49-64. Springer, Heidelberg (2005)
20. Ganty, P., Raskin, J.-F., Van Begin, L.: From Many Places to Few: Automatic Abstraction Refinement for Petri Nets. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN2007. LNCS, vol. 4546, pp. 124-143. Springer, Heidelberg (2007)
21. Geeraerts, G., Raskin, J.-F., Begin, L.V.: Expand, enlarge and check: New algorithms for the coverability problem of WSTS. JCSS (2006)
22. Geeraerts, G., Raskin, J.-F., Van Begin, L.: On the Efficient Computation of the Minimal Coverability Set for Petri Nets. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol. 4762, pp. 98-113. Springer, Heidelberg (2007)
23. German, S., Sistla, P.: Reasoning about systems with many processes. Journal of the ACM, JACM (1992)
24. Gupta, A., Popeea, C., Rybalchenko, A.: Threader: A Constraint-Based Verifier for Multithreaded Programs. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 412-417. Springer, Heidelberg (2011)
25. Kaiser, A., Kroening, D., Wahl, T.: Dynamic Cutoff Detection in Parameterized Concurrent Programs. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 645-659. Springer, Heidelberg (2010)
26. Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147-195 (1969)
27. Lu, S., Park, S., Seo, E., Zhou, Y.: Learning from mistakes: a comprehensive study on real world concurrency bug characteristics. In: Architectural Support for Programming Languages and Operating Systems, ASPLOS (2008)
28. Malkis, A., Podelski, A., Rybalchenko, A.: Thread-Modular Verification Is Cartesian Abstract Interpretation. In: Barkaoui, K., Cavalcanti, A., Cerone, A. (eds.) ICTAC 2006. LNCS, vol. 4281, pp. 183-197. Springer, Heidelberg (2006)
29. Meyer, R., Strazny, T.: Petruchio: From Dynamic Networks to Nets. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 175-179. Springer, Heidelberg (2010)
30. Meyer, R., Strazny, T.: An algorithmic framework for coverability in well-structured systems. In: Application of Concurrency to System Design, ACSD (2012)
31. Peierls, T., Goetz, B., Bloch, J., Bowbeer, J., Lea, D., Holmes, D.: Java Concurrency in Practice. Addison-Wesley Professional (2005)
32. Rackoff, C.: The covering and boundedness problems for vector addition systems. Theoretical Computer Science, TCS (1978)
33. Schnoebelen, P.: Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 616-628. Springer, Heidelberg (2010)
34. Zufferey, D., Wies, T., Henzinger, T.A.: Ideal Abstractions for Well-Structured Transition Systems. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol. 7148, pp. 445-460. Springer, Heidelberg (2012)