Types for safe locking: Static race detection for Java

ACM Transactions on Programming Languages and Systems

Volumn 28, Issue 2, 2006, Pages 207-255

  Abadi, Martin ^a,b,d   Flanagan, Cormac ^b,d   Freund, Stephen N ^c  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c WILLIAMS COLLEGE   (United States)

^d University of California Santa Cruz   (United States)

Author keywords

Concurrent programs; Race conditions; Type inference; Type system

Indexed keywords

CODES (STANDARDS); COMPUTER SOFTWARE; DIGITAL LIBRARIES; JAVA PROGRAMMING LANGUAGE; SYNCHRONIZATION; USER INTERFACES;

CONCURRENT PROGRAMS; RACE CONDITIONS; TYPE INFERENCE; TYPE SYSTEM;

OBJECT RECOGNITION;

EID: 33745425614     PISSN: 01640925     EISSN: 01640925     Source Type: Journal    
DOI: 10.1145/1119479.1119480     Document Type: Article

References (66)

1. AGESEN, O., FREUND, S. N., AND MITCHELL, J. C. 1997. Adding type parameterization to the Java language. In Proceedings of the ACM Conference on Object-Oriented Programming, Systems, Languages and Applications. 49-65.
2. AIKEN, A. AND GAY, D. 1998. Barrier inference. In Proceedings of the ACM Symposium on the Principles of Programming Languages. 243-354.
3. ALDRICH, J., CHAMBERS, C., SIRER, E. G., AND EGGERS, S. 1999. Static analyses for eliminating unnecessary synchronization from Java programs. In Proceedings of the Static Analysis Symposium, A. Cortesi and G. Filé Eds. Lecture Notes in Computer Science, vol. 1694. Springer-Verlag, 19-38.
4. AMTOFT, T., NIELSON, F., AND NIELSON, H. R. 1997. Type and behaviour reconstruction for higher-order concurrent programs. J. Functional Prog. 7, 3, 321-347.
5. BACON, D. F., STROM, R. E., AND TARAFDAR, A. 2001. Guava: A dialect of Java without data races. In Proceedings of the ACM Conference on Object-Oriented Programming, Systems, Languages and Applications. 382-400.
6. BIRRELL, A. D. 1989. An introduction to programming with threads. Research Report 35, Digital Equipment Corporation Systems Research Center.
7. BLANCHET, B. 1999. Escape analysis for object-oriented languages. Application to Java. In Proceedings of the ACM Conference on Object-Oriented Programming, Systems, Languages and Applications. 20-34.
8. BOGDA, J. AND HÖLZLE, U. 1999. Removing unnecessary synchronization in Java. In Proceedings of the ACM Conference on Object-Oriented Programming, Systems, Languages and Applications, 35-46.
9. BOYAPATI, C., LEE, R., AND RINARD, M. 2002. A type system for preventing data races and deadlocks in Java programs. In Proceedings of the ACM Conference on Object-Oriented Programming, Systems, Languages and Applications. 211-230.
10. BOYAPATI, C. AND RINARD, M. 2001. A parameterized type system for race-free Java programs. In Proceedings of the ACM Conference on Object-Oriented Programming, Systems, Languages and Applications. 56-69.
11. BRACHA, G., ODERSKY, M., STOUTAMIRE, D., AND WADLER, P. 1998. Making the future safe for the past: Adding genericity to the Java programming language. In Proceedings of the ACM Conference on Object-Oriented Programming, Systems, Languages and Applications. 183-200.
12. CARDELLI, L. 1988. Typechecking dependent types and subtypes. In Lecture Notes in Computer Science on Foundations of Logic and Functional Programming, Springer-Verlag, New York, Inc., 45-57.
13. CARDELLI, L. 1997. Mobile ambient synchronization. Tech. Rep. 1997-013, Digital Systems Research Center, Palo Alto, CA.
14. CARTWRIGHT, R. AND STEELE JR., G. L. 1998. Compatible genericity with run-time types for the Java programming language. In Proceedings of the ACM Conference on Object-Oriented Programming, Systems, Languages and Applications. 201-215.
15. CHAMILLARD, A. T., CLARKE, L. A., AND AVRUNIN, G. S. 1996. An empirical comparison of static concurrency analysis techniques. Tech. Rep. 96-084, Department of Computer Science, University of Massachusetts at Amherst.
16. CHOI, J.-D., GUPTA, M., SERRANO, M. J., SREEDHAR, V. C., AND MIDKIFF, S. P. 1999. Escape analysis for Java. In Proceedings of the ACM Conference on Object-Oriented Programming, Systems, Languages and Applications. 1-19.
17. CHOI, J.-D., LEE, K., LOGINOV, A., O'CALLAHAN, R., SARKAR, V., AND SRIDHARA, M. 2002. Efficient and precise datarace detection for multithreaded object-oriented programs. In Proceedings of the ACM Conference on Programming Language Design and Implementation. 258-269.
18. CORBETT, J. C. 1996. Evaluating deadlock detection methods for concurrent software. IEEE Trans. Softw. Eng. 22, 3, 161-180.
19. COUSOT, P. AND COUSOT, R. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the ACM Symposium on the Principles of Programming Languages. 238-252.
20. DELINE, R. AND FÄHNDRICH, M. 2001. Enforcing high-level protocols in low-level software. In Proceedings of the ACM Conference on Programming Language Design and Implementation. 59-69.
21. DETLEFS, D. L., LEINO, K. R. M., NELSON, G., AND SAXE, J. B. 1998. Extended static checking. Research Report 159, Compaq Systems Research Center.
22. DROSSOPOULOU, S. AND EISENBACH, S. 1997. Java is type safe-Probably. In European Conference On Object Oriented Programming. 389-418.
23. DWYER, M. B. AND CLARKE, L. A. 1994. Data flow analysis for verifying properties of concurrent programs. Tech. Rep. 94-045, Department of Computer Science, University of Massachusetts at Amherst.
24. FAJSTRUP, L., GOUBAULT, E., AND RAUSSEN, M. 1998. Detecting deadlocks in concurrent systems. In Proceedings of the International Conference on Concurrency Theory, D. Sangiorgi and R. de Simone, Eds. Lecture Notes in Computer Science, vol. 1466. Springer-Verlag, 332-347.
25. FLANAGAN, C. AND ABADI, M. 1999a. Object types against races. In Proceedings of the International Conference on Concurrency Theory, J. C. M. Baeten and S. Mauw, Eds. Lecture Notes in Computer Science, vol. 1664. Springer-Verlag, 288-303.
26. FLANAGAN, C. AND ABADI, M. 1999b. Types for safe locking. In Proceedings of the European Symposium on Programming, S. D. Swierstra, Ed. Lecture Notes in Computer Science, vol. 1576. Springer-Verlag, 91-108.
27. FLANAGAN, C. AND FREUND, S. N. 2000. Type-based race detection for Java. In Proceedings of the ACM Conference on Programming Language Design and Implementation, 219-232.
28. FLANAGAN, C. AND FREUND, S. N. 2001. Detecting race conditions in large programs. In Proceedings of the ACM Workshop on Program. Analysis for Software Tools and Engineering. 90-96.
29. FLANAGAN, C. AND FREUND, S. N. 2004. Type inference against races. In Proceedings of the Static Analysis Symposium, 116-132.
30. FLANAGAN, C., FREUND, S. N., AND QADEER, S. 2004. Exploiting purity for atomicity. In Proceedings of the ACM International Symposium on Software Testing and Analysis. 221-231.
31. FLANAGAN, C., JOSHI, R., AND LEINO, K. R. M. 2001. Annotation inference for modular checkers. Information Processing Letters 77, 2-4, 91-108.
32. FLANAGAN, C. AND LEINO, K. R. M. 2001. Houdini, an annotation assistant for ESC/Java. In Formal Methods Europe, J. N. Oliveira and P. Zave, Eds. Lecture Notes in Computer Science, vol. 2021. Springer-Verlag, 500-517.
33. FLANAGAN, C., LEINO, K. R. M., LILLIBRIDGE, M., NELSON, G., SAXE, J. B., AND STATA, R. 2002. Extended static checking for Java. In Proceedings of the ACM Conference on Programming Language Design and Implementation. 234-245.
34. FLANAGAN, C. AND QADEER, S. 2003a. A type and effect system for atomicity. In Proceedings of the ACM Conference on Programming Language Design and Implementation, 338-349.
35. FLANAGAN, C. AND QADEER, S. 2003b. Types for atomicity. In Proceedings of the ACM Workshop on Types in Language Design and Implementation. 1-12.
36. FLATT, M., KRISHNAMURTHI, S., AND FELLEISEN, M. 1998. Classes and mixins. In Proceedings of the ACM Symposium on the Principles of Programming Languages, 171-183.
37. GOSLING, J., JOY, B., AND STEELE, G. 1996. The Java Language Specification. Addison-Wesley.
38. GRAF, S. AND SAIDI, H. 1997. Construction of abstract state graphs with PVS. In Proceedings of the IEEE Conference on Computer Aided Verification. 72-83.
39. GROSSMAN, D. 2003. Type-safe multithreading in Cyclone. In Proceedings of the ACM Workshop on Types in Language Design and Implementation. 13-25.
40. IGARASHI, A., PIERCE, B., AND WADLER, P. 2001. Featherweight Java: A minimal core calculus for Java and GJ. ACM Trans. Prog. Lang. Syst. 23, 3, 396-450.
41. JAVASOFT. 1998. Java Developers Kit, version 1.1. available from http://java.sun.com.
42. JAVASOFT. 2004. Java Developer's Kit, version 1.5. available from http://java.sun.com.
43. JOUVELOT, P. AND GIFFORD, D. 1991. Algebraic reconstruction of types and effects. In Proceedings of the ACM Symposium on the Principles of Programming Languages. 303-310.
44. KISTLER, T. AND MARAIS, J. 1998. WebL - A programming language for the web. In Proceedings of the International World Wide Web Conference. Computer Networks and ISDN Systems, vol. 30. Elsevier, 259-270.
45. KOBAYASHI, N. 1998. A partially deadlock-free typed process calculus. ACM Trans. Prog. Lang. Syst. 20, 2, 436-482.
46. KOBAYASHI, N., SAITO, S., AND SUMII, E. 2000. An implicitly-typed deadlock-free process calculus. In Proceedings of the International Conference on Concurrency Theory, C. Palamidessi, Ed. Lecture Notes in Computer Science, vol. 1877. Springer-Verlag, 489-503.
47. LEINO, K. R. M., SAXE, J. B., AND STATA, R. 1999. Checking Java programs via guarded commands. Tech. Rep. 1999-002, Compaq Systems Research Center, Palo Alto, CA.
48. LUCASSEN, J. M. AND GIFFORD, D. K. 1988. Polymorphic effect systems. In Proceedings of the ACM Conference on Lisp and Functional Programming. 47-57.
49. MYERS, A. C., BANK, J. A., AND LISKOV, B. 1997. Parameterized types and Java. In Proceedings of the ACM Symposium on the Principles of Programming Languages. 132-145.
50. NIELSON, F. 1996. Annotated type and effect systems. ACM Comput. Sum. 28, 2, 344-345. Invited position statement for the Symposium on Models of Programming Languages and Computation.
51. light is type-safe - definitely. In Proceedings of the ACM Symposium on the Principles of Programming Languages. 161-170.
52. ODERSKY, M. AND WADLER, P. 1997. Pizza into Java: Translating theory into practice. In Proceedings of the ACM Symposium on the Principles of Programming Languages. 146-159.
53. SALCIANU, A. AND RINARD, M. 2001. Pointer and escape analysis for multithreaded programs. In Proceedings of the Symposium on Principles and Practice of Parallel Programming. 12-23.
54. SAVAGE, S., BURROWS, M., NELSON, G., SOBALVARRO, P., AND ANDERSON, T. E. 1997. Eraser: A dynamic data race detector for multi-threaded programs. ACM Transactions on Computer Systems 15, 4, 391-411.
55. SCHMIDT, D. C. AND HARRISON, T. H. 1997. Double-checked locking - A optimization pattern for efficiently initializing and accessing thread-safe objects. In Pattern Languages of Program Design 3, R. Martin, F. Buschmann, and D. Riehle, Eds. Addison-Wesley.
56. STANDARD PERFORMANCE EVALUATION CORPORATION. 2000. SPEC JBB2000. Available from http://www.spec.org/osg/jbb2000/.
57. STERLING, N. 1993. Warlock: A static data race analysis tool. In USENIX Winter Technical Conference. 97-106.
58. SYME, D. 1997. Proving Java type soundness. Tech. Rep. 427, University of Cambridge Computer Laboratory Technical Report.
59. TALPIN, J.-P. AND JOUVELOT, P. 1992. Polymorphic type, region and effect inference. J. Funct. Prog. 2, 3, 245-271.
60. TOFTE, M. AND TALPIN, J.-P. 1994. Implementation of the typed call-by-value lambda-calculus using a stack of regions. In Proceedings of the ACM Symposium on the Principles of Programming Languages. 188-201.
61. TOFTE, M. AND TALPIN, J.-P. 1997. Region-based memory management. Information and Computation 132, 2, 109-176.
62. VON PRAUN, C. AND GROSS, T. 2001. Object race detection. In Proceedings of the ACM Conference on Object-Oriented Programming, Systems, Languages and Applications. 70-82.
63. WHALEY, J. AND RINARD, M. 1999. Compositional pointer and escape analysis for Java programs. In Proceedings of the ACM Conference on Object-Oriented Programming, Systems, Languages and Applications. 187-206.
64. WORLD WIDE WEB CONSORTIUM. 2001. Jigsaw. Available from http://www.w3c.org.
65. YAHAV, E. 2001. Verifying safety properties of concurrent Java programs using 3-valued logic. In Proceedings of the ACM Symposium on the Principles of Programming Languages. 27-40.
66. YU, Y., MANOLIOS, P., AND LAMPORT, L. 1999. Model checking TLA+ specifications. In Correct Hardware Design and Verification Methods, L. Pierre and T. Kropf, Eds. Lecture Notes in Computer Science, vol. 1703. Springer-Verlag, 54-66.