Counterexample-Guided Abstraction Refinement is a verification method that iteratively refines an abstract model of a system by analyzing spurious counterexamples to progressively eliminate infeasible transitions until either a valid proof of correctness is obtained or a genuine counterexample is confirmed.
50
Publications
3.2K
Citations
113
Authors
56
Institutions
Publications per year
2017–2026
11
Publications
50
Counterexample-guided abstraction refinement for symbolic model checking
Edmund M. Clarke, Orna Grümberg, Somesh Jha et al. · Journal of the ACM · 2003 · 991 citations
Race checking by context inference
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar · 2004 · 187 citations
1–5 of 50
Authors
113
- HY
4
h-index
- MH
4
h-index
- EM
4
h-index
- RM
3
h-index
- RJ
3
h-index
1–5 of 113
Institutions
56
Carnegie Mellon University
Pittsburgh, United States
7 h-index
20 publications
2.9K citations
University of Oxford
Oxford, United Kingdom
5 h-index
10 publications
356 citations
University of Basel
Basel, Switzerland
5 h-index
9 publications
280 citations
UtopiaCompression (United States)
Los Angeles, United States
3 h-index
3 publications
228 citations
Georgia Institute of Technology
Atlanta, United States
3 h-index
8 publications
377 citations
Berkeley College
New York, United States
3 h-index
5 publications
440 citations
Synopsys (United States)
Mountain View, United States
3 h-index
5 publications
129 citations
University of California, Berkeley
Berkeley, United States
3 h-index
5 publications
440 citations
1–8 of 56
Venues
- Proceedings of the International Conference on Automated Planning and Scheduling
4 publications · 117 citations
4
h-index
- ACM SIGPLAN Notices
4 publications · 177 citations
4
h-index
- IEEE Transactions on Software Engineering
TSE · 2 publications · 63 citations
2
h-index
- Lecture notes in computer science
LNCS · Book series · 1 publications · 71 citations
1
h-index
- Logical Methods in Computer Science
LMCS · 1 publications · 20 citations
1
h-index
1–5