A Universal, Sound, and Complete Forward Reasoning Technique for Machine-Verified Proofs of Linearizability

We introduce simple, universal, sound, and complete proof methods for producing machine-verifiable proofs of linearizability and strong linearizability. Universality means that our method works for any object type; soundness means that an algorithm can be proved correct by our method only if it is l...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Proceedings of ACM on programming languages Jg. 8; H. POPL; S. 2456 - 2484
Hauptverfasser:	Jayanti, Prasad, Jayanti, Siddhartha, Yavuz, Ugur Y., Hernandez, Lizzie
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY, USA ACM 02.01.2024
Schlagworte:	Concurrent algorithms Formal methods and theory of security Logic and verification Program verification Security and privacy Theory of computation Linearizability Universal Verification Forward Reasoning Complete
ISSN:	2475-1421, 2475-1421
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!