Dynamic deadlock avoidance in systems code using statically inferred effects

Authors:
Prodromos Gerakios;Nikolaos Papaspyrou;Konstantinos Sagonas;Panagiotis Vekris
Affiliations:
National Technical University of Athens, Greece;National Technical University of Athens, Greece;National Technical University of Athens, Greece and Uppsala University, Sweden;National Technical University of Athens, Greece
Venue:
PLOS '11 Proceedings of the 6th Workshop on Programming Languages and Operating Systems
Year:
2011

Citing 9
Cited 0

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
Types for Safe Locking

ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
RacerX: effective, static detection of race conditions and deadlocks

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
RELAY: static race detection on millions of lines of code

Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Type-Based Deadlock-Freedom Verification for Non-Block-Structured Lock Primitives and Mutable References

APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
A Deadlock-Free Semantics for Shared Memory Concurrency

ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Gadara: dynamic deadlock avoidance for multithreaded programs

OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
A type and effect system for deadlock avoidance in low-level languages

Proceedings of the 7th ACM SIGPLAN workshop on Types in language design and implementation
A new type system for deadlock-free processes

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Deadlocks can have devastating effects in systems code. We have developed a type and effect system that provably avoids them and in this paper we present a tool that uses a sound static analysis to instrument multithreaded C programs and then links these programs with a run-time system that avoids possible deadlocks. In contrast to most other purely static tools for deadlock freedom, our tool does not insist that programs adhere to a strict lock acquisition order or use lock primitives in a block-structured way, thus it is appropriate for systems code and OS applications. We also report some very promising benchmark results which show that all possible deadlocks can automatically be avoided with only a small run-time overhead. More importantly, this is done without having to modify the original source program by altering the order of resource acquisition operations or by adding annotations.