Local Reasoning for Storable Locks and Threads (original) (raw)
Related papers
Fine grained concurrency with Separation Logic
2011
Dynamic heap-abstraction for open, object-oriented systems with thread classes
be published in SoSYM journal, 2006
Reasoning About Threads Communicating via Locks
Lecture Notes in Computer Science, 2005
Abstract Local Reasoning for Concurrent Libraries: Mind the Gap
Electronic Notes in Theoretical Computer Science, 2014
A semantics for procedure local heaps and its abstractions
ACM SIGPLAN Notices, 2005
TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs
ArXiv, 2019
Automatic Assume/Guarantee Reasoning for Heap-Manipulating Programs: Ongoing Work
Electronic Notes in Theoretical Computer Science, 2005
Permission-Based Separation Logic for Message-Passing Concurrency
Logical Methods in …, 2011
Automatic Assume/Guarantee Reasoning for Heap-Manipulating Programs
Electronic Notes in Theoretical Computer Science, 2005
Structured Specifications for Better Verification of Heap-Manipulating Programs
FM 2011: Formal Methods, 2011
An Abstract Domain for Analyzing Heap-Manipulating Low-Level Software
Lecture Notes in Computer Science
arXiv (Cornell University), 2019
Model and Proof Generation for Heap-Manipulating Programs
Lecture Notes in Computer Science, 2014
Reverse Exchange for Concurrency and Local Reasoning
Lecture Notes in Computer Science, 2012
A language for reasoning about concurrent functional i/o
2004
Thread-Local Semantics and Its Efficient Sequential Abstractions for Race-Free Programs
Static Analysis, 2017
Lock-Free Parallel Garbage Collection
2005
Heap-Bounded Assembly Language
Journal of Automated Reasoning, 2003
Reasoning about Heap Manipulating Programs using Automata Techniques
Modern Applications of Automata Theory, 2012
Safety and liveness in concurrent pointer programs
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2006
Keep Off the Grass: Locking the Right Path for Atomicity
Lecture Notes in Computer Science, 2008
Heap Abstractions for Static Analysis
Reasoning About Inheritance and Unrestricted Reuse in Object-Oriented Concurrent Systems
Lecture Notes in Computer Science, 2016
On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning
2007
Dynamic Checking of Safe Concurrent Memory Access using Shared Ownership
arXiv (Cornell University), 2014
Automatic assume/guarantee reasoning for heap-manupilating programs
Electronic Notes in Theoretical Computer Science, 2005
Specifying concurrent programs in separation logic: morphisms and simulations
Proceedings of the ACM on Programming Languages
Reasoning about Java’s Reentrant Locks
Lecture Notes in Computer Science, 2008
IEEE Micro, 1987
Enabling semantics to improve detection of data races and misuses of lock‐free data structures
Concurrency and Computation: Practice and Experience, 2017
Theoretical Computer …, 2007