Modular verification of a non-blocking stack
From MaRDI portal
Publication:3189809
DOI10.1145/1190216.1190261zbMath1295.68092MaRDI QIDQ3189809
Richard Bornat, Matthew J. Parkinson, 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
68W40: Analysis of algorithms
68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)
03B70: Logic in computer science
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
Unnamed Item, Inter-process buffers in separation logic with rely-guarantee, Fine-grained concurrency with separation logic, Formal Verification of a Lock-Free Stack with Hazard Pointers