Efficient data race and deadlock prevention in concurrent object-oriented programs

Authors:
Piotr Nienaltowski
Affiliations:
ETH Zurich, Zurich, Switzerland
Venue:
OOPSLA '04 Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
Year:
2004

Citing 3
Cited 0

Object-oriented software construction (2nd ed.)

Object-oriented software construction (2nd ed.)
Verifying properties of parallel programs: an axiomatic approach

Communications of the ACM
Ownership types for safe programming: preventing data races and deadlocks

OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main goal of this PhD thesis is to propose and implement a methodology for the construction of programs based on the SCOOP model, and for modular reasoning about their correctness and liveness properties. In particular, the set of correctness rules that guarantee the absence of data races will be refined and formalized; an augmented type system will be proposed to enforce these rules at compile time. Furthermore, an efficient methodology for deadlock prevention, avoidance, detection, and resolution will be developed. A working implementation of SCOOP will be provided. It will take into consideration the proposed mechanisms and serve as a basis for further refinements of the model.