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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Proceedings of ACM on programming languages Ročník 8; číslo POPL; s. 2456 - 2484
Hlavní autori:	Jayanti, Prasad, Jayanti, Siddhartha, Yavuz, Ugur Y., Hernandez, Lizzie
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY, USA ACM 02.01.2024
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	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 linearizable (resp. strong linearizable); and completeness means that any linearizable (resp. strong linearizable) implementation can be proved so using our method. We demonstrate the simplicity and power of our method by producing proofs of linearizability for the Herlihy-Wing queue and Jayanti's single-scanner snapshot, as well as a proof of strong linearizability of the Jayanti-Tarjan union-find object. All three of these proofs are machine-verified by TLAPS (the TLA+ Proof System).
ISSN:	2475-1421 2475-1421
DOI:	10.1145/3632924