Compositional Verification
Compositional Verification is a formal verification methodology within the broader field of Concurrency Verification that decomposes the verification of a complex system into modular proofs of its individual components, thereby enabling scalable and reusable correctness arguments through the hierarchical composition of system properties.
478
Publications
20.6K
Citations
1.1K
Authors
407
Institutions
Publications per year
2017–2026
74
478
Luca de Alfaro, Thomas A. Henzinger · 2001 · 1.2K citations
Hierarchical correctness proofs for distributed algorithms
Nancy Lynch, Mark R. Tuttle · 1987 · 767 citations · Full text
E. M. Clarke, David E. Long, Kenneth L. McMillan · 2003 · 471 citations
1–5 of 478
1.1K
8
h-index
8
h-index
8
h-index
7
h-index
6
h-index
1–5 of 1.1K
407
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
14 h-index
40 publications
733 citations
Carnegie Mellon University
Pittsburgh, United States
14 h-index
34 publications
4.3K citations

Centre National de la Recherche Scientifique
Paris, France
13 h-index
37 publications
881 citations
University of California, Berkeley
Berkeley, United States
13 h-index
42 publications
3.9K citations
Max Planck Institute for Software Systems
Saarbrücken, Germany
11 h-index
30 publications
1.3K citations

Imperial College London
London, United Kingdom
10 h-index
22 publications
1.3K citations

Aarhus University
Aarhus, Denmark
9 h-index
18 publications
487 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
9 h-index
12 publications
334 citations
1–8 of 407
PACMPL · 14 publications · 443 citations
13
h-index
ENTCS · 15 publications · 286 citations
12
h-index
11 publications · 382 citations
11
h-index
11 publications · 1.3K citations
10
h-index
TSE · 9 publications · 801 citations
9
h-index
1–5