메뉴 건너뛰기




Volumn 5160 LNCS, Issue , 2008, Pages 425-439

Endomorphisms for non-trivial non-linear loop invariant generation

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; COMPUTER AIDED LANGUAGE TRANSLATION; JAVA PROGRAMMING LANGUAGE;

EID: 51849086291     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85762-4_29     Document Type: Conference Paper
Times cited : (8)

References (20)
  • 1
    • 84903166484 scopus 로고    scopus 로고
    • A technique for invariant generation
    • Margaria, T, Yi, W, eds, TACAS 2001, Springer, Heidelberg
    • Tiwari, A., Rueß, H., Saïdi, H., Shankar, N.: A technique for invariant generation. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 113-127. Springer, Heidelberg (2001)
    • (2001) LNCS , vol.2031 , pp. 113-127
    • Tiwari, A.1    Rueß, H.2    Saïdi, H.3    Shankar, N.4
  • 7
    • 33751098295 scopus 로고    scopus 로고
    • Automatic generation of polynomial invariants of bounded degree using abstract interpretation
    • Rodríguez-Carbonell, E., Kapur, D.: Automatic generation of polynomial invariants of bounded degree using abstract interpretation. Sci. Comput. Program. 64(1), 54-75 (2007)
    • (2007) Sci. Comput. Program , vol.64 , Issue.1 , pp. 54-75
    • Rodríguez-Carbonell, E.1    Kapur, D.2
  • 8
    • 84957363964 scopus 로고    scopus 로고
    • Bensalem, S., Lakhnech, Y., Saidi, H.: Powerful techniques for the automatic generation of invariants. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, 1102, pp. 323-335. Springer, Heidelberg (1996)
    • Bensalem, S., Lakhnech, Y., Saidi, H.: Powerful techniques for the automatic generation of invariants. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 323-335. Springer, Heidelberg (1996)
  • 10
    • 44649153644 scopus 로고    scopus 로고
    • Reasoning algebraically about p-solvable loops
    • Ramakrishnan, C.R, Rehof, J, eds, TACAS 2008, Springer, Heidelberg
    • Kovacs, L.: Reasoning algebraically about p-solvable loops. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 249-264. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.4963 , pp. 249-264
    • Kovacs, L.1
  • 11
    • 24144488686 scopus 로고    scopus 로고
    • Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming
    • Cousot, R, ed, VMCAI 2005, Springer, Heidelberg
    • Cousot, P.: Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 1-24. Springer, Heidelberg (2005)
    • (2005) LNCS , vol.3385 , pp. 1-24
    • Cousot, P.1
  • 12
    • 34047097816 scopus 로고    scopus 로고
    • Generating all polynomial invariants in simple loops
    • Rodríguez-Carbonell, E., Kapur, D.: Generating all polynomial invariants in simple loops. J. Symb. Comput. 42(4), 443-476 (2007)
    • (2007) J. Symb. Comput , vol.42 , Issue.4 , pp. 443-476
    • Rodríguez-Carbonell, E.1    Kapur, D.2
  • 14
    • 0003896282 scopus 로고
    • Quantifier Elimination for the Elementary Theory of RealClosed Fields by Cylindrical Algebraic Decomposition
    • Springer, Heidelberg
    • Collins, G.E.: Quantifier Elimination for the Elementary Theory of RealClosed Fields by Cylindrical Algebraic Decomposition. LNCS. Springer, Heidelberg (1975)
    • (1975) LNCS
    • Collins, G.E.1
  • 15
    • 0000911801 scopus 로고
    • Abstract interpretation and application to logic programs
    • Cousot, P., Cousot, R.: Abstract interpretation and application to logic programs. Journal of Logic Programming 13(2-3), 103-179 (1992)
    • (1992) Journal of Logic Programming , vol.13 , Issue.2-3 , pp. 103-179
    • Cousot, P.1    Cousot, R.2
  • 16
    • 84958740430 scopus 로고    scopus 로고
    • Müller-Olm, M., Seidl, H.: Polynomial constants are decidable. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, 2477, pp. 4-19. Springer, Heidelberg (2002)
    • Müller-Olm, M., Seidl, H.: Polynomial constants are decidable. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol. 2477, pp. 4-19. Springer, Heidelberg (2002)
  • 17
    • 47249100565 scopus 로고    scopus 로고
    • Finding polynomial invariants for imperative loops in the theorema system
    • Workshop, pp
    • Kovacs, L., Jebelean, T.: Finding polynomial invariants for imperative loops in the theorema system. In: Proc.of Verify 2006 Workshop, pp. 52-67 (2006)
    • (2006) Proc.of Verify , pp. 52-67
    • Kovacs, L.1    Jebelean, T.2
  • 20
    • 51849088898 scopus 로고    scopus 로고
    • Lang, S.: Algebra. Springer, Heidelberg (January 2002)
    • Lang, S.: Algebra. Springer, Heidelberg (January 2002)


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