Tasks in modular proofs of concurrent algorithms

Proving the correctness of distributed or concurrent algorithms is a complex process. Errors in the reasoning are hard to find, calling for computer-checked proof systems like Coq or TLA+. To use these tools, sequential specifications of base objects are required to build modular proofs by compositi...

Full description

Saved in:

Bibliographic Details
Published in:	Information and computation Vol. 292; no. Selected papers from SSS’2019, the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems; p. 105040
Main Authors:	Castañeda, Armando, Hurault, Aurélie, Quéinnec, Philippe, Roy, Matthieu
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.06.2023 Elsevier
Subjects:	Computer Science Concurrent algorithms Distributed tasks Distributed, Parallel, and Cluster Computing Formal methods Linearizability Renaming Splitter TLA+ Verification Splitter Concurrent algorithms TLA+ Distributed tasks Linearizability Verification Formal methods Renaming TLA
ISSN:	0890-5401, 1090-2651
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!