-
1
-
-
0346205107
-
Unification theory
-
chapter 8, Elsevier Science
-
F. Baader and W. Snyder. Unification theory. In Handbook of Automated Reasoning, volume I, chapter 8, pages 445-532. Elsevier Science, 2001.
-
(2001)
Handbook of Automated Reasoning
, vol.1
, pp. 445-532
-
-
Baader, F.1
Snyder, W.2
-
2
-
-
0030681155
-
Types as abstract interpretations
-
P. Cousot. Types as abstract interpretations. In POPL, pages 316-331, 1997.
-
(1997)
POPL
, pp. 316-331
-
-
Cousot, P.1
-
3
-
-
85050550846
-
Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
-
P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th Annual ACM Symposium on POPL, pages 234-252, 1977.
-
(1977)
4th Annual ACM Symposium on POPL
, pp. 234-252
-
-
Cousot, P.1
Cousot, R.2
-
4
-
-
0032672388
-
Refining model checking by abstract interpretation
-
P. Cousot and R. Cousot. Refining model checking by abstract interpretation. Automated Software Engineering, 6(1):69-95, 1999.
-
(1999)
Automated Software Engineering
, vol.6
, Issue.1
, pp. 69-95
-
-
Cousot, P.1
Cousot, R.2
-
5
-
-
36348962347
-
Program verification as inference in belief networks. Technical Report MSR-TR-2006-98, Microsoft Research
-
July
-
S. Gulwani and N. Jojic. Program verification as inference in belief networks. Technical Report MSR-TR-2006-98, Microsoft Research, July 2006.
-
(2006)
-
-
Gulwani, S.1
Jojic, N.2
-
6
-
-
35048901016
-
A polynomial-time algorithm for global value numbering
-
Static Analysis Symposium, of
-
S. Gulwani and G. C Necula. A polynomial-time algorithm for global value numbering. In Static Analysis Symposium, volume 3148 of LNCS, pages 212-227, 2004.
-
(2004)
LNCS
, vol.3148
, pp. 212-227
-
-
Gulwani, S.1
Necula, G.C.2
-
7
-
-
33745200176
-
Assertion checking over combined abstraction of linear arithmetic & uninterpreted functions
-
ESOP, of, Mar
-
S. Gulwani and A. Tiwari. Assertion checking over combined abstraction of linear arithmetic & uninterpreted functions. In ESOP, volume 3924 of LNCS, Mar. 2006.
-
(2006)
LNCS
, vol.3924
-
-
Gulwani, S.1
Tiwari, A.2
-
8
-
-
36348972797
-
Assertion checking unified. (MSR-TR-2006-99)
-
July
-
S. Gulwani and A. Tiwari. Assertion checking unified. (MSR-TR-2006-99), July 2006.
-
(2006)
-
-
Gulwani, S.1
Tiwari, A.2
-
9
-
-
33746065301
-
Combining abstract interpreters
-
June
-
S. Gulwani and A. Tiwari. Combining abstract interpreters. In PLDI, June 2006.
-
(2006)
PLDI
-
-
Gulwani, S.1
Tiwari, A.2
-
10
-
-
84968503882
-
The principal type-scheme of an object in combinatory logic
-
R. Hindley. The principal type-scheme of an object in combinatory logic. Trans. Amer. Math. Soc., 146:29-60, 1969.
-
(1969)
Trans. Amer. Math. Soc
, vol.146
, pp. 29-60
-
-
Hindley, R.1
-
11
-
-
0016881880
-
Affine relationships among variables of a program
-
Springer
-
M. Karr. Affine relationships among variables of a program. In Acta Informática, pages 133-151. Springer, 1976.
-
(1976)
Acta Informática
, pp. 133-151
-
-
Karr, M.1
-
12
-
-
24144432958
-
Checking Herbrand equalities and beyond
-
VMCAI, of, Springer, Jan
-
M. Müller-Olm, O. Rüthing, and H. Seidl. Checking Herbrand equalities and beyond. In VMCAI, volume 3385 of LNCS, pages 79-96. Springer, Jan. 2005.
-
(2005)
LNCS
, vol.3385
, pp. 79-96
-
-
Müller-Olm, M.1
Rüthing, O.2
Seidl, H.3
|