메뉴 건너뛰기




Volumn 3580, Issue , 2005, Pages 1349-1361

The Polyranking Principle

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FUNCTIONS; POLYNOMIALS;

EID: 26444584975     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_109     Document Type: Conference Paper
Times cited : (100)

References (14)
  • 1
    • 33745796859 scopus 로고    scopus 로고
    • Linear ranking with reachability
    • BRADLEY, A. R., MANNA, Z., AND SIPMA, H. B. Linear ranking with reachability. In CAV (2005).
    • (2005) CAV
    • Bradley, A.R.1    Manna, Z.2    Sipma, H.B.3
  • 2
    • 24144470050 scopus 로고    scopus 로고
    • 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
  • 4
    • 84903179505 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 8
    • 17644377623 scopus 로고    scopus 로고
    • 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
  • 10
    • 84944228451 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • Termination of linear programs
    • TIWARl, A. Termination of linear programs. In CAV (2004), pp. 70-82.
    • (2004) CAV , pp. 70-82
    • Tiwarl, A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.