-
1
-
-
84903151157
-
Boolean and Cartesian abstraction for model checking C programs
-
T. Margaria and W. Yi, editors, TACAS. Springer
-
T. Ball, A. Podelski, and S. K. Rajamani, Boolean and Cartesian abstraction for model checking C programs. In T. Margaria and W. Yi, editors, TACAS, volume 2031 of LNCS, pages 268-283. Springer. 2001.
-
(2001)
LNCS
, vol.2031
, pp. 268-283
-
-
Ball, T.1
Podelski, A.2
Rajamani, S.K.3
-
2
-
-
0036039066
-
The SLAM project: Debugging system software via static analysis
-
T. Ball and S. K. Rajamani. The SLAM project: debugging system software via static analysis. In POPL, pages 1-3, 2002.
-
(2002)
POPL
, pp. 1-3
-
-
Ball, T.1
Rajamani, S.K.2
-
3
-
-
0038601527
-
Modular verification of software components in C
-
IEEE Computer Society
-
S. Chaki, E. M. Clarke, A. Groce, S. Jha, and H. Veith. Modular verification of software components in C. In ICSE, pages 385-395. IEEE Computer Society, 2003.
-
(2003)
ICSE
, pp. 385-395
-
-
Chaki, S.1
Clarke, E.M.2
Groce, A.3
Jha, S.4
Veith, H.5
-
4
-
-
24644505403
-
SATABS: SAT-based predicate abstraction for ANSI-C
-
TACAS. Springer Verlag
-
E. Clarke, D. Kroening, N. Sharygina, and K. Yorav. SATABS: SAT-based predicate abstraction for ANSI-C. In TACAS, volume 3440 of LNCS, pages 570-574. Springer Verlag, 2005.
-
(2005)
LNCS
, vol.3440
, pp. 570-574
-
-
Clarke, E.1
Kroening, D.2
Sharygina, N.3
Yorav, K.4
-
5
-
-
0000978928
-
Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
-
W. Craig. Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. J. Symbolic Logic, 22(3):269-285, 1957.
-
(1957)
J. Symbolic Logic
, vol.22
, Issue.3
, pp. 269-285
-
-
Craig, W.1
-
6
-
-
2442623463
-
Abstractions from proofs
-
T. A. Henzinger, R. Jhala, R. Majumdar, and K. L. McMillan. Abstractions from proofs. In POPL, pages 232-244, 2004.
-
(2004)
POPL
, pp. 232-244
-
-
Henzinger, T.A.1
Jhala, R.2
Majumdar, R.3
McMillan, K.L.4
-
7
-
-
0036041563
-
Lazy abstraction
-
T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In POPL, pages 58-70, 2002.
-
(2002)
POPL
, pp. 58-70
-
-
Henzinger, T.A.1
Jhala, R.2
Majumdar, R.3
Sutre, G.4
-
8
-
-
26444541620
-
Interpolant-based transition relation approximation
-
K. Etessami and S. K. Rajamani, editors, CAV. Springer
-
R. Jhala and K. L. McMillan. Interpolant-based transition relation approximation. In K. Etessami and S. K. Rajamani, editors, CAV, volume 3576 of LNCS, pages 39-51. Springer, 2005.
-
(2005)
LNCS
, vol.3576
, pp. 39-51
-
-
Jhala, R.1
McMillan, K.L.2
-
9
-
-
33745777418
-
A practical and complete approach to predicate refinement
-
H. Hermanns and J. Palsberg, editors, TACAS. Springer
-
R. Jhala and K. L. McMillan. A practical and complete approach to predicate refinement. In H. Hermanns and J. Palsberg, editors, TACAS, volume 3920 of LNCS, pages 459-473. Springer, 2006.
-
(2006)
LNCS
, vol.3920
, pp. 459-473
-
-
Jhala, R.1
McMillan, K.L.2
-
10
-
-
33745162025
-
Interpolation and SAT-based model checking
-
K. L. McMillan. Interpolation and SAT-based model checking. In CAV, pages 1-13, 2003.
-
(2003)
CAV
, pp. 1-13
-
-
McMillan, K.L.1
-
11
-
-
27644576055
-
An interpolating theorem prover
-
Kenneth L. McMillan. An interpolating theorem prover. Theor. Comput. Sci., 345(1):101-121, 2005.
-
(2005)
Theor. Comput. Sci.
, vol.345
, Issue.1
, pp. 101-121
-
-
McMillan, K.L.1
-
12
-
-
84947441305
-
Construction of abstract state graphs with PVS
-
H. Saïdi and S. Graf. Construction of abstract state graphs with PVS. In CAV, pages 72-83, 1997.
-
(1997)
CAV
, pp. 72-83
-
-
Saïdi, H.1
Graf, S.2
|