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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of ACM on programming languages Jg. 6; H. OOPSLA2; S. 1378 - 1407
Hauptverfasser:	Meyer, Roland, Wies, Thomas, Wolff, Sebastian
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY, USA ACM 31.10.2022
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!