Incremental, inductive coverability

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

Volumn 8044 LNCS, Issue , 2013, Pages 158-173

  Kloos, Johannes ^a   Majumdar, Rupak ^a   Niksic, Filip ^a   Piskac, Ruzica ^a  

^a MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BACKWARD ANALYSIS; BROADCAST PROTOCOLS; FINITE NUMBER; HARDWARE VERIFICATION; INFINITE-STATE; LOSSY CHANNEL SYSTEMS; SAFETY VERIFICATION; WELL-STRUCTURED TRANSITION SYSTEMS;

ALGORITHMS; COMPUTER AIDED ANALYSIS; PETRI NETS;

FINITE AUTOMATA;

EID: 84881138748     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-39799-8_10     Document Type: Conference Paper

References (18)

1. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS 1996, pp. 313-321. IEEE (1996)
2. Abdulla, P.A., Bouajjani, A., Jonsson, B.: On-the-fly analysis of systems with unbounded, lossy FIFO channels. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol. 1427, pp. 305-318. Springer, Heidelberg (1998) (Pubitemid 128092348)
3. Bradley, A.R.: SAT-based model checking without unrolling. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 70-87. Springer, Heidelberg (2011)
4. Ciardo, G.: Petri nets with marking-dependent arc multiplicity: properties and analysis. In: Valette, R. (ed.) ICATPN 1994. LNCS, vol. 815, pp. 179-198. Springer, Heidelberg (1994)
5. Cimatti, A., Griggio, A.: Software model checking via IC3. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 277-293. Springer, Heidelberg (2012)
6. Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. American Journal of Mathematics 35(4), 413-422 (1913)
7. Dufourd, C., Finkel, A., Schnoebelen, P.: Reset nets between decidability and undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 103-115. Springer, Heidelberg (1998)
8. Een, N., Mishchenko, A., Brayton, R.: Efficient implementation of property directed reachability. In: FMCAD 2011, pp. 125-134. FMCAD Inc. (2011)
9. Emerson, E.A., Namjoshi, K.S.: On model checking for non-deterministic infinitestate systems. In: LICS 1998, pp. 70-80. IEEE (1998)
10. Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: LICS 1999, pp. 352-359. IEEE Computer Society (1999)
11. Esparza, J., Nielsen, M.: Decidability issues for Petri nets - a survey. Bulletin of the EATCS 52, 244-262 (1994)
12. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1-2), 63-92 (2001)
13. Geeraerts, G., Raskin, J.-F., Van Begin, L.: Expand, enlarge and check: New algorithms for the coverability problem of WSTS. J. Comput. Syst. Sci. 72(1), 180-203 (2006)
14. Higman, G.: Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society S3-2(1), 326-336 (1952)
15. Hoder, K., Bjørner, N.: Generalized property directed reachability. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 157-171. Springer, Heidelberg (2012)
16. Kaiser, A., Kroening, D., Wahl, T.: Efficient coverability analysis by proof minimization. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 500-515. Springer, Heidelberg (2012)
17. Kloos, J., Majumdar, R., Niksic, F., Piskac, R.: Incremental, inductive coverability. Technical Report 1301.7321, CoRR (2013)
18. Majumdar, R., Meyer, R., Wang, Z.: Static provenance verification for message-passing programs. In: SAS 2013 (2013)