Interleaving Analysis is a formal method in concurrent system verification that distinguishes itself by systematically examining all possible orderings of memory or computational operations across threads to identify unintended behaviors arising from non-deterministic execution sequences.
85
Publications
4K
Citations
194
Authors
75
Institutions
Publications per year
2017–2026
14
Publications
85
Dynamic partial-order reduction for model checking software
Cormac Flanagan, Patrice Godefroid · 2005 · 641 citations · Full text
Francesco Sorrentino, Azadeh Farzan, P. Madhusudan · 2010 · 125 citations
1–5 of 85
Authors
194
- SQ
5
h-index
- SL
5
h-index
- AF
4
h-index
- CF
4
h-index
- MKMichalis Kokologiannakis
Max Planck Institute for Software Systems, Germany
3 publications · 143 citations
3
h-index
1–5 of 194
Institutions
75
Microsoft (United States)
Redmond, United States
10 h-index
12 publications
727 citations
University of Illinois Urbana-Champaign
Urbana, United States
8 h-index
20 publications
1.1K citations
University of California, Santa Cruz
Santa Cruz, United States
6 h-index
9 publications
1K citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
5 h-index
9 publications
296 citations
Tel Aviv University
Tel Aviv, Israel
4 h-index
4 publications
232 citations
University of Toronto
Toronto, Canada
4 h-index
6 publications
276 citations
University of Wisconsin–Madison
Madison, United States
4 h-index
11 publications
706 citations
Technicolor (France)
Paris, France
3 h-index
6 publications
228 citations
1–8 of 75
Venues
- ACM SIGPLAN Notices
5 publications · 257 citations
5
h-index
- Proceedings of the ACM on Programming Languages
PACMPL · 3 publications · 139 citations
3
h-index
- Electronic Notes in Theoretical Computer Science
ENTCS · 2 publications · 71 citations
2
h-index
- Acta Informatica
2 publications · 48 citations
2
h-index
- DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
Repository · 2 publications · 54 citations
2
h-index
1–5