Expand, enlarge, and check for branching vector addition systems

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

Volumn 8052 LNCS, Issue , 2013, Pages 152-166

  Majumdar, Rupak ^a   Wang, Zilong ^a  

^a MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTICALLY OPTIMAL; CONCURRENT PROGRAM; COVERABILITY PROBLEM; NUMBER OF ITERATIONS; SAFETY PROPERTY; UNDER-APPROXIMATION; VECTOR ADDITION SYSTEMS; WELL-STRUCTURED TRANSITION SYSTEMS;

ALGORITHMS; OPTIMIZATION; PETRI NETS;

VECTORS;

EID: 84882770980     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-40184-8_12     Document Type: Conference Paper

References (17)

1. Bouajjani, A., Emmi, M.: Analysis of recursively parallel programs. In: POPL, pp. 203-214 (2012)
2. Bozzelli, L., Ganty, P.: Complexity analysis of the backward coverability algorithm for VASS. In: Delzanno, G., Potapov, I. (eds.) RP 2011. LNCS, vol. 6945, pp. 96-109. Springer, Heidelberg (2011)
3. Charles, P., Grothoff, C., Saraswat, V., Donawa, C., Kielstra, A., Ebcioglu, K., von Praun, C., Sarkar, V.: X10: an object-oriented approach to non-uniform cluster computing. SIGPLAN Not. 40(10), 519-538 (2005)
4. Cunningham, R.: Eel: Tools for debugging, visualization, and verification of event-driven software. Master's thesis, UCLA (2005)
5. Demri, S., Jurdzinski, M., Lachish, O., Lazic, R.: The covering and boundedness problems for branching vector addition systems. J. Comput. Syst. Sci. 79(1), 23-38 (2013)
6. Ganty, P., Majumdar, R.: Algorithmic verification of asynchronous programs. In: ACM Transactions on Programming Languages and Systems (2012)
7. Geeraerts, G., Raskin, J.-F., Begin, L. V.: Expand, enlarge and check: New algorithms for the coverability problem of wsts. J. Comput. Syst. Sci. 72(1), 180-203 (2006)
8. Halstead, R.H.: Multilisp: a language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems 7, 501-538 (1985)
9. Jhala, R., Majumdar, R.: Interprocedural analysis of asynchronous programs. In: POPL 2007, pp. 339-350. ACM Press (2007)
10. 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)
11. Karp, R., Miller, R.: Parallel program schemata. Journal of Comput. Syst. Sci. 3(2), 147-195 (1969)
12. Kitchin, D., Quark, A., Cook, W., Misra, J.: The Orc programming language. In: Lee, D., Lopes, A., Poetzsch-Heffter, A. (eds.) FMOODS 2009. LNCS, vol. 5522, pp. 1-25. Springer, Heidelberg (2009)
13. Kloos, J., Majumdar, R., Niksic, F., Piskac, R.: Incremental, inductive coverability. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 158-173. Springer, Heidelberg (2013)
14. Leijen, D., Schulte, W., Burckhardt, S.: The design of a task parallel library. In: OOPSLA 2009, pp. 227-242. ACM (2009)
15. Rackoff, C.: The covering and boundedness problems for vector addition systems. Theoretical Computer Science 6(2), 223-231 (1978)
16. Verma, K., Goubault-Larrecq, J.: Karp-Miller trees for a branching extension of VASS. Discrete Mathematics & Theoretical Computer Science 7(1), 217-230 (2005)
17. Verma, K.N., Goubault-Larrecq, J.: Alternating two-way AC-tree automata. Inf. Comput. 205(6), 817-869 (2007)