Modular verification of a non-blocking stack

DOI10.1145/1190216.1190261zbMATH Open1295.68092OpenAlexW4253344502MaRDI QIDQ3189809FDOQ3189809

Authors: Matthew J. Parkinson, Richard Bornat, Peter W. O'Hearn 

Publication date: 12 September 2014

Published in: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1190216.1190261

Recommendations

• Modular termination verification for non-blocking concurrency
• Reasoning about nonblocking concurrency
• Modular reasoning about separation of concurrent data structures
• Modular verification for shared-variable concurrent programs
• Proving that non-blocking algorithms don't block

zbMATH Keywords

concurrencyseparation logicnon-blocking

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cited In (12)

• Quantitative reasoning for proving lock-freedom
• Nonblocking Algorithms and Backward Simulation
• Formal verification of a lock-free stack with hazard pointers
• Modular termination verification for non-blocking concurrency
• A perspective on specifying and verifying concurrent modules
• Order out of chaos: proving linearizability using local views
• Tasks in modular proofs of concurrent algorithms
• Inter-process buffers in separation logic with rely-guarantee
• Reasoning about nonblocking concurrency
• Fine-grained concurrency with separation logic
• Tasks in modular proofs of concurrent algorithms
• Thread modularity at many levels: a pearl in compositional verification

This page was built for publication: Modular verification of a non-blocking stack

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