Thread quantification for concurrent shape analysis

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

Volumn 5123 LNCS, Issue , 2008, Pages 399-413

  Berdine, J ^a   Lev Ami, T ^b   Manevich, R ^b   Ramalingam, G ^c   Sagiv, M ^b  

^a MICROSOFT RESEARCH   (United Kingdom)

^b TEL AVIV UNIVERSITY   (Israel)

^c MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER AIDED ANALYSIS; CONCURRENCY CONTROL; CORRELATION METHODS; DATA STRUCTURES; DIGITAL SIGNAL PROCESSING; PROGRAM INTERPRETERS;

ABSTRACT DOMAINS; ABSTRACT INTERPRETATIONS; CANONICAL ABSTRACTION; COMPUTER AIDED VERIFICATION; CONCURRENT PROGRAMS; GLOBAL VARIABLES; INTERNATIONAL CONFERENCES; LINEARIZABILITY; LOCAL VARIABLES; NUMBER OF THREADS; SHAPE-ANALYSIS;

ABSTRACTING;

EID: 48949089233     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70545-1_37     Document Type: Conference Paper

References (29)

1. Amit, D., Rinetzky, N., Reps, T., Sagiv, M., Yahav, E.: Comparison under abstraction for verifying linearizability. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 477-490. Springer, Heidelberg (2007)
2. Calcagno, C., Parkinson, M.J., Vafeiadis, V.: Modular safety checking for fine-grained concurrency. In: Riis Nielson, H., Filé, G. (eds.) SAS 2007. LNCS, vol. 4634, pp. 233-248. Springer, Heidelberg (2007)
3. Clarke, E., Talupur, M., Veith, H.: Proving Ptolemy right: The environment abstraction framework for model checking concurrent systems. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 33-47. Springer, Heidelberg (2008)
4. Clarke, E.M.: Synthesis of resource invariants for concurrent programs. TOPLAS 2(3) (1980)
5. Clarke, E.M., Talupur, M., Veith, H.: Environment abstraction for parameterized verification. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 126-141. Springer, Heidelberg (2005)
6. Doherty, S., Groves, L., Luchangco, V., Moir, M.: Formal verification of a practical lock-free queue algorithm. In: de Frutos-Escrig, D., Núñez, M. (eds.) FORTE 2004. LNCS, vol. 3235, pp. 97-114. Springer, Heidelberg (2004)
7. Flanagan, C., Qadeer, S.: Predicate abstraction for software verification. In: POPL (2002)
8. Flanagan, C., Qadeer, S.: Thread-modular model checking. In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol. 2648, pp. 213-224. Springer, Heidelberg (2003)
9. Gotsman, A., Berdine, J., Cook, B., Sagiv, M.: Thread-modular shape analysis. In: PLDI (2007)
10. Gulwani, S., McCloskey, B., Tiwari, A.: Lifting abstract interpreters to quantified logical domains. In: POPL (2008)
11. Henzinger, T.A., Jhala, R., Majumdar, R.: Race checking by context inference. In: PLDI (2004)
12. Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. TOPLAS 12(3) (1990)
13. Hoare, C.A.R.: Towards a theory of parallel programming. Operating System Techniques (1972)
14. Jones, C.B.: Specification and design of (parallel) programs. In: IFIP Congress (1983)
15. Lahiri, S.K., Bryant, R.E.: Predicate abstraction with indexed predicates. TOCL 9(1) (2007)
16. Lev-Ami, T., Sagiv, M.: TVLA: A framework for implementing static analyses. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol. 1824, pp. 280-302. Springer, Heidelberg (2000), http://www.cs.tau.ac.il/~tvla/
17. Lubachevsky, B.D.: An approach to automating the verification of compact parallel coordination programs I. Acta Inf. 21 (1984)
18. Manevich, R., Lev-Ami, T., Sagiv, M., Ramalingam, G., Berdine, J.: Heap Decomposition for Concurrent Shape Analysis. In: Alpuente, M., Vidal, G. (eds.) SAS 2008. LNCS, vol. 5079, pp. 363-377. Springer, Heidelberg (2008)
19. Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: PODC (1996)
20. Namjoshi, K.S.: Symmetry and completeness in the analysis of parameterized systems. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 299-313. Springer, Heidelberg (2007)
21. Owicki, S.S., Gries, D.: Verifying properties of parallel programs: An axiomatic approach. CACM 19(5) (1976)
22. Pnueli, A., Ruah, S., Zuck, L.D.: Automatic deductive verification with invisible invariants. In: Margaria, T., Yi, W. (eds.) ETAPS 2001 and TACAS 2001. LNCS, vol. 2031. Springer, Heidelberg (2001)
23. Podelski, A., Wies, T.: Boolean Heaps. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 268-283. Springer, Heidelberg (2005)
24. Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. TOPLAS 24(3) (2002)
25. Treiber, R.K.: Systems programming: Coping with parallelism. Technical Report RJ 5118, IBM Almaden Research Center (1986)
26. Wachter, B., Westphal, B.: The spotlight principle. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 182-198. Springer, Heidelberg (2007)
27. Yahav, E.: Verifying safety properties of concurrent Java programs using 3-valued logic. ACM SIGPLAN Notices 36(3) (2001)
28. Yahav, E., Ramalingam, G.: Verifying safety properties using separation and heterogeneous abstractions. In: PLDI (2004)
29. Yorsh, G., Reps, T., Sagiv, M.: Symbolically computing most-precise abstract operations for shape analysis. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 530-545. Springer, Heidelberg (2004)