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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information and computation Jg. 292; H. Selected papers from SSS’2019, the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems; S. 105040
Hauptverfasser:	Castañeda, Armando, Hurault, Aurélie, Quéinnec, Philippe, Roy, Matthieu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.06.2023 Elsevier
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!