-
1
-
-
84903151157
-
Boolean and cartesian abstraction for model checking C programs
-
Margaria, T, Yi, W, eds, ETAPS 2001 and TACAS 2001, Springer, Heidelberg
-
Ball, T., Podelski, A., Rajamani, S.K.: Boolean and cartesian abstraction for model checking C programs. In: Margaria, T., Yi, W. (eds.) ETAPS 2001 and TACAS 2001. LNCS, vol. 2031, pp. 268-283. Springer, Heidelberg (2001)
-
(2001)
LNCS
, vol.2031
, pp. 268-283
-
-
Ball, T.1
Podelski, A.2
Rajamani, S.K.3
-
2
-
-
0344994320
-
Labelled Deduction
-
Kluwer, Dordrecht
-
Basin, D., D'Agostino, M., Gabbay, D.M., Matthews, S., Viganò, L.: Labelled Deduction. Applied Logic Series, vol. 17. Kluwer, Dordrecht (2000)
-
(2000)
Applied Logic Series
, vol.17
-
-
Basin, D.1
D'Agostino, M.2
Gabbay, D.M.3
Matthews, S.4
Viganò, L.5
-
3
-
-
13244267160
-
Towards a unified model of search in theorem-proving: Subgoal-reduction strategies
-
Bonacina, M.P.: Towards a unified model of search in theorem-proving: subgoal-reduction strategies. J. Symb. Comput. 39(2), 209-255 (2005)
-
(2005)
J. Symb. Comput
, vol.39
, Issue.2
, pp. 209-255
-
-
Bonacina, M.P.1
-
4
-
-
85050550846
-
-
Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In: POPL, pp. 238-252 (1977)
-
Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In: POPL, pp. 238-252 (1977)
-
-
-
-
5
-
-
84947441305
-
-
Graf, S., Saïdi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, 1254, pp. 72-83. Springer, Heidelberg (1997)
-
Graf, S., Saïdi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 72-83. Springer, Heidelberg (1997)
-
-
-
-
6
-
-
0009461011
-
Theorem-proving by resolution as a basis for question-answering systems
-
Green, C.: Theorem-proving by resolution as a basis for question-answering systems. Machine Intelligence 4, 183-205 (1969)
-
(1969)
Machine Intelligence
, vol.4
, pp. 183-205
-
-
Green, C.1
-
7
-
-
9544254748
-
Tableaux and related methods
-
Robinson, A, Voronkov, A, eds, ch. 6, Elsevier, North-Holland
-
Hähnle, R.: Tableaux and related methods. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 6, vol. 1, pp. 103-177. Elsevier, North-Holland (2001)
-
(2001)
Handbook of Automated Reasoning
, vol.1
, pp. 103-177
-
-
Hähnle, R.1
-
8
-
-
26444434724
-
-
Lahiri, S., Ball, T., Cook, B.: Predicate abstraction via symbolic decision procedures. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, 3576, pp. 24-38. Springer, Heidelberg (2005)
-
Lahiri, S., Ball, T., Cook, B.: Predicate abstraction via symbolic decision procedures. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 24-38. Springer, Heidelberg (2005)
-
-
-
-
9
-
-
26944445043
-
Simulating reachability using first-order logic with applications to verification of linked data structures
-
Nieuwenhuis, R, ed, Automated Deduction, CADE-20, Springer, Heidelberg
-
Lev-Ami, T., Immerman, N., Reps, T.W., Sagiv, M., Srivastava, S., Yorsh, G.: Simulating reachability using first-order logic with applications to verification of linked data structures. In: Nieuwenhuis, R. (ed.) Automated Deduction - CADE-20. LNCS (LNAI), vol. 3632, pp. 99-115. Springer, Heidelberg (2005)
-
(2005)
LNCS (LNAI
, vol.3632
, pp. 99-115
-
-
Lev-Ami, T.1
Immerman, N.2
Reps, T.W.3
Sagiv, M.4
Srivastava, S.5
Yorsh, G.6
-
10
-
-
84906086021
-
-
Lev-Ami, T., Sagiv, M.: TVLA: A system for implementing static analyses. In: Palsberg, J. (ed.) SAS 2000. LNCS, 1824, Springer, Heidelberg (2000)
-
Lev-Ami, T., Sagiv, M.: TVLA: A system for implementing static analyses. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol. 1824, Springer, Heidelberg (2000)
-
-
-
-
11
-
-
84858358992
-
-
Available at
-
Lev-Ami, T., Weidenbach, C., Reps, T., Sagiv, M.: Experimental version of SPASS for multiple conjectures (2007) Available at http://www.cs.tau.ac.il/ ~tla/SPASS
-
(2007)
Experimental version of SPASS for multiple conjectures
-
-
Lev-Ami, T.1
Weidenbach, C.2
Reps, T.3
Sagiv, M.4
-
12
-
-
26444527350
-
-
Loginov, A., Reps, T., Sagiv, M.: Abstraction refinement via inductive learning. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, 3576, pp. 519-533. Springer, Heidelberg (2005)
-
Loginov, A., Reps, T., Sagiv, M.: Abstraction refinement via inductive learning. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 519-533. Springer, Heidelberg (2005)
-
-
-
-
13
-
-
84980169139
-
-
Nelson, C.G., Oppen, D.C.: A simplifier based on efficient decision algorithms. In: POPL, pp. 141-150 (1978)
-
Nelson, C.G., Oppen, D.C.: A simplifier based on efficient decision algorithms. In: POPL, pp. 141-150 (1978)
-
-
-
-
14
-
-
33745456148
-
-
Nieuwenhuis, R., Oliveras, A.: Decision procedures for SAT, SAT modulo theories and beyond. The BarcelogicTools. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), 3835, pp. 23-46. Springer, Heidelberg (2005)
-
Nieuwenhuis, R., Oliveras, A.: Decision procedures for SAT, SAT modulo theories and beyond. The BarcelogicTools. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 23-46. Springer, Heidelberg (2005)
-
-
-
-
15
-
-
84880861989
-
Splitting without backtracking
-
Riazanov, A., Voronkov, A.: Splitting without backtracking. In: IJCAI, pp. 611-617 (2001)
-
(2001)
IJCAI
, pp. 611-617
-
-
Riazanov, A.1
Voronkov, A.2
-
16
-
-
0036327027
-
The design and implementation of VAMPIRE
-
Riazanov, A., Voronkov, A.: The design and implementation of VAMPIRE. AI Communications 15(2-3), 91-110 (2002)
-
(2002)
AI Communications
, vol.15
, Issue.2-3
, pp. 91-110
-
-
Riazanov, A.1
Voronkov, A.2
-
17
-
-
0039488517
-
Parametric shape analysis via 3-valued logic
-
Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. TOPLAS 217-298 (2002)
-
(2002)
TOPLAS
, vol.217-298
-
-
Sagiv, M.1
Reps, T.2
Wilhelm, R.3
-
18
-
-
0036323940
-
-
Schulz, S.: E - A Brainiac Theorem Prover. Journal of AI Communications 15(2/3), 111-126 (2002)
-
Schulz, S.: E - A Brainiac Theorem Prover. Journal of AI Communications 15(2/3), 111-126 (2002)
-
-
-
-
19
-
-
35048882561
-
-
Personal communication
-
Voronkov, A.: Personal communication (2007)
-
(2007)
-
-
Voronkov, A.1
-
20
-
-
15544363314
-
Combining superposition, sorts and splitting
-
Robinson, A, Voronkov, A, eds, ch. 27, Elsevier, North-Holland
-
Weidenbach, C.: Combining superposition, sorts and splitting. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 27, vol. 2, pp. 1965-2012. Elsevier, North-Holland (2001)
-
(2001)
Handbook of Automated Reasoning
, vol.2
, pp. 1965-2012
-
-
Weidenbach, C.1
-
21
-
-
70350690461
-
-
Weidenbach, C, Brahm, U, Hillenbrand, T, Keen, E, Theobald, C, Topic, D, SPASS version 2.0. In: Voronkov, A, ed, Automated Deduction, CADE-18. LNCS (LNAI, 2392, pp. 275-279. Springer, Heidelberg 2002
-
Weidenbach, C., Brahm, U., Hillenbrand, T., Keen, E., Theobald, C., Topic, D.: SPASS version 2.0. In: Voronkov, A. (ed.) Automated Deduction - CADE-18. LNCS (LNAI), vol. 2392, pp. 275-279. Springer, Heidelberg (2002)
-
-
-
-
22
-
-
0034846235
-
-
DAC, pp
-
Whittemore, J., Kim, J., Sakallah, K.A.: SATIRE: A new incremental satisfiability engine. In: DAC, pp. 542-545 (2001)
-
(2001)
SATIRE: A new incremental satisfiability engine
, pp. 542-545
-
-
Whittemore, J.1
Kim, J.2
Sakallah, K.A.3
-
23
-
-
35048869728
-
Strategy selection for automated theorem proving
-
Giunchiglia, F, ed, AIMSA 1998, Springer, Heidelberg
-
Wolf, A.: Strategy selection for automated theorem proving. In: Giunchiglia, F. (ed.) AIMSA 1998. LNCS (LNAI), vol. 1480, pp. 452-465. Springer, Heidelberg (1998)
-
(1998)
LNCS (LNAI
, vol.1480
, pp. 452-465
-
-
Wolf, A.1
-
24
-
-
0001457667
-
Efficiency and completeness of the set of support strategy in theorem proving
-
Wos, L., Robinson, G.A., Carson, D.F.: Efficiency and completeness of the set of support strategy in theorem proving. J. ACM 12(4), 536-541 (1965)
-
(1965)
J. ACM
, vol.12
, Issue.4
, pp. 536-541
-
-
Wos, L.1
Robinson, G.A.2
Carson, D.F.3
-
25
-
-
35048814529
-
Symbolically computing most-precise abstract operations for shape analysis
-
Jensen, K, Podelski, A, eds, TACAS 2004, Springer, Heidelberg
-
Yorsh, G., Reps, T., Sagiv, M.: Symbolically computing most-precise abstract operations for shape analysis. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 530-545. Springer, Heidelberg (2004)
-
(2004)
LNCS
, vol.2988
, pp. 530-545
-
-
Yorsh, G.1
Reps, T.2
Sagiv, M.3
|