Distributed Algorithm Verification
Distributed Algorithm Verification is the formal process of rigorously proving correctness properties of distributed algorithms with respect to their intended behavior under concurrency, communication delays, and failures in decentralized systems.
130
Publications
11.1K
Citations
252
Authors
148
Institutions
Publications per year
2017–2026
21
Parents
130
Gerard J. Holzmann · IEEE Transactions on Software Engineering · 1997 · 3.8K citations
Hierarchical correctness proofs for distributed algorithms
Nancy Lynch, Mark R. Tuttle · 1987 · 767 citations · Full text
1–5 of 130
252
9
h-index
8
h-index
6
h-index
6
h-index
6
h-index
1–5 of 252
148
Massachusetts Institute of Technology
Cambridge, United States
12 h-index
22 publications
2.8K citations

Centre National de la Recherche Scientifique
Paris, France
11 h-index
14 publications
848 citations
Université Paris Cité
Paris, France
9 h-index
11 publications
683 citations

Weizmann Institute of Science
Rehovot, Israel
6 h-index
11 publications
1K citations

TU Wien
Vienna, Austria
6 h-index
21 publications
774 citations
Technion – Israel Institute of Technology
Haifa, Israel
6 h-index
8 publications
487 citations
The University of Texas at Austin
Austin, United States
5 h-index
9 publications
2.6K citations
Institut de Recherche en Informatique et Systèmes Aléatoires
Rennes, France
5 h-index
7 publications
187 citations
1–8 of 148
7 publications · 644 citations
7
h-index
TSE · 5 publications · 4.9K citations
5
h-index
4 publications · 72 citations
4
h-index
3 publications · 68 citations
3
h-index
Repository · 3 publications · 44 citations
3
h-index
1–5