메뉴 건너뛰기
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumn 3018, Issue , 2004, Pages 108-109
Proving termination with adornments
Author keywords

[No Author keywords available]
Indexed keywords

COMPUTER SCIENCE; COMPUTERS;
EID: 35048899289     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25938-1_10     Document Type: Article
Times cited : (2)
References (8)
  • 1
    • 84958746416 scopus 로고    scopus 로고
    • Reuse of results in termination analysis of typed logic programs
    • M. V. Hermenegildo and G. Puebla, editors, Static Analysis, 9th International Symposium, Springer Verlag
    • M. Bruynooghe, M. Codish, S. Genaim, and W. Vanhoof. Reuse of results in termination analysis of typed logic programs. In M. V. Hermenegildo and G. Puebla, editors, Static Analysis, 9th International Symposium, volume 2477 of Lecture Notes in Computer Science, pages 477-492. Springer Verlag, 2002.
    • (2002) Lecture Notes in Computer Science , vol.2477 , pp. 477-492
    • Bruynooghe, M.1    Codish, M.2    Genaim, S.3    Vanhoof, W.4
  • 2
    • 0002319293 scopus 로고
    • A general criterion for avoiding infinite unfolding during partial deduction
    • M. Bruynooghe, D. De Schreye, and B. Martens. A general criterion for avoiding infinite unfolding during partial deduction. New Generation Computing, 11(1):47-79, 1992.
    • (1992) New Generation Computing , vol.11 , Issue.1 , pp. 47-79
    • Bruynooghe, M.1    De Schreye, D.2    Martens, B.3
  • 3
    • 0004353042 scopus 로고
    • Topics in termination
    • C. Kirchner, editor, Rewriting Techniques and Applications, 5th International Conference, Springer Verlag
    • N. Dershowitz and C. Hoot. Topics in termination. In C. Kirchner, editor, Rewriting Techniques and Applications, 5th International Conference, volume 690 of Lecture Notes in Computer Science, pages 198-212. Springer Verlag, 1993.
    • (1993) Lecture Notes in Computer Science , vol.690 , pp. 198-212
    • Dershowitz, N.1    Hoot, C.2
  • 5
    • 84947926919 scopus 로고    scopus 로고
    • Preserving termination of tabled logic programs while unfolding
    • th International Workshop on Logic Program Synthesis and Transformation, Springer Verlag
    • th International Workshop on Logic Program Synthesis and Transformation, volume 1463 of Lecture Notes in Computer Science, pages 189-205. Springer Verlag, 1998.
    • (1998) Lecture Notes in Computer Science , vol.1463 , pp. 189-205
    • Leuschel, M.1    Martens, B.2    Sagonas, K.3
  • 6
    • 0027706084 scopus 로고
    • Mixtus: An automatic partial evaluator for full Prolog
    • D. Sahlin. Mixtus: An automatic partial evaluator for full Prolog. New Generation Computing, 12(1):7-51, 1993.
    • (1993) New Generation Computing , vol.12 , Issue.1 , pp. 7-51
    • Sahlin, D.1
  • 7
    • 84937394174 scopus 로고    scopus 로고
    • Inference of termination conditions for numerical loops in Prolog
    • R. Nieuwenhuis and A. Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning, 8th International Conferencerence, Proceedings, Springer Verlag
    • A. Serebrenik and D. De Schreye. Inference of termination conditions for numerical loops in Prolog. In R. Nieuwenhuis and A. Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning, 8th International Conferencerence, Proceedings, volume 2250 of Lecture Notes in Computer Science, pages 654-668. Springer Verlag, 2001.
    • (2001) Lecture Notes in Computer Science , vol.2250 , pp. 654-668
    • Serebrenik, A.1    De Schreye, D.2
  • 8
    • 0012753387 scopus 로고
    • Multiple specialization using minimal-function graph semantics
    • W. Winsborough. Multiple specialization using minimal-function graph semantics. Journal of Logic Programming, 13(2/3):259-290, 1992.
    • (1992) Journal of Logic Programming , vol.13 , Issue.2-3 , pp. 259-290
    • Winsborough, W.1

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