We design a deadlock-free semantics for a concurrent, functional and imperative programming language where locks are implicitly and univocally associated with pointers. The semantics avoids unsafe states by relying on a static analysis of programs, by means of a type and effect system. The system uses singleton reference types, which allow us to have a precise information about the pointers that are anticipated to be locked by an expression. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Boudol, G. (2009). A deadlock-free semantics for shared memory concurrency. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5684 LNCS, pp. 140–154). https://doi.org/10.1007/978-3-642-03466-4_9
Mendeley helps you to discover research relevant for your work.