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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Information and computation Ročník 292; číslo Selected papers from SSS’2019, the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems; s. 105040
Hlavní autori:	Castañeda, Armando, Hurault, Aurélie, Quéinnec, Philippe, Roy, Matthieu
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.06.2023 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!