메뉴 건너뛰기




Volumn 4144 LNCS, Issue , 2006, Pages 372-385

Termination of integer linear programs

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; EIGENVALUES AND EIGENFUNCTIONS; INTEGER PROGRAMMING; LINEAR SYSTEMS; MATRIX ALGEBRA;

EID: 33749837789     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817963_34     Document Type: Conference Paper
Times cited : (130)

References (13)
  • 4
    • 26444594461 scopus 로고    scopus 로고
    • Linear ranking with reachability
    • [BMP05a]
    • [BMP05a] A.R. Bradley, Z. Manna, H.B. Simpa, Linear ranking with reachability, in CAV 2005, pp. 491-504, 2005.
    • (2005) CAV 2005 , pp. 491-504
    • Bradley, A.R.1    Manna, Z.2    Simpa, H.B.3
  • 5
    • 27244439995 scopus 로고    scopus 로고
    • Termination analysis of integer linear loops
    • [BMP05b]
    • [BMP05b] A.R. Bradley, Z. Manna, H.B. Simpa, Termination analysis of integer linear loops, in CONCUR 2005, pp. 488-502, 2005.
    • (2005) CONCUR 2005 , pp. 488-502
    • Bradley, A.R.1    Manna, Z.2    Simpa, H.B.3
  • 6
    • 35248824647 scopus 로고    scopus 로고
    • Linear invariant generation using non-linear constraint solving
    • [CSS03], CAV 2003
    • [CSS03] M.A. Colón, S. Sankaranarayanan, H.B. Simpa, Linear invariant generation using non-linear constraint solving, in CAV 2003, LNCS 2725, pp. 420-432, 2003.
    • (2003) LNCS , vol.2725 , pp. 420-432
    • Colón, M.A.1    Sankaranarayanan, S.2    Simpa, H.B.3
  • 8
    • 0000541791 scopus 로고
    • Computing in algebraic extensions
    • [Loos83], B. Buchberger, G.E. Collins et al. eds., Springer-Verlag
    • [Loos83] R. Loos, Computing in Algebraic Extensions, in B. Buchberger, G.E. Collins et al. eds., Computer Algebra: Symbolic and Algebraic Computation, 2nd ed., Springer-Verlag, pp. 173-188, 1983.
    • (1983) Computer Algebra: Symbolic and Algebraic Computation, 2nd Ed. , pp. 173-188
    • Loos, R.1
  • 10
    • 84944228451 scopus 로고    scopus 로고
    • A complete method for synthesis of linear ranking functions
    • [PR04], B. Steffen and G. Levi (Eds.): VMCAI 2004
    • [PR04] A. Podelski, A. Rybalchenko, A complete method for synthesis of linear ranking functions, in B. Steffen and G. Levi (Eds.): VMCAI 2004, LNCS 2937, pp. 239-251, 2004.
    • (2004) LNCS , vol.2937 , pp. 239-251
    • Podelski, A.1    Rybalchenko, A.2
  • 12
    • 35048871890 scopus 로고    scopus 로고
    • Termination of linear programs
    • [Tiw04], R. Alur and D.A. Peled (Eds.): CAV 2004
    • [Tiw04] A. Tiwari, Termination of linear programs, in R. Alur and D.A. Peled (Eds.): CAV 2004, LNCS 3114, pp. 70-82, 2004.
    • (2004) LNCS , vol.3114 , pp. 70-82
    • Tiwari, A.1


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