Context-bounded analysis of concurrent queue systems

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

Volumn 4963 LNCS, Issue , 2008, Pages 299-314

  La Torre, Salvatore ^a   Madhusudan, P ^b   Parlato, Gennaro ^a,b  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENCY CONTROL; QUEUEING THEORY; RECURSIVE FUNCTIONS;

CONTEXT SWITCHING; EUROPEAN; FINITE STATES; FINITE SYSTEMS; FIRST INPUT FIRST OUTPUT (FIFO) QUEUES; HEIDELBERG (CO); INDIVIDUAL (PSS 544-7); INTERNATIONAL CONFERENCES; REACHABILITY PROBLEMS; RECURSIVE PROGRAMS;

COMPUTABILITY AND DECIDABILITY;

EID: 47249155301     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78800-3_21     Document Type: Conference Paper

References (19)

1. Abdulla, P., Jonsson, B.: Verifying programs with unreliable channels. In: LICS, pp. 160-170. IEEE Computer Society, Los Alamitos (1993)
2. Bouajjani, A., Esparza, J., Schwoon, S., Strejcek, J.: Reachability analysis of multithreaded software with asynchronous communication. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 348-359. Springer, Heidelberg (2005)
3. Bouajjani, A., Fratani, S., Qadeer, S.: Context-bounded analysis of multithreaded programs with dynamic linked structures. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 207-220. Springer, Heidelberg (2007)
4. Cécé, G., Finkel, A.: Programs with quasi-stable channels are effectively recognizable (extended abstract). In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 304-315. Springer, Heidelberg (1997)
5. Chadha, R., Viswanathan, M.: Decidability results for well-structured transition systems with auxiliary storage. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR. LNCS, vol. 4703, Springer, Heidelberg (2007)
6. Cheng, A., Esparza, J., Palsberg, J.: Complexity Results for 1-Safe Nets. Theor. Comput. Sci. 147(1-2), 117-136 (1995)
7. Gay, D., Levis, P., von Behren, J.R., Welsh, M., Brewer, E.A., Culler, D.E.: The Nesc language: A holistic approach to networked embedded systems. In: PLDI, pp. 1-11. ACM Press, New York (2003)
8. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
9. Ibarra, O.H.: Verification in queue-connected multicounter machines. Int. J. Found. Comput. Sci. 13(1), 115-127 (2002)
10. Ibarra, O.H., Dang, Z., San Pietro, P.: Verification in loosely synchronous queueconnected discrete timed automata. Theor. Comput. Sci. 290(3), 1713-1735 (2003)
11. Jhala, R., Majumdar, R.: Interprocedural analysis of asynchronous programs. In: POPL, pp. 339-350. ACM Press, New York (2007)
12. La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: LICS, pp. 161-170. IEEE Computer Society Press, Los Alamitos (2007)
13. Libasync, http://pdos.csail.mit.edu/6.824-2004/async/.
14. Musuvathi, M., Qadeer, S.: Iterative context bounding for systematic testing of multithreaded programs. In: PLDI, pp. 446-455. ACM, New York (2007)
15. Peng, W., Purushothaman, S.: Analysis of a class of communicating finite state machines. Acta Inf. 29(6/7), 499-522 (1992)
16. Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 93-107. Springer, Heidelberg (2005)
17. Qadeer, S., Wu, D.: Kiss: keep it simple and sequential. In: PLDI, pp. 14-24. ACM, New York (2004)
18. Sen, K., Viswanathan, M.: Model checking multithreaded programs with asynchronous atomic methods. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 300-314. Springer, Heidelberg (2006)
19. Zeldovich, N., Yip, A., Dabek, F., Morris, R., Mazières, D., Kaashoek, M.F.: Multiprocessor support for event-driven programs. In: USENIX (2003)