Abstract local reasoning for concurrent libraries: mind the gap
DOI10.1016/J.ENTCS.2014.10.009zbMATH Open1337.68069OpenAlexW2074635178WikidataQ113317846 ScholiaQ113317846MaRDI QIDQ283756FDOQ283756
Authors: Philippa Gardner, Azalea Raad, Mark Wheelhouse, Adam Wright 
Publication date: 13 May 2016
Full work available at URL: https://doi.org/10.1016/j.entcs.2014.10.009
Recommendations
- Programming Languages and Systems
- Locally abstract, globally concrete semantics of concurrent programming languages
- Resources, concurrency, and local reasoning
- Elucidating concurrent algorithms via layers of abstraction and reification
- CONCUR 2004 - Concurrency Theory
- Local Reasoning for Storable Locks and Threads
- Reverse exchange for concurrency and local reasoning
Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Abstract local reasoning for concurrent libraries: mind the gap
- Variables as resource in separation logic
- Fictional separation logic
- Views, compositional reasoning for concurrent programs
- Unifying refinement and Hoare-style reasoning in a logic for higher-order concurrency
- Permission accounting in separation logic
- Context logic and tree update
- Impredicative concurrent abstract predicates
- Local Reasoning for the POSIX File System
- Blaming the client: on data refinement in the presence of pointers
- Resources, concurrency, and local reasoning
Cited In (4)
This page was built for publication: Abstract local reasoning for concurrent libraries: mind the gap
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283756)
