Bounded Model Checking
Bounded Model Checking is a model checking technique that systematically explores bounded execution paths of a system by translating reachability properties into propositional logic formulas to detect property violations within a specified depth.
327
Publications
12.5K
Citations
650
Authors
273
Institutions
Publications per year
2017–2026
47
327
Symbolic model checking using SAT procedures instead of BDDs
Armin Biere, Alessandro Cimatti, E. M. Clarke et al. · 1999 · 697 citations
Bounded Model Checking Using Satisfiability Solving
Edmund M. Clarke, Armin Biere, Richard Raimi et al. · Formal Methods in System Design · 2001 · 679 citations
The ins and outs of the probabilistic model checker MRMC
Joost-Pieter Katoen, Ivan S. Zapreev, Ernst Moritz Hahn et al. · Performance Evaluation · 2010 · 250 citations
1–5 of 327
650
17
h-index
13
h-index
12
h-index
11
h-index
11
h-index
1–5 of 650
273
Carnegie Mellon University
Pittsburgh, United States
15 h-index
40 publications
4.6K citations

Universidade Federal do Amazonas
Manaus, Brazil
13 h-index
48 publications
1.5K citations
Princeton University
Princeton, United States
13 h-index
44 publications
1.5K citations
Institute of Computer Science
Warsaw, Poland
13 h-index
17 publications
753 citations
University of Southampton
Southampton, United Kingdom
12 h-index
28 publications
1.5K citations
University of Oxford
Oxford, United Kingdom
11 h-index
22 publications
491 citations

University of Freiburg
Freiburg im Breisgau, Germany
10 h-index
35 publications
579 citations
Politecnico di Torino
Turin, Italy
10 h-index
29 publications
635 citations
1–8 of 273
ENTCS · 23 publications · 1.2K citations
17
h-index
7 publications · 152 citations
7
h-index
6 publications · 323 citations
6
h-index
Conference · 6 publications · 131 citations
6
h-index
5 publications · 220 citations
5
h-index
1–5