Sciweavers

SAS
2004
Springer

Type Inference Against Races

13 years 9 months ago
Type Inference Against Races
Abstract. The race condition checker rccjava uses a formal type system to statically identify potential race conditions in concurrent Java programs, but it requires programmer-supplied type annotations. This paper describes a type inference algorithm for rccjava. Due to the interaction of parameterized classes and dependent types, this type inference problem is NP-complete. This complexity result motivates our new approach to type inference, which is via reduction to propositional satisfiability. This paper describes our type inference algorithm and its performance on programs of up to 30,000 lines of code.
Cormac Flanagan, Stephen N. Freund
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where SAS
Authors Cormac Flanagan, Stephen N. Freund
Comments (0)