Structural counter abstraction

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

Volumn 7795 LNCS, Issue , 2013, Pages 62-77

  Bansal, Kshitij ^a   Koskinen, Eric ^a   Wies, Thomas ^a   Zufferey, Damien ^b  

^a NEW YORK UNIVERSITY   (United States)

^b INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION TOPOLOGIES; COMPLEX CONCURRENT SYSTEMS; COUNTER ABSTRACTION; DISTRIBUTED PROCESS; FAIR TERMINATION; FINITE SET; INFINITE STATE SYSTEMS; LIVENESS PROPERTIES; NONBLOCKING ALGORITHMS; PROTOTYPE TOOLS; TERMINATION ANALYSIS; WELL-STRUCTURED TRANSITION SYSTEMS;

ALGORITHMS; NUMERICAL METHODS; TOPOLOGY;

ABSTRACTING;

EID: 84874447997     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-36742-7_5     Document Type: Conference Paper

References (27)

1. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS, pp. 313-321 (1996)
2. Bansal, K., Koskinen, E., Wies, T., Zufferey, D.: Structural counter abstraction. Technical Report TR2012-947, New York University (2012)
3. Basler, G., Mazzucchi, M., Wahl, T., Kroening, D.: Symbolic Counter Abstraction for Concurrent Software. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 64-78. Springer, Heidelberg (2009)
4. Berdine, J., Cook, B., Distefano, D., O'Hearn, P.W.: Automatic Termination Proofs for Programs with Shape-Shifting Heaps. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 386-400. Springer, Heidelberg (2006) (Pubitemid 44560892)
5. Carstensen, H.: Decidability Questions for Fairness in Petri Nets. In: Brandenburg, F.J., Wirsing, M., Vidal-Naquet, G. (eds.) STACS 1987. LNCS, vol. 247, pp. 396-407. Springer, Heidelberg (1987)
6. Cook, B., Podelski, A., Rybalchenko, A.: Termination proofs for systems code. In: PLDI (2006)
7. Delzanno, G., Raskin, J.-F., Van Begin, L.: Towards the Automated Verification of Multi-threaded Java Programs. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 173-187. Springer, Heidelberg (2002)
8. 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)
9. Ehrig, H., Heckel, R., Korff,M., Löwe, M., Ribeiro, L.,Wagner, A., Corradini, A.: Handbook of graph grammars and computing by graph transformation, pp. 247-312. World Scientific Publishing Co., Inc. (1997)
10. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1-2), 63-92 (2001)
11. Gotsman, A., Cook, B., Parkinson, M.J., Vafeiadis, V.: Proving that non-blocking algorithms don't block. In: POPL. ACM (2009)
12. Gulwani, S., Lev-Ami, T., Sagiv, M.: A combination framework for tracking partition sizes. In: POPL, pp. 239-251. ACM (2009)
13. Haller, P., Sommers, F.: Actors in Scala. Artima (January 2012)
14. Herlihy, M., Wing, J.M.: Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463-492 (1990)
15. Joshi, S., König, B.: Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems. In: Gupta, A.,Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 214-226. Springer, Heidelberg (2008)
16. Mayr, R.: Undecidable problems in unreliable computations. Theor. Comput. Sci. 297(1-3), 337-354 (2003)
17. Meyer, R.: On Boundedness in Depth in the ? -Calculus. In: Ausiello, G., Karhumäki, J., Mauri, G., Ong, L. (eds.) Fifth IFIP International Conference on Theoretical Computer Science-TCS 2008. IFIP, vol. 273, pp. 477-489. Springer, Boston (2008)
18. Meyer, R., Gorrieri, R.: On the Relationship between ? -Calculus and Finite Place/Transition Petri Nets. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 463-480. Springer, Heidelberg (2009)
19. Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: PODC (1996)
20. Picasso, http://pub.ist.ac.at/~zufferey/picasso/termination
21. Pnueli, A., Xu, J., Zuck, L.D.: Liveness with (0, 1, ?)-Counter Abstraction. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 107-122. Springer, Heidelberg (2002)
22. Podelski, A., Rybalchenko, A.: ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement. In: Hanus, M. (ed.) PADL 2007. LNCS, vol. 4354, pp. 245-259. Springer, Heidelberg (2007)
23. Podelski, A., Rybalchenko, A.,Wies, T.: Heap Assumptions on Demand. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 314-327. Springer, Heidelberg (2008)
24. Rümmer, P.: A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 274-289. Springer, Heidelberg (2008)
25. Treiber, R.: Systems programming: Coping with parallelism. International Business Machines Incorporated, Thomas J. Watson Research Center (1986)
26. Wies, T., Zufferey, D., Henzinger, T.A.: Forward Analysis of Depth-Bounded Processes. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 94-108. Springer, Heidelberg (2010)
27. 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)