Local reasoning for storable locks and threads

Alexey Gotsman*, Josh Berdine, Byron Cook, Noam Rinetzky, Mooly Sagiv

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

63 Scopus citations


We present a resource oriented program logic that is able to reason about concurrent heap-manipulating programs with unbounded numbers of dynamically-allocated locks and threads. The logic is inspired by concurrent separation logic, but handles these more realistic concurrency primitives. We demonstrate that the proposed logic allows local reasoning about programs for which there exists a notion of dynamic ownership of heap parts by locks and threads.

Original languageEnglish
Title of host publicationProgramming Languages and Systems - 5th Asian Symposium, APLAS 2007, Proceedings
PublisherSpringer Verlag
Number of pages19
ISBN (Print)9783540766360
StatePublished - 2007
Event5th Asian Symposium on Programming Languages and Systems, APLAS 2007 - Singapore, Singapore
Duration: 29 Nov 20071 Dec 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4807 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference5th Asian Symposium on Programming Languages and Systems, APLAS 2007


Dive into the research topics of 'Local reasoning for storable locks and threads'. Together they form a unique fingerprint.

Cite this