Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

ICTAC
2009
Springer

favoriteEmaildiscussreport

135views Applied Computing» more ICTAC 2009»

A Deadlock-Free Semantics for Shared Memory Concurrency

13 years 11 months ago

A Deadlock-Free Semantics for Shared Memory Concurrency

Download ftp-sop.inria.fr

Abstract. 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 eﬀect 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.

Gérard Boudol

Real-time Traffic

Applied Computing | Avoids Unsafe States | Deadlock-free Semantics | ICTAC 2009 | Imperative Programming Language |

claim paper

Related Content

» Variables as Resource for SharedMemory Programs Semantics and Soundness

» Concurrent Separation Logic for Pipelined Parallelization

» WOMM A Weak Operational Memory Model

» A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs

» Concurrent ConstraintBased Memory Machines A Framework for Java Memory Models

» Towards typetheoretic semantics for transactional concurrency

» Enabling Concurrent Multithreaded MPI Communication on Multicore Petascale Systems

» Mechanized Verification with Sharing

» The semantics of progress in lockbased transactional memory

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	ICTAC
Authors	Gérard Boudol

Comments (0)