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

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of ACM on programming languages Vol. 8; no. POPL; pp. 2456 - 2484
Main Authors:	Jayanti, Prasad, Jayanti, Siddhartha, Yavuz, Ugur Y., Hernandez, Lizzie
Format:	Journal Article
Language:	English
Published:	New York, NY, USA ACM 02.01.2024
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!