Partial-order Reduction
Partial-Order Reduction is a state-space reduction technique in model checking that exploits the independence of concurrent transitions to avoid redundant exploration of equivalent interleavings, thereby reducing computational complexity while preserving relevant behavioral properties of concurrent systems.
231
Publications
10.9K
Citations
467
Authors
225
Institutions
Publications per year
2017–2026
45
231
Willem Visser, Klaus Havelund, Guillaume Brat et al. · Automated Software Engineering · 2003 · 1.4K citations
Dynamic partial-order reduction for model checking software
Cormac Flanagan, Patrice Godefroid · 2005 · 641 citations · Full text
Willem Visser, Klaus Havelund, Guillaume Brat et al. · 2000 · 338 citations
Juwei Shi, Yunjie Qiu, Umar Farooq Minhas et al. · Proceedings of the VLDB Endowment · 2015 · 220 citations
1–5 of 231
467
7
h-index
7
h-index
6
h-index
5
h-index
4
h-index
1–5 of 467
225
Eindhoven University of Technology
Eindhoven, The Netherlands
11 h-index
23 publications
943 citations
University of Utah
Salt Lake City, United States
9 h-index
25 publications
912 citations
University of Oxford
Oxford, United Kingdom
8 h-index
16 publications
435 citations

Ames Research Center
Mountain View, United States
8 h-index
18 publications
8.3K citations

Uppsala University
Uppsala, Sweden
7 h-index
20 publications
1.5K citations
Max Planck Institute for Software Systems
Saarbrücken, Germany
6 h-index
13 publications
447 citations

Masaryk University
Brno, Czechia
6 h-index
15 publications
426 citations

Polytechnique Montréal
Montreal, Canada
5 h-index
9 publications
215 citations
1–8 of 225
ENTCS · 7 publications · 255 citations
7
h-index
PACMPL · 7 publications · 320 citations
7
h-index
6 publications · 312 citations
6
h-index
6 publications · 282 citations
6
h-index
Repository · 6 publications · 117 citations
6
h-index
1–5