-
2
-
-
24144470050
-
Termination of polynomial programs
-
BRADLEY, A. R., MANNA, Z., AND SIPMA, H.B. Termination of polynomial programs. In VMCAI (2005), pp. 113-129.
-
(2005)
VMCAI
, pp. 113-129
-
-
Bradley, A.R.1
Manna, Z.2
Sipma, H.B.3
-
3
-
-
26444505104
-
One lop at a time
-
CODISH, M., GENAIM, S., BRUYNOOGHE, M., GALLAGHER, J., AND VANHOOF, W. One lop at a time. In WST (2003).
-
(2003)
WST
-
-
Codish, M.1
Genaim, S.2
Bruynooghe, M.3
Gallagher, J.4
Vanhoof, W.5
-
4
-
-
84903179505
-
Synthesis of linear ranking functions
-
COLON, M., AND SIPMA, H. B. Synthesis of linear ranking functions. In TACAS (2001), pp. 67-81.
-
(2001)
TACAS
, pp. 67-81
-
-
Colon, M.1
Sipma, H.B.2
-
5
-
-
84937566009
-
Practical methods for proving program termination
-
COLON, M.A., AND SIPMA, H. B. Practical methods for proving program termination. In CAV (2002), pp. 442-454.
-
(2002)
CAV
, pp. 442-454
-
-
Colon, M.A.1
Sipma, H.B.2
-
6
-
-
24144488686
-
Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming
-
COUSOT, P. Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming. In VMCAI (2005), pp. 1-24.
-
(2005)
VMCAI
, pp. 1-24
-
-
Cousot, P.1
-
7
-
-
0034952407
-
A general framework for automatic termination analysis of logic programs
-
DERSHOWITZ, N., LINDENSTRAUSS, N., SAGIV, Y., AND SEREBRENIK, A. A general framework for automatic termination analysis of logic programs. Applicable Algebra in Engineering, Communication and Computing 12 (2001), 117-156.
-
(2001)
Applicable Algebra in Engineering, Communication and Computing
, vol.12
, pp. 117-156
-
-
Dershowitz, N.1
Lindenstrauss, N.2
Sagiv, Y.3
Serebrenik, A.4
-
8
-
-
17644377623
-
The size-change principle for program termination
-
LEE, C.S., JONES, N. D., AND BEN-AMRAM, A.M. The size-change principle for program termination. In POPL (2001), pp. 81-92.
-
(2001)
POPL
, pp. 81-92
-
-
Lee, C.S.1
Jones, N.D.2
Ben-Amram, A.M.3
-
9
-
-
84958967738
-
Visual abstractions for temporal verification
-
MANNA, Z., BROWNE, A., SIPMA, H. B., AND URIBE, T. E. Visual abstractions for temporal verification. In Algebraic Methodology and Software Technology (1998), pp. 28-41.
-
(1998)
Algebraic Methodology and Software Technology
, pp. 28-41
-
-
Manna, Z.1
Browne, A.2
Sipma, H.B.3
Uribe, T.E.4
-
10
-
-
84944228451
-
A complete method for the synthesis of linear ranking functions
-
PODELSKI, A., AND RYBALCHENKO, A. A complete method for the synthesis of linear ranking functions. In VMCAI (2004), pp. 239-251.
-
(2004)
VMCAI
, pp. 239-251
-
-
Podelski, A.1
Rybalchenko, A.2
-
11
-
-
4544225317
-
Transition invariants
-
PODELSKI, A., AND RYBALCHENKO, A. Transition invariants. In LICS (2004), pp. 32-41.
-
(2004)
LICS
, pp. 32-41
-
-
Podelski, A.1
Rybalchenko, A.2
-
13
-
-
0342923286
-
Deductive model checking
-
SIPMA, H. B., URIBE, T. E., AND MANNA, Z. Deductive model checking. In CAV (1996), pp. 209-219.
-
(1996)
CAV
, pp. 209-219
-
-
Sipma, H.B.1
Uribe, T.E.2
Manna, Z.3
-
14
-
-
35048871890
-
Termination of linear programs
-
TIWARl, A. Termination of linear programs. In CAV (2004), pp. 70-82.
-
(2004)
CAV
, pp. 70-82
-
-
Tiwarl, A.1
|