Dynamic inference of polymorphic lock types

Authors:
James Rose;Nikhil Swamy;Michael Hicks
Affiliations:
Computer Science Department, University of Maryland, College Park, MD;Computer Science Department, University of Maryland, College Park, MD;Computer Science Department, University of Maryland, College Park, MD and University of Maryland Institute for Advanced Computer Studies(UMIACS)
Venue:
Science of Computer Programming - Special issue: Concurrency and synchronization in Java programs
Year:
2005

Citing 22
Cited 5

Profile guided code positioning

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Optimally profiling and tracing programs

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type inference with polymorphic recursion

ACM Transactions on Programming Languages and Systems (TOPLAS)
Static branch frequency and program profile analysis

MICRO 27 Proceedings of the 27th annual international symposium on Microarchitecture
Eraser: a dynamic data race detector for multi-threaded programs

Proceedings of the sixteenth ACM symposium on Operating systems principles
Improving data-flow analysis with path profiles

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Type-based race detection for Java

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Enforceable security policies

ACM Transactions on Information and System Security (TISSEC)
Dynamically Discovering Likely Program Invariants to Support Program Evolution

IEEE Transactions on Software Engineering - Special issue on 1999 international conference on software engineering
Detecting race conditions in large programs

PASTE '01 Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Mining specifications

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A parameterized type system for race-free Java programs

OOPSLA '01 Proceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Extended static checking for Java

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Efficient and precise datarace detection for multithreaded object-oriented programs

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Invariant inference for static checking:

Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering
Type-safe multithreading in cyclone

Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
A Toolkit for Constructing Type- and Constraint-Based Program Analyses

TIC '98 Proceedings of the Second International Workshop on Types in Compilation
Hybrid dynamic data race detection

Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming
RacerX: effective, static detection of race conditions and deadlocks

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Finding bugs is easy

OOPSLA '04 Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
Computability classes for enforcement mechanisms

ACM Transactions on Programming Languages and Systems (TOPLAS)

LOCKSMITH: context-sensitive correlation analysis for race detection

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
LOCKSMITH: Practical static race detection for C

ACM Transactions on Programming Languages and Systems (TOPLAS)
Dynamic inference of static types for ruby

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Detection of deadlock potentials in multithreaded programs

IBM Journal of Research and Development
Practical static race detection for Java parallel loops

Proceedings of the 2013 International Symposium on Software Testing and Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present FINDLOCKS, an approach for automatically proving the absence of data races in multi-threaded Java programs, using a combination of dynamic and static analysis. The program in question is instrumented so that when executed it will gather information about locking relationships. This information is then used to automatically generate annotations needed to type check the program using the Race-Free Java type system. Programs that type check are sure to be free from races. We call this technique dynamic annotation inference. We describe the design and implementation of our approach, and our experience applying the tool to a variety of Java programs. We have found that when using a reasonably comprehensive test suite, which is easy for small programs but harder for larger ones, the approach generates useful annotations.