Reasoning about Lock Placements

12 years 6 months ago

Download theory.stanford.edu

A lock placement describes, for each heap location, which lock guards the location, and under what circumstances. We formalize methods for reasoning about lock placements, making precise the interactions between the program, the heap structure, and the lock placement.

Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin

Real-time Traffic

Circumstances | ESOP 2012 | Heap Structure | Placements | Programming Languages |

claim paper

Related Content

» Reasoning about SMP in FreeBSD

» Reasoning about Javas Reentrant Locks

» Reasoning about Threads with Bounded Lock Chains

» Reasoning About Threads Communicating via Locks

» Local reasoning about storable locks

» Formal verification of concurrent programs with readwrite locks

» Local Reasoning for Storable Locks and Threads

» On Being Optimistic about RealTime Constraints

» A Hybrid Type System for LockFreedom of Mobile Processes

Post Info
More Details (n/a)

Added	21 Apr 2012
Updated	21 Apr 2012
Type	Journal
Year	2012
Where	ESOP
Authors	Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin C. Rinard, Mooly Sagiv

Comments (0)

Sciweavers

Reasoning about Lock Placements

Circumstances | ESOP 2012 | Heap Structure | Placements | Programming Languages |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers