-
1
-
-
84896694224
-
Boolean and cartesian abstraction for model checking C programs
-
T. Ball, A. Podelski, and S. Rajamani. "Boolean and Cartesian Abstraction for Model Checking C Programs". STTT, 5(1):49-58, 2003.
-
(2003)
STTT
, vol.5
, Issue.1
, pp. 49-58
-
-
Ball, T.1
Podelski, A.2
Rajamani, S.3
-
2
-
-
35048835830
-
CVC Lite: A new implementation of the cooperating validity checker
-
CAV'04
-
C. Barrett and S. Berezin. "CVC Lite: A New Implementation of the Cooperating Validity Checker". In CAV'04, volume 3114 of LNCS, pages 515-518, 2004.
-
(2004)
LNCS
, vol.3114
, pp. 515-518
-
-
Barrett, C.1
Berezin, S.2
-
3
-
-
20344381487
-
Multi-valued symbolic model-checking
-
M. Chechik, B. Devereux, S. Easterbrook, and A. Gurfinkel. "Multi-Valued Symbolic Model-Checking". ACM TOSEM, 12(4):1-38, 2003.
-
(2003)
ACM TOSEM
, vol.12
, Issue.4
, pp. 1-38
-
-
Chechik, M.1
Devereux, B.2
Easterbrook, S.3
Gurfinkel, A.4
-
4
-
-
84937547766
-
χChck: A multi-valued model-checker
-
CAV'02
-
M. Chechik, B. Devereux, and A. Gurfinkel. "χChck: A Multi-Valued Model-Checker". In CAV'02, volume 2404 of LNCS, pages 505-509, 2002.
-
(2002)
LNCS
, vol.2404
, pp. 505-509
-
-
Chechik, M.1
Devereux, B.2
Gurfinkel, A.3
-
5
-
-
24644481589
-
A framework for counterexample generation and exploration
-
FASE'05
-
M. Chechik and A. Gurfinkel. "A Framework for Counterexample Generation and Exploration". In FASE'05, volume 3442 of LNCS, pages 217-233, 2005.
-
(2005)
LNCS
, vol.3442
, pp. 217-233
-
-
Chechik, M.1
Gurfinkel, A.2
-
6
-
-
4243189286
-
Counterexample-guided abstraction refinement for symbolic model checking
-
E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. " Counterexample-Guided Abstraction Refinement for Symbolic Model Checking". JACM, 50(5):752-794, 2003.
-
(2003)
JACM
, vol.50
, Issue.5
, pp. 752-794
-
-
Clarke, E.1
Grumberg, O.2
Jha, S.3
Lu, Y.4
Veith, H.5
-
7
-
-
0031102750
-
Abstract interpolation of reactive systems
-
D. Dams, R. Gerth, and O. Grumberg. "Abstract Interpolation of Reactive Systems". ACM TOPLAS, 2(19):253-291, 1997.
-
(1997)
ACM TOPLAS
, vol.2
, Issue.19
, pp. 253-291
-
-
Dams, D.1
Gerth, R.2
Grumberg, O.3
-
8
-
-
4544379156
-
The existence of finite abstractions for branching time model checking
-
D. Dams and K.S. Namjoshi, "The Existence of Finite Abstractions for Branching Time Model Checking". In LICS'04, pages 335-344, 2004.
-
(2004)
LICS'04
, pp. 335-344
-
-
Dams, D.1
Namjoshi, K.S.2
-
9
-
-
84944065857
-
Abstraction-based model checking using modal transition systems
-
CONCUR'01
-
P. Godefroid, M. Huth, and R. Jagadeesan. "Abstraction-based Model Checking using Modal Transition Systems". In CONCUR'01, volume 2154 of LNCS, pages 426-440, 2001.
-
(2001)
LNCS
, vol.2154
, pp. 426-440
-
-
Godefroid, P.1
Huth, M.2
Jagadeesan, R.3
-
10
-
-
35048896284
-
Proof-like counterexamples
-
TACAS'03
-
A. Gurfinkel and M. Chechik. "Proof-like Counterexamples". In TACAS'03, volume 2619 of LNCS, pages 160-175, 2003.
-
(2003)
LNCS
, vol.2619
, pp. 160-175
-
-
Gurfinkel, A.1
Chechik, M.2
-
11
-
-
33745782549
-
Why waste a perfectly good abstraction?
-
TACAS'06
-
A. Gurfinkel and M. Chechik. "Why Waste a Perfectly Good Abstraction?". In TACAS'06, volume 3920 of LNCS, pages 212-226, 2006.
-
(2006)
LNCS
, vol.3920
, pp. 212-226
-
-
Gurfinkel, A.1
Chechik, M.2
-
12
-
-
0036041563
-
Lazy abstraction
-
T. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. "Lazy Abstraction". In POPL'02, pages 58-70, 2002.
-
(2002)
POPL'02
, pp. 58-70
-
-
Henzinger, T.1
Jhala, R.2
Majumdar, R.3
Sutre, G.4
-
13
-
-
84959039613
-
CIL: Intermediate language and tools for analsysis and transformation of C programs
-
CC'02
-
G. Necula, S. McPeak, S. Rahul, and W. Weimer. ''CIL: Intermediate Language and Tools for Analsysis and Transformation of C Programs". In CC'02, volume 2304 of LNCS, pages 213-228, 2002.
-
(2002)
LNCS
, vol.2304
, pp. 213-228
-
-
Necula, G.1
McPeak, S.2
Rahul, S.3
Weimer, W.4
-
14
-
-
26444557984
-
Concrete model checking with abstract matching and refinement
-
CAV'05
-
C. Pasareanu, R. Pelanek, and W. Visser. "Concrete Model Checking with Abstract Matching and Refinement". In CAV'05, volume 3576 of LNCS, pages 52-66, 2005.
-
(2005)
LNCS
, vol.3576
, pp. 52-66
-
-
Pasareanu, C.1
Pelanek, R.2
Visser, W.3
-
15
-
-
35248892961
-
A game-based framework for ctl counter-examples and 3-valued abstraction-refinement
-
CAV'03
-
S. Shoham and O. Grumberg. "A Game-Based Framework for CTL Counter-Examples and 3-Valued Abstraction-Refinement". In CAV'03, volume 2725 of LNCS, pages 275-287, 2003.
-
(2003)
LNCS
, vol.2725
, pp. 275-287
-
-
Shoham, S.1
Grumberg, O.2
-
16
-
-
35048842322
-
Monotonic abstraction-refinement for CTL
-
TACAS'04
-
S. Shoham and O. Grumberg. "Monotonic Abstraction-Refinement for CTL", In TACAS'04, volume 2988 of LNCS, pages 546-560, 2004.
-
(2004)
LNCS
, vol.2988
, pp. 546-560
-
-
Shoham, S.1
Grumberg, O.2
|