Types for deterministic concurrency

Authors:
Alexander Aiken;George Necula;Tachio Terauchi
Affiliations:
University of California, Berkeley;University of California, Berkeley;University of California, Berkeley
Venue:
Types for deterministic concurrency
Year:
2006

Citing 0
Cited 1

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This thesis describes a method for ensuring partial determinism in concurrent programs. The idea is presented in two settings: sequential processes communicating via channels and shared references and functional programming with references.