12981 search results - page 38 / 2597 » Model Checking and Abstraction |
101
click to vote
CORR
2008
Springer
15 years 21 days ago
2008
Springer
Abstract. This paper presents a novel technique for counterexample generation in probabilistic model checking of Markov chains and Markov Decision Processes. (Finite) paths in coun...
92
Voted
CAV
2003
Springer
15 years 5 months ago
2003
Springer
ion and BDDs Complement SAT-based BMC in DiVer Aarti Gupta1, Malay Ganai1 , Chao Wang2, Zijiang Yang1, Pranav Ashar1 1 NEC Laboratories America, Princeton, NJ, U.S.A. 2 University ...
93
Voted
ICCAD
2007
IEEE
15 years 9 months ago
2007
IEEE
ion Chao Wang NEC Laboratories America Hyondeuk Kim University of Colorado Aarti Gupta NEC Laboratories America Variable hiding and predicate abstraction are two popular abstracti...
108
Voted
CAV
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Regular model checking is a form of symbolic model checking technique for systems whose states can be represented as finite words over a finite alphabet, where regular ...
208
Voted
POPL
2005
ACM
16 years 28 days ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...