A separation logic for fictional sequential consistency

DOI10.1007/978-3-662-46669-8_30zbMATH Open1335.68068OpenAlexW2403509298MaRDI QIDQ2802463FDOQ2802463

Authors Filip Sieczkowski, Kasper Svendsen, Jean Pichon-Pharabod, Lars Birkedal 

Publication date 26 April 2016

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://www.repository.cam.ac.uk/handle/1810/294681

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70)

Recommendations

• Parameterized Memory Models and Concurrent Separation Logic
• A separation logic for a promising semantics
• Show no weakness: sequentially consistent specifications of TSO libraries
• Tackling real-life relaxed concurrency with FSL++
• A program logic for C11 memory fences

Cited in

(7)

• A program logic for C11 memory fences
• Tackling real-life relaxed concurrency with FSL++
• A separation logic for a promising semantics
• Observation-based concurrent program logic for relaxed memory consistency models
• Taming release-acquire consistency
• Owicki-Gries reasoning for weak memory models
• Show no weakness: sequentially consistent specifications of TSO libraries

This page was built for publication: A separation logic for fictional sequential consistency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802463)