A decision procedure for detecting atomicity violations for communicating processes with locks

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

Volumn 5578 LNCS, Issue , 2009, Pages 125-142

  Kidd, Nicholas ^a   Lammich, Peter ^b   Touili, Tayssir ^c   Reps, Thomas ^a,d  

^a UNIVERSITY OF WISCONSIN   (United States)

^b UNIVERSITY OF MÜNSTER   (Germany)

^c UNIVERSITÉ PARIS DIDEROT   (France)

^d GRAMMATECH INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATING PROCESS; CONCURRENT JAVA PROGRAMS; CONCURRENT PROGRAM; DECISION PROCEDURE; LOCK-BASED SYNCHRONIZATION; MEMORY LOCATIONS; NONDETERMINISTIC FINITE AUTOMATON; PUSHDOWN MODELS; SEMI-DECISION PROCEDURES; SERIALIZABILITY;

ATOMS; AUTOMATA THEORY; JAVA PROGRAMMING LANGUAGE; MODEL CHECKING; SPIN DYNAMICS; TRANSLATION (LANGUAGES);

COMPUTER SOFTWARE;

EID: 70350629180     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02652-2_12     Document Type: Conference Paper

References (24)

1. 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)
2. Lal, A., Touili, T., Kidd, N., Reps, T.: Interprocedural analysis of concurrent programs under a context bound. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 282-298. Springer, Heidelberg (2008)
3. Lal, A., Reps, T.: Reducing concurrent analysis under a context bound to sequential analysis. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 37-51. Springer, Heidelberg (2008)
4. Bouajjani, A., Esparza, J., Touili, T.: A generic approach to the static analysis of concurrent programs with procedures. In: POPL (2003)
5. Chaki, S., Clarke, E., Kidd, N., Reps, T., Touili, T.: Verifying concurrent message-passing C programs with recursive calls. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 334-349. Springer, Heidelberg (2006)
6. Kahlon, V., Ivancic, F., Gupta, A.: Reasoning about threads communicating via locks. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 505-518. Springer, Heidelberg (2005)
7. Kahlon, V., Gupta, A.: On the analysis of interacting pushdown systems. In: POPL (2007)
8. Vaziri, M., Tip, F., Dolby, J.: Associating synchronization constraints with data in an object-oriented language. In: POPL (2006)
9. Flanagan, C., Qadeer, S.: A type and effect system for atomicity. In: PLDI (2003)
10. Kidd, N., Reps, T., Dolby, J., Vaziri, M.: Finding concurrency-related bugs using random isolation. In: Jones, N.D., Müller-Olm, M. (eds.) VMCAI 2009. LNCS, vol. 5403, pp. 198-213. Springer, Heidelberg (2009)
11. Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Application to model checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 135-150. Springer, Heidelberg (1997)
12. Finkel, A., Willems, B.: A direct symbolic approach to model checking pushdown systems. Elec. Notes in Theor. Comp. Sci., vol. 9 (1997)
13. Kidd, N., Lammich, P., Touili, T., Reps, T.: A decision procedure for detecting atomicity violations for communicating processes with locks. Technical Report 1649r, Univ. of Wisconsin (April 2009), http://www.cs.wisc.edu/wpis/ abstracts/tr1649.abs.html
14. Kidd, N., Lal, A., Reps, T.: Language strength reduction. In: Alpuente, M., Vidal, G. (eds.) SAS 2008. LNCS, vol. 5079, pp. 283-298. Springer, Heidelberg (2008)
15. Kahlon, V., Gupta, A.: Personal communication (January 2009)
16. Schwoon, S.: Model-Checking Pushdown Systems. PhD thesis, TUM (2002)
17. Eytani, Y., Havelund, K., Stoller, S.D., Ur, S.: Towards a framework and a benchmark for testing tools for multi-threaded programs. Conc. and Comp. Prac. and Exp. 19(3) (2007)
18. Reps, T.: Program analysis via graph reachability. Inf. and Softw. Tech. 40 (1998)
19. Harrison, M.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)
20. Reps, T., Schwoon, S., Jha, S., Melski, D.: Weighted pushdown systems and their application to interprocedural dataflow analysis. SCP 58 (2005)
21. Kidd, N., Lal, A., Reps, T.: WALi: The Weighted Automaton Library (February 2009), http://www.cs.wisc.edu/wpis/wpds/download.php
22. BuDDy: A BDD package (July 2004), http://buddy.wiki.sourceforge.net/
23. Bouajjani, A., Müller-Olm, M., Touili, T.: Regular symbolic analysis of dynamic networks of pushdown systems. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 473-487. Springer, Heidelberg (2005)
24. Lammich, P., Müller-Olm, M., Wenner, A.: Predecessor sets of dynamic pushdown networks with tree-regular constraints. In: CAV (2009) (to appear)