A concurrent program logic with a future and history

Verifying fine-grained optimistic concurrent programs remains an open problem. Modern program logics provide abstraction mechanisms and compositional reasoning principles to deal with the inherent complexity. However, their use is mostly confined to pencil-and-paper or mechanized proofs. We devise a...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of ACM on programming languages Vol. 6; no. OOPSLA2; pp. 1378 - 1407
Main Authors:	Meyer, Roland, Wies, Thomas, Wolff, Sebastian
Format:	Journal Article
Language:	English
Published:	New York, NY, USA ACM 31.10.2022
Subjects:	Automated reasoning Hoare logic Program verification Programming logic Separation logic Theory of computation Linearizability Harris Set Non-blocking Data Structures
ISSN:	2475-1421, 2475-1421
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!