Heap decomposition for concurrent shape analysis

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

Volumn 5079 LNCS, Issue , 2008, Pages 363-377

  Manevich, Roman ^a   Lev Ami, Tal ^a   Sagiv, Mooly ^a   Ramalingam, Ganesan ^b   Berdine, Josh ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b MICROSOFT RESEARCH   (United States)

^c MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; CHLORINE COMPOUNDS; CONCURRENT ENGINEERING; DECOMPOSITION; JOB ANALYSIS; PRODUCT DEVELOPMENT; RAPID PROTOTYPING; STATE SPACE METHODS; SYNTHETIC APERTURE SONAR;

INTERNATIONAL SYMPOSIUM; LINEARIZABILITY; NUMBER OF THREADS; PROTOTYPING; SHAPE-ANALYSIS; STATE-SPACE REDUCTION;

STATIC ANALYSIS;

EID: 48949099750     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69166-2_24     Document Type: Conference Paper

References (19)

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. Colvin, R., Doherty, S., Groves, L.: Verifying concurrent data structures by simulation. Electr. Notes Theor. Comput. Sci. 137(2), 93-110 (2005)
3. Doherty, S., Detlefs, D.L., Groves, L., Flood, C.H., Luchangco, V., Martin, P.A., Moir, M., Shavit, N., Steele Jr., G.L.: DCAS is not a silver bullet for nonblocking algorithm design. In: SPAA, pp. 216-224 (2004)
4. Doherty, S., Groves, L., Luchangco, V., Moir, M.: Formal verification of a practical lock-free queue algorithm. In: Núñez, M., Maamar, Z., Pelayo, F.L., Pousttchi, K., Rubio, F. (eds.) FORTE 2004. LNCS, vol. 3236, pp. 97-114. Springer, Heidelberg (2004)
5. Gotsman, A., Berdine, J., Cook, B., Sagiv, M.: Thread-modular shape analysis. In: PLDI, pp. 266-277 (2007)
6. Hackett, B., Rugina, R.: Region-based shape analysis with tracked locations. In: POPL, pp. 310-323 (2005)
7. Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. TOPLAS 12(3), 463-492 (1990)
8. Lev-Ami, T., Sagiv, M.: TVLA: A framework for implementing static analyses. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol. 1824, pp. 280-301. Springer, Heidelberg (2000)
9. Manevich, R., Berdine, J., Cook, B., Ramalingam, G., Sagiv, M.: Shape analysis by graph decomposition. In: TACAS, pp. 3-18 (2007)
10. Manevich, R., Lev-Ami, T., Sagiv, M., Ramalingam, G., Berdine, J.: Heap decomposition for concurrent shape analysis. Technical Report TR-2008-01-85453, Tel Aviv University (January 2008), http://www.cs.tau.ac.il/~rumster/TR-2007-11- 85453.pdf
11. Manevich, R., Sagiv, M., Ramalingam, G., Field, J.: Partially disjunctive heap abstraction. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol. 3148, pp. 265-279. Springer, Heidelberg (2004)
12. Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: PODC, pp. 267-275 (1996)
13. Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer, Heidelberg (1999)
14. Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems 24(3), 217-298 (2002)
15. Treiber, R.K.: Systems programming: Coping with parallelism. Technical Report RJ 5118, IBM Almaden Research Center (April 1986)
16. Vafeiadis, V.: Shape-value abstraction for verifying linearizability. draft (2008)
17. Vafeiadis, V., Herlihy, M., Hoare, T., Shapiro, M.: Proving correctness of highly-concurrent linearisable objects. In: PPOPP, pp. 129-136 (2006)
18. Yahav, E.: Verifying safety properties of concurrent Java programs using 3-valued logic. ACM SIGPLAN Notices 36(3), 27-40 (2001)
19. Yahav, E., Ramalingam, G.: Verifying safety properties using separation and heterogeneous abstractions. In: PLDI, pp. 25-34 (2004)