Verifying safety properties of concurrent heap-manipulating programs

ACM Transactions on Programming Languages and Systems

Volumn 32, Issue 5, 2010, Pages

  Yahav, Eran ^a   Sagiv, Mooly ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Abstract interpretation; Concurrency; Java; Safety properties; Shapeanalysis; Verification

Indexed keywords

ABSTRACT INTERPRETATIONS; CONCURRENT PROGRAM; DATA TYPE; JAVA; NUMBER OF THREADS; RUN-TIME ERRORS; SAFETY PROPERTY; SCHEDULING INFORMATION; SHAPE-ANALYSIS; VERIFICATION ALGORITHMS; VERIFICATION TECHNIQUES;

ABSTRACTING; PROGRAM INTERPRETERS;

PROGRAM DEBUGGING;

EID: 77952929313     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1745312.1745315     Document Type: Article

References (120)

1. ABDULLA, P. A., ANNICHINI, A., BENSALEM, S., BOUAJJANI, A., HABERMEHL, P., AND LAKHNECH, Y. 1999. Verification of infinite-state systems by combining abstraction and reachability analysis. In Proceedings of the 11th International Conference on Computer Aided Verification (CAV'99). Springer-Verlag, Berlin, Germany, 146-159.
2. AMIT, D., RINETZKY, N., REPS, T., SAGIV, M., AND YAHAV, E. 2007. Comparison under abstraction for verifying linearizability. In Proceedings of the 19th International Conference on Computer Aided Verification (CAV'07). Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany.
3. ATIG, M. F., BOUAJJANI, A., AND QADEER, S. 2009. Context-bounded analysis for concurrent programs with dynamic creation of threads. In Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, vol.5505. Springer-Verlag, Berlin, Germany, 107-123.
4. BALABAN, I.,PNUELI, A., AND ZUCK, L. D. 2005. Shape analysis by predicate abstraction. In Proceedings of the Verification, Model Checking, and Abstract Interpretation. Lecture Notes in Computer Science, vol.3385. Springer-Verlag, Berlin, Germany, 164-180.
5. BALL, T.,MAJUMDAR, R.,MILLSTEIN, T., AND RAJAMANI, S. 2001. Automatic predicate abstraction of C programs. In Proceedings of the Conference on Programming Languages Design and Implementation. ACM, New York, 203-213.
6. BENSALEM, S., GANESH, V., LAKHNECH, Y.,MUÑOZ, C., OWRE, S., RUESS, H., RUSHBY, J., RUSU, V., SÄIDI, H., SHANKAR, N., SINGERMAN, E., AND TIWARI, A. 2000. An overview of SAL. In Proceedings of the 5th NASA Langley Formal Methods Workshop (LFM'00), NASA, Hampton, VA, 187-196.
7. BENSALEM, S., LAKHNECH, Y., AND OWRE, S. 1998. Invest: A tool for the verification of invariants. In Proceedings of the 10th International Conference on Computer Aided Verification (CAV'98). Springer-Verlag, Berlin, Germany, 505-510.
8. BERDINE, J., CALCAGNO, C., COOK, B., DISTEFANO, D., OHEARN, P. W., WIES, T., AND YANG, H. 2007. Shape analysis for composite data structures. In Proceedings of the Computer Aided Verification. Lecture Notes in Computer Science, vol.4590. Springer-Verlag, Berlin, Germany, 178-192.
9. BERDINE, J., CALCAGNO, C., AND OHEARN, P. W. 2005. Symbolic execution with separation logic. In Proceedings of the Programming Languages and Systems. Lecture Notes in Computer Science, vol.3780. Springer-Verlag, Berlin, Germany, 52-68.
10. BERDINE, J., LEV-AMI, T.,MANEVICH, R.,RAMALINGAM, G., AND SAGIV,M. 2008. Thread quantification for concurrent shape analysis. In Proceedings of the 20th International Conference on Computer Aided Verification (CAV'08). Lecture Notes in Computer Science, vol.5123. Springer-Verlag, Berlin, Germany, 399-413.
11. BOGUDLOV, I., LEV-AMI, T., REPS, T. W., AND SAGIV, M. 2007. Revamping TVLA: Making parametric shape analysis competitive. In Proceedings of the 19th International Conference on Computer Aided Verification (CAV'07). Lecture Notes in Computer Science, vol.4590. Springer-Verlag, Berlin, Germany, 221-225.
12. BORNAT, R., CALCAGNO, C., O'HEARN, P., AND PARKINSON, M. 2005. Permission accounting in separation logic. SIGPLAN Not. 40, 1, 259-270.
13. BOYAPATI, C., LEE, R., AND RINARD, M. 2002. Ownership types for safe programming: preventing data races and deadlocks. In Proceedings of the 17th ACM SIGPLAN Conference on Object-Oriented Programming Systems Languages and Applications (OOPSLA'02). ACM, New York, 211-230.
14. BOYAPATI, C. AND RINARD, M. 2001. A parameterized type system for race-free java programs. In Proceedings of the 16th ACM SIGPLAN Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA'01). ACM, New York, 56-69.
15. BUHR, P. A.,FORTIER,M., AND COFFIN,M.H. 1995. Monitor classification. ACMComput. Surv. 27, 1, 63-107.
16. CALCAGNO, C., DISTEFANO, D., O'HEARN, P., AND YANG, H. 2009. Compositional shape analysis by means of bi-abduction. In Proceedings of the 36th Annual ACM Symposium on Principles of Programming Languages (POPL'09). ACM, New York, 289-300.
17. CARDELLI, L. AND GORDON, A. D. 1998. Mobile ambients. In Proceedings of the Foundations of Software Science and Computation Structures (FoSSaCS'98). Lecture Notes in Computer Science, vol.1378. Springer-Verlag, Berlin, Germany, 140-155.
18. CENCIARELLI, P.,KNAPP, A.,REUS, B., ANDWIRSING,M. 1999. An event-based structural operational semantis of multi-threaded Java. In Formal Syntax and Semantics of Java. Springer-Verlag, Berlin, Germany, 157-200.
19. CHASE, D.,WEGMAN, M., AND ZADECK, F. 1990. Analysis of pointers and structures. In Proceedings of the Conference on Programming Languages Design and Implemntation. ACM, New York, 296-310.
20. CHOI, J., LOGINOV, A., AND SARKAR, V. 2001. Static datarace analysis for multithreaded objectoriented programs. IBM Research Report 22146, IBM Research.
21. CLARKE, E.,GRUMBERG, O., AND LONG, D. 1994. Model checking and abstraction. Trans. Prog. Lang. and Syst. 16, 5, 1512-1542.
22. CLARKE, E., GRUMBERG, O., AND PELED, D. 1999a. Model Checking. MIT Press, Cambridge, MA.
23. CLARKE, E., TALUPUR, M., AND H. V. 2008. Proving ptolemy right: The environment abstraction framework for model checking concurrent systems. In Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, vol.4963. Springer-Verlag, Berlin, Germany, 33-47.
24. CLARKE, E., TALUPUR, M., AND VEITH, H. 2006. Environment abstraction for parameterized verification. In Proceedings of the Verification, Model Checking, and Abstract Interpretation. Lecture Notes in Computer Science, vol.3855. Springer-Verlag, Berlin, Germany, 126-141.
25. CLARKE, E. M., GRUMBERG, O., AND JHA, S. 1997. Verifying parameterized networks. Trans. Prog. Lang. Syst. 19, 5, 726-750.
26. CLARKE, E. M., GRUMBERG, O., AND PELED, D. A. 1999b. Model Checking. MIT Press, Cambridge, MA.
27. CLAVEL, M.,DUŔAN, F., EKER, S., LINCOLN, P.,MART́I-OLIET, N.,MESEGUER, J., AND QUESADA, J. F. 2002. Maude: specification and programming in rewriting logic. Theoret. Comput. Sci. 285, 2, 187-243. (Pubitemid 34862893)
28. COOK, B., KROENING, D., AND SHARYGINA, N. 2005. Symbolic model checking for asynchronous boolean programs. In Proceedings of the Symposium on Model Checking Software (SPIN'05). Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany, 75-90.
29. CORBETT, J. C. 2000. Using shape analysis to reduce finite-state models of concurrent java programs. ACM Trans. Softw. Eng. Methodol. 9, 1, 51-93.
30. COUSOT, P. AND COUSOT, R. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In Proceedings of the Symposium on Principles of Programming Languages. ACM, New York, 238-252.
31. COUSOT, P. AND COUSOT, R. 1979. Systematic design of program analysis frameworks. In Proceedings of the Symposium on Principles of Programming Languages. ACM, New York, 269-282.
32. DAS, M.,LERNER, S., AND SEIGLE,M. 2002. ESP: Path-sensitive program verification in polynomial time. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'02). ACM, New York, 57-68
33. DAS, S., DILL, D., AND PARK, S. 1999. Experience with predicate abstraction. In Proceedings of the 11th International Conference on Computer-Aided Verification. Springer-Verlag, Berlin, Germany.
34. DEMARTINI, C., IOSIF, R., AND SISTO, R. 1999a. A deadlock detection tool for concurrent Java programs. Softw. Pract. Exper. 29, 7, 577-603.
35. DEMARTINI, C., IOSIF, R., AND SISTO, R. 1999b. dSPIN: A dynamic extension of SPIN. In Proceedings of the 5th and 6th International SPIN Wokshops on Theoretical and Practical Aspects of SPIN Model Checking. Springer-Verlag, Berlin, Germany, 261-276.
36. DISTEFANO,D., O'HEARN, P.W., AND YANG,H. 2006. A local shape analysis based on separation logic. In Proceedings of the Symposium on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'06). Lecture Notes in Computer Science, vol.3920. Springer-Verlag, New York, 287-302.
37. EMERSON, E. A. AND SISTLA, A. P. 1993. Symmetry and model checking. In Proceedings of the International Conference in Computer-Aided Verification (CAV). Lecture Notes in Computer Science, vol.697. Springer-Verlag, Berlin, Germany, 463-478.
38. ENGLER, D. AND ASHCRAFT, K. 2003. Racerx: Effective, static detection of race conditions and deadlocks. In Proceedings of the 19th ACM Symposium on Operating Systems Principles (SOSP'03). ACM, New York, 237-252.
39. FARZAN, A., CHEN, F., MESEGUER, J., AND ROSU, G. 2004. Formal analysis of java programs in javafan. In Proceedings of the International Conference in Computer-Aided Verification (CAV'04). Lecture Notes in Computer Science, vol.3114. Springer-Verlag, Berlin, Germany, 501-505.
40. FINK, S., YAHAV, E., DOR, N., RAMALINGAM, G., AND GEAY, E. 2006. Effective typestate verification in the presence of aliasing. In Proceedings of the International Symposium on Software Testing and Analysis (ISSTA'06). ACM, New York, 133-144.
41. FLANAGAN, C. AND ABADI,M. 1999. Types for safe locking. In Proceedings of the 8th European Symposium on Programming Languages and Systems (ESOP'99). Springer-Verlag, Berlin, Germany, 91-108.
42. FLANAGAN, C. AND FREUND, S. N. 2000. Type-based race detection for java. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'00). ACM, New York, 219-232.
43. FLANAGAN, C. AND FREUND, S. N. 2004. Type inference against races. In Proceedings of the 11th Annual International Symposium on Static Analysis (SAS'04). Lecture Notes in Computer Science, vol.3148. Springer-Verlag, Berlin, Germany, 116-132.
44. FLANAGAN, C., FREUND, S. N., AND QADEER, S. 2002. Thread-modular verification for sharedmemory programs. In Proceedings of the 11th European Symposium on Programming (ESOP'02). Lecture Notes in Computer Science, vol.2305. Springer-Verlag, Berlin, Germany, 262-277.
45. FLANAGAN, C., FREUND, S. N., AND YI, J. 2008. Velodrome: a sound and complete dynamic atomicity checker for multithreaded programs. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'08). ACM, New York, 293-303.
46. FLANAGAN, C. AND GODEFROID, P. 2005. Dynamic partial-order reduction for model checking software. In Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'05). ACM, New York, 110-121.
47. GANAI, M. K. AND GUPTA, A. 2008. Efficient modeling of concurrent systems in BMC. In Proceedings of the Symposium on Model Checking Software (SPIN'08). Lecture Notes in Computer Science, vol.5156. Springer-Verlag, Berlin, Germany, 114-133.
48. GODEFROID, P. 1996. Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem. Lecture Notes in Computer Science, vol.1032. Springer-Verlag, Berlin, Germany.
49. GOETZ, B., PEIERLS, T., BLOCH, J., BOWBEER, J.,HOLMES, D., AND LEA, D. 2006. Java Concurrency in Practice. Addison-Wesley, Reading, MA.
50. GOPAN, D.,REPS, T., AND SAGIV,M. 2005. A framework for numeric analysis of array operations. In Proceedings of the 32nd ACM Symposium on Principles of Programming Languages (POPL'05). ACM, New York, 338-350.
51. GOSLING, J., JOY, B., AND STEELE, G. 1997. The Java Language Specification. The Java Series. Addison-Wesley, Reading, MA.
52. DAS, S., DILL, D., AND PARK, S. 1999. Experience with predicate abstraction. In Proceedings of the 11th International Conference on Computer-Aided Verification. Springer-Verlag, Berlin, Germany.
53. DEMARTINI, C., IOSIF, R., AND SISTO, R. 1999a. A deadlock detection tool for concurrent Java programs. Softw. Pract. Exper. 29, 7, 577-603.
54. DEMARTINI, C., IOSIF, R., AND SISTO, R. 1999b. dSPIN: A dynamic extension of SPIN. In Proceedings of the 5th and 6th International SPIN Wokshops on Theoretical and Practical Aspects of SPIN Model Checking. Springer-Verlag, Berlin, Germany, 261-276.
55. DISTEFANO,D., O'HEARN, P.W., AND YANG,H. 2006. A local shape analysis based on separation logic. In Proceedings of the Symposium on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'06). Lecture Notes in Computer Science, vol.3920. Springer-Verlag, New York, 287-302.
56. EMERSON, E. A. AND SISTLA, A. P. 1993. Symmetry and model checking. In Proceedings of the International Conference in Computer-Aided Verification (CAV). Lecture Notes in Computer Science, vol.697. Springer-Verlag, Berlin, Germany, 463-478.
57. ENGLER, D. AND ASHCRAFT, K. 2003. Racerx: Effective, static detection of race conditions and deadlocks. In Proceedings of the 19th ACM Symposium on Operating Systems Principles (SOSP'03). ACM, New York, 237-252.
58. FARZAN, A., CHEN, F., MESEGUER, J., AND ROSU, G. 2004. Formal analysis of java programs in javafan. In Proceedings of the International Conference in Computer-Aided Verification (CAV'04). Lecture Notes in Computer Science, vol.3114. Springer-Verlag, Berlin, Germany, 501-505.
59. FINK, S., YAHAV, E., DOR, N., RAMALINGAM, G., AND GEAY, E. 2006. Effective typestate verification in the presence of aliasing. In Proceedings of the International Symposium on Software Testing and Analysis (ISSTA'06). ACM, New York, 133-144.
60. FLANAGAN, C. AND ABADI,M. 1999. Types for safe locking. In Proceedings of the 8th European Symposium on Programming Languages and Systems (ESOP'99). Springer-Verlag, Berlin, Germany, 91-108.
61. FLANAGAN, C. AND FREUND, S. N. 2000. Type-based race detection for java. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'00). ACM, New York, 219-232.
62. FLANAGAN, C. AND FREUND, S. N. 2004. Type inference against races. In Proceedings of the 11th Annual International Symposium on Static Analysis (SAS'04). Lecture Notes in Computer Science, vol.3148. Springer-Verlag, Berlin, Germany, 116-132.
63. FLANAGAN, C., FREUND, S. N., AND QADEER, S. 2002. Thread-modular verification for sharedmemory programs. In Proceedings of the 11th European Symposium on Programming (ESOP'02). Lecture Notes in Computer Science, vol.2305. Springer-Verlag, Berlin, Germany, 262-277.
64. FLANAGAN, C., FREUND, S. N., AND YI, J. 2008. Velodrome: a sound and complete dynamic atomicity checker for multithreaded programs. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'08). ACM, New York, 293-303.
65. FLANAGAN, C. AND GODEFROID, P. 2005. Dynamic partial-order reduction for model checking software. In Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'05). ACM, New York, 110-121.
66. GANAI, M. K. AND GUPTA, A. 2008. Efficient modeling of concurrent systems in BMC. In Proceedings of the Symposium on Model Checking Software (SPIN'08). Lecture Notes in Computer Science, vol.5156. Springer-Verlag, Berlin, Germany, 114-133.
67. GODEFROID, P. 1996. Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem. Lecture Notes in Computer Science, vol.1032. Springer-Verlag, Berlin, Germany.
68. GOETZ, B., PEIERLS, T., BLOCH, J., BOWBEER, J.,HOLMES, D., AND LEA, D. 2006. Java Concurrency in Practice. Addison-Wesley, Reading, MA.
69. GOPAN, D.,REPS, T., AND SAGIV,M. 2005. A framework for numeric analysis of array operations. In Proceedings of the 32nd ACM Symposium on Principles of Programming Languages (POPL'05). ACM, New York, 338-350.
70. GOSLING, J., JOY, B., AND STEELE, G. 1997. The Java Language Specification. The Java Series. Addison-Wesley, Reading, MA.
71. LAL, A. AND REPS, T. 2008. Reducing concurrent analysis under a context bound to sequential analysis. In Proceedings of the Symposium on Computer Aided Verification. Lecture Notes in Computer Science, vol.5123. Springer-Verlag, Berlin, Germany, 37-51.
72. LEA, D. 1997. Concurrent Programming in Java. Addison-Wesley, Reading, MA.
73. LEINO, K. R. AND MÜLLER, P. 2009. A basis for verifying multi-threaded programs. In Proceedings of the 18th European Symposium on Programming Languages and Systems (ESOP'09). Springer-Verlag, Berlin, Germany, 378-393.
74. LEV-AMI, T., AND SAGIV,M. 2000. TVLA: A framework for Kleene based static analysis. In Proceedings of the Static Analysis Symposium. Lecture Notes in Computer Science, vol.1824. Springer-Verlag, Berlin, Germany, 280-301.
75. LINDHOLM, T., AND YELLIN, F. 1997. The Java Virtual Machine Specification. The Java Series. Addison-Wesley, Reading, MA.
76. MANEVICH, R., LEV-AMI, T., SAGIV, M., RAMALINGAM, G., AND BERDINE, J. 2008. Heap decomposition for concurrent shape analysis. In Proceedings of the 15th International Symposium on Static Analysis (SAS'08). Lecture Notes in Computer Science, vol.5079. Springer-Verlag, Berlin, Germany, 363-377.
77. MANEVICH, R., YAHAV, E., RAMALINGAM, G., AND SAGIV, S. 2005. Predicate abstraction and canonical abstraction for singly-linked lists. In Proceedings of the 6th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'05). Lecture Notes in Computer Science, vol.3385. Springer-Verlag, Berlin, Germany, 181-198.
78. MICHAEL, M. AND SCOTT, M. 1996. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC '96). ACM, New York, 267-275.
79. MICHAEL, M. M. 2004. Hazard pointers: Safe memory reclamation for lock-free objects. IEEE Trans. Parall. Distrib. Syst. 15, 6, 491-504.
80. MOLLER, A. AND SCHWARTZBACH,M. I. 2001. The pointer assertion logic engine. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'01). ACM, New York, 221-231.
81. MOORE, J. S. AND PORTER, G. 2002. The apprentice challenge. ACM Trans. Prog. Lang. Syst. 24, 3, 193-216.
82. NAIK, M., AIKEN, A., AND WHALEY, J. 2006. Effective static race detection for java. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'06). ACM, New York, 308-319.
83. NETZER, R., AND MILLER, B. 1992. What are race conditions? Some issues and formalizations. ACM Lett. Prog. Lang. Syst. 1, 1, 74-88.
84. NIELSON, F., NIELSON, H. R., AND SAGIV, M. 2000. A kleene analysis of mobile ambients. In Proceedings of the 9th European Symposium on Programming Languages and Systems (ESOP'00). Springer-Verlag, Berlin, Germany, 305-319.
85. O'HEARN, P. W. 2007. Resources, concurrency, and local reasoning. Theoret. Comput. Sci. 375, 1-3, 271-307. (Prelim version appeared in CONCUR'04, Lecture Notes in Computer Science, vol. 3170, Springer-Verlag, Berlin, Germany, 49-67.)
86. PNUELI, A., XU, J., AND ZUCK, L. D. 2002. Liveness with (0, 1, infty)-counter abstraction. In Proceedings of the 14th International Conference on Computer Aided Verification (CAV'02). Springer-Verlag, Berlin, Germany, 107-122.
87. PRAKASH, S., LEE, Y., AND JOHNSON, T. 1991. A non-blocking algorithm for shared queues using Compare-and-Swap. In Proceedings of the International Conference on Parallel Processing. CRC Press, 68-75.
88. PRATIKAKIS, P., FOSTER, J., AND HICKS, M. 2006. Locksmith: Context-sensitive correlation analysis for race detection. In Proceedings of the ACM Conference on Programming Language Design and Implementation (PLDI'06). ACM, New York, 320-331.
89. QADEER, S. AND REHOF, J. 2005. Context-bounded model checking of concurrent software. In Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, vol.3440. Springer-Verlag, Berlin, Germany, 93-107.
90. REPS, T., SAGIV, M., AND LOGINOV, A. 2003. Finite differencing of logical formulas for static analysis. In Proceedings of the European Symposium on Programming. Lecture Notes in Computer Science, vol.2618. Springer-Verlag, Berlin, Germany
91. REPS, T. W., SAGIV, M., AND WILHELM, R. 2004. Static program analysis via 3-valued logic. In Proceedings of the Computer Aided Verification. Lecture Notes in Computer Science, vol.3114. Springer-Verlag, Berlin, Germany, 401-404.
92. REYNOLDS, J. C. 2002. Separation logic: A logic for shared mutable data structures. In Proceedings of the Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, CA. 55.
93. RINETSKEY, N. AND SAGIV,M. 2001. Interprocedural shape analysis for recursive programs. In Proceedings of the International Conference on Compiler Construction, Lecture Notes in Computer Science, vol.2027. Springer-Verlag, Berlin, Germany, 133-149.
94. RINETZKY, N. 2008. Interprocedural and modular local heap shape analysis. Ph.D. dissertation, Tel-Aviv Univ. Tel-Aviv Isreal.
95. SAGIV, M., REPS, T., AND WILHELM, R. 1998. Solving shape-analysis problems in languages with destructive updating. ACM Trans. Program. Lang. Syst. 20, 1, 1-50.
96. SAGIV, M., REPS, T., AND WILHELM, R. 2002. Parametric shape analysis via 3-valued logic. ACM Trans. Prog. Lang. Syst. 24, 3, 217-298.
97. SAIDI, H. 2000. Model checking guided abstraction and analysis. In Proceedings of the 7th International Symposium on Static Analysis (SAS'00). Springer-Verlag, Berlin, Germany, 377-396.
98. SHAHAM, R., YAHAV, E., KOLODNER, E. K., AND SAGIV, M. 2003. Establishing local temporal heap safety properties with applications to compile-time memory management. In Proceedings of the 10th International Static Analysis Symposium (SAS'03). Lecture Notes in Computer Science, vol.2694. Springer-Verlag, Berlin, Germany.
99. SILBERSCHATZ, A. AND GALVIN, P. B. 1994. Operating Systems Concepts, 4 Ed. Addison-Wesley, Reading, MA.
100. STERLING, N. 1993. Warlock-A static data race analysis tool. In USENIX Technical Conference Proceedings. ACM, New York, 97-106.
101. STOLLER, S. 2000. Model-checking multi-threaded distributed Java programs. In Proceedings of the 7th International SPINWorkshop onModel Checking of Software. Lecture Notes in Computer Science, vol.1885. Springer-Verlag, Berlin, Germany, 224-244.
102. STONE, J. M. 1990. A simple and correct shared-queue algorithm using compare-and-swap. In Proceedings of the Conference on Supercomputing (Supercomputing'90). IEEE Computer Society Press, Los Alamitos, CA, 495-504.
103. STONE, J. M. 1992. A non-blocking Compare-and-Swap algorithm for a shared circular queue. In Proceedings of the Parallel and Distributed Computing in Engineering Systems. Elsevier Science Publishers, Amsterdam, The Netherlands, 147-152.
104. STROM, R. AND YEMINI, S. 1986. Typestate: A programming language concept for enhancing software reliability. IEEE Trans. Software Eng. 12, 1, 157-171.
105. STROM, R. E. 1983. Mechanisms for compile-time enforcement of security. In Proceedings of the 10th ACM Symposium on Principles of Programming Languages (POPL'83). ACM, New York, 276-284.
106. VAFEIADIS, V. 2008. Modular fine-grained concurrency verification. Ph.D. dissertation, University of Cambridge, Computer Laboratory. Also available as technical report UCAM-CL-TR-726.
107. VAFEIADIS, V. 2009. Shape-value abstraction for verifying linearizability. In Proceedings of the Conference on Verification, Model Checking, and Abstract Interpretation. Lecture Notes in Computer Science, vol.5403. Springer-Verlag, Berlin, Germany, 335-348.
108. VALĹEE-RAI, R., HENDREN, L., SUNDARESAN, V., LAM, P., GAGNON, E., AND CO, P. 1999. Soot - A java optimization framework. In Proceedings of the 1999 Conference of the Centre for Advanced Studies on Collabrative Research. IBM, 125-135.
109. VALMARI, A. 1991. Stubborn sets for reduced state space generation. In Proceedings of the Conference on Advances in Petri Nets 1990. Lecture Notes in Computer Science, vol.483. Springer-Verlag, Berlin, Germany, 491-515.
110. VECHEV, M., AND YAHAV, E. 2008. Deriving linearizable fine-grained concurrent objects. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI'08). ACM, New York, 125-135.
111. VECHEV, M., YAHAV, E., BACON, D. F., AND RINETZKY, N. 2007. CGCExplorer: A semi-automated search procedure for provably correct concurrent collectors. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI'07). ACM, New York, 456-467.
112. VECHEV, M., YAHAV, E., AND YORSH, G. 2009. Experience with model checking linearizability. In Proceedings of the 16th International SPIN Workshop on Model Checking Software. Springer-Verlag, Berlin, Germany, 261-278.
113. VERMEULEN, A. 1997. Java deadlock: The woes of multithreaded design. Dr. Dobb's J. Softw. Tools 22, 9, 52, 54-56, 88, 89.
114. WING, J. M. AND GONG, C. 1990. A library of concurrent objects and their proofs of correctness. Tech. rep. CMU-CS-90-151, CMU.
115. YAHAV, E. 2000. 3VMC user's manual. Available at http://www.math.tau.ac. il/?yahave.
116. YAHAV, E. 2001. Verifying safety properties of concurrent Java programs using 3-valued logic. In Proceedings of the Symposium on Principles of Programming Languages. ACM, New York, 27-40.
117. YAHAV, E. AND RAMALINGAM, G. 2004. Verifying safety properties using separation and heterogeneous abstractions. In Proceedings of the Conference on Programming Language Design and Implementation. ACM, New York, 25-34.
118. YAHAV, E., AND SAGIV, M. 2003. Automatically verifying concurrent queue algorithms. Electronic Notes in Theoretical Computer Science, vol.89. Elsevier, Amsterdam, The Netherlands.
119. YANG, H., LEE, O., BERDINE, J., CALCAGNO, C., COOK, B., DISTEFANO, D., AND O'HEARN, P. 2008. Scalable shape analysis for systems code. In Proceedings of the Conference on Aided Verification. Lecture Notes in Computer Science, vol.5123. Springer-Verlag, Berlin, Germany, 385-398.
120. ZEE, K., KUNCAK, V., AND RINARD, M. 2008. Full functional verification of linked data structures. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'08). ACM, New York, 349-361.