Observation-based concurrent program logic for relaxed memory consistency models
DOI10.1007/978-3-319-47958-3_4zbMATH Open1483.68066OpenAlexW2529658871MaRDI QIDQ3179280FDOQ3179280
Authors: Tatsuya Abe, Toshiyuki Maeda 
Publication date: 21 December 2016
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-47958-3_4
Recommendations
observationrelaxed memory consistency modelconcurrent program logicindependent reads independent writesrely/guarantee method
Logic in computer science (03B70) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cites Work
- An axiomatic basis for computer programming
- Title not available (Why is that?)
- Concurrent Kleene algebra and its foundations
- The Rely-Guarantee method for verifying shared variable concurrent programs
- Owicki-Gries reasoning for weak memory models
- Relaxed memory models
- Title not available (Why is that?)
- On rely-guarantee reasoning
- Parameterized Memory Models and Concurrent Separation Logic
- Observation-based concurrent program logic for relaxed memory consistency models
Cited In (6)
- Concurrent Library Correctness on the TSO Memory Model
- Local Data Race Freedom with Non-multi-copy Atomicity
- Observation-based concurrent program logic for relaxed memory consistency models
- Title not available (Why is that?)
- Studying Operational Models of Relaxed Concurrency
- Title not available (Why is that?)
Uses Software
This page was built for publication: Observation-based concurrent program logic for relaxed memory consistency models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179280)
