-
3
-
-
84944319371
-
Symbolic model checking without BDDs
-
TACAS'99
-
A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In TACAS'99, volume 1579 of LNCS, pages 193-207, 1999.
-
(1999)
LNCS
, vol.1579
, pp. 193-207
-
-
Biere, A.1
Cimatti, A.2
Clarke, E.3
Zhu, Y.4
-
5
-
-
84944406286
-
Counterexample-guided abstraction refinement
-
E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In Computer Aided Verification, pages 154-169, 2000.
-
(2000)
Computer Aided Verification
, pp. 154-169
-
-
Clarke, E.M.1
Grumberg, O.2
Jha, S.3
Lu, Y.4
Veith, H.5
-
6
-
-
84937544941
-
SAT based abstraction-refinement using ILP and machine learning techniques
-
E. M. Clarke, A. Gupta, J. Kukula, and O. Strichman. SAT based abstraction-refinement using ILP and machine learning techniques. In Computer-Aided Verification (CAV 2002), pages 265-279, 2002.
-
(2002)
Computer-Aided Verification (CAV 2002)
, pp. 265-279
-
-
Clarke, E.M.1
Gupta, A.2
Kukula, J.3
Strichman, O.4
-
7
-
-
84958760528
-
Benefits of bounded model checking in an industrial setting
-
F. Copty, L. Fix, F. R, E. Giunchiglia, G. Kamhi, A. Tacchella, and M. Y. Vardi. Benefits of bounded model checking in an industrial setting. In Computer Aided Verification (CAV 2001), pages 436-153, 2001.
-
(2001)
Computer Aided Verification (CAV 2001)
, pp. 436-1153
-
-
Copty, F.1
Fix, L.2
R, F.3
Giunchiglia, E.4
Kamhi, G.5
Tacchella, A.6
Vardi, M.Y.7
-
8
-
-
35248818517
-
-
Personal communication
-
S. German. Personal communication.
-
-
-
German, S.1
-
10
-
-
0001973006
-
20 States and Beyond
-
Washington, D.C., IEEE Computer Society Press
-
20 States and Beyond. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pages 1-33, Washington, D.C., 1990. IEEE Computer Society Press.
-
(1990)
Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science
, pp. 1-33
-
-
Burch, J.R.1
Clarke, E.M.2
McMillan, K.L.3
Dill, D.L.4
Hwang, L.J.5
-
14
-
-
0034852165
-
Chaff: Engineering an efficient SAT solver
-
M. W. Moskewicz, C. F. Madigan, Y. Z., L. Z., and S. Malik. Chaff: Engineering an efficient SAT solver. In Design Automation Conference, pages 530-535, 2001.
-
(2001)
Design Automation Conference
, pp. 530-535
-
-
Moskewicz, M.W.1
Madigan, C.F.2
Z, Y.3
Z, L.4
Malik, S.5
-
15
-
-
0022188649
-
Checking that finite state concurrent programs satisfy their linear specification
-
A. P. O. Lichtenstein. Checking that finite state concurrent programs satisfy their linear specification. In POPL '85, pages 97-107, 1985.
-
(1985)
POPL '85
, pp. 97-107
-
-
Lichtenstein, A.P.O.1
-
18
-
-
84947441305
-
Construction of abstract state graphs with PVS
-
O. Grumberg, editor, Haifa, Israel, Springer-Verlag.
-
H. Sädi and S. Graf. Construction of abstract state graphs with PVS. In O. Grumberg, editor, Computer-Aided Verification, CAV '97, volume 1254, pages 72-83, Haifa, Israel, 1997. Springer-Verlag.
-
(1997)
Computer-Aided Verification, CAV '97
, vol.1254
, pp. 72-83
-
-
Sädi, H.1
Graf, S.2
-
21
-
-
0022987223
-
An automata-theoretic approach to automatic program verification
-
M. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Logic in Computer Science (LICS '86), pages 322-331, 1986.
-
(1986)
Logic in Computer Science (LICS '86)
, pp. 322-331
-
-
Vardi, M.1
Wolper, P.2
-
22
-
-
0034841972
-
Formal property verification by abstraction refinement with formal, simulation and hybrid engines
-
D. Wang, P.-H. Ho, J. Long, J. H. Kukula, Y. Zhu, H.-K. T. Ma, and R. Damiano. Formal property verification by abstraction refinement with formal, simulation and hybrid engines. In Design Automation Conference, pages 35-40, 2001.
-
(2001)
Design Automation Conference
, pp. 35-40
-
-
Wang, D.1
Ho, P.-H.2
Long, J.3
Kukula, J.H.4
Zhu, Y.5
Ma, H.-K.T.6
Damiano, R.7
|