메뉴 건너뛰기
Information Processing Letters
Volumn 84, Issue 4, 2002, Pages 207-214
Hierarchical termination revisited
Author keywords

Hierarchical programs; Program correctness; Term rewriting; Termination; Theory of computation
Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; THEOREM PROVING;
EID: 0037202497     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00272-7     Document Type: Article
Times cited : (10)
References (12)
  • 1
    • 0001193616 scopus 로고    scopus 로고
    • Termination of term rewriting using dependency pairs
    • Arts T., Giesl J. Termination of term rewriting using dependency pairs. Theoret. Comput. Sci. 236:2000;133-178.
    • (2000) Theoret. Comput. Sci. , vol.236 , pp. 133-178
    • Arts, T.1    Giesl, J.2
  • 2
    • 84957891736 scopus 로고
    • Hierarchical termination
    • Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems, Springer, Berlin
    • Dershowitz N. Hierarchical termination. Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems. Lecture Notes in Computer Science. 968:1995;89-105 Springer, Berlin.
    • (1995) Lecture Notes in Computer Science , vol.968 , pp. 89-105
    • Dershowitz, N.1
  • 3
    • 84947939145 scopus 로고
    • Modular termination of term rewriting systems revisited
    • Recent Trends in Data Type Specification (Proceedings of the 10th Workshop on Specification of Abstract Data Types), Springer, Berlin
    • Fernández M., Jouannaud J.-P. Modular termination of term rewriting systems revisited. Recent Trends in Data Type Specification (Proceedings of the 10th Workshop on Specification of Abstract Data Types). Lecture Notes in Computer Science. 906:1995;255-272 Springer, Berlin.
    • (1995) Lecture Notes in Computer Science , vol.906 , pp. 255-272
    • Fernández, M.1    Jouannaud, J.-P.2
  • 4
    • 0036657874 scopus 로고    scopus 로고
    • Modular termination proofs for rewriting using dependency pairs
    • to appear
    • Giesl J., Arts T., Ohlebusch E. Modular termination proofs for rewriting using dependency pairs. J. Symbolic Comput. 2002;. to appear.
    • (2002) J. Symbolic Comput.
    • Giesl, J.1    Arts, T.2    Ohlebusch, E.3
  • 5
    • 0000619678 scopus 로고
    • Generalized sufficient conditions for modular termination of rewriting
    • Gramlich B. Generalized sufficient conditions for modular termination of rewriting. Appl. Algebra Engrg. Comm. Comput. 5:1994;131-158.
    • (1994) Appl. Algebra Engrg. Comm. Comput. , vol.5 , pp. 131-158
    • Gramlich, B.1
  • 6
    • 0029368735 scopus 로고
    • Abstract relations between restricted termination and confluence properties of rewrite systems
    • Gramlich B. Abstract relations between restricted termination and confluence properties of rewrite systems. Fund. Inform. 24:1995;3-23.
    • (1995) Fund. Inform. , vol.24 , pp. 3-23
    • Gramlich, B.1
  • 7
    • 4243928889 scopus 로고
    • Simple termination of hierarchical combinations of term rewriting systems
    • Proceedings of the 2nd International Symposium on Theoretical Aspects of Computer Software Springer, Berlin
    • Krishna Rao M.R.K. Simple termination of hierarchical combinations of term rewriting systems. Proceedings of the 2nd International Symposium on Theoretical Aspects of Computer Software. Lecture Notes in Computer Science. 789:1994;203-223 Springer, Berlin.
    • (1994) Lecture Notes in Computer Science , vol.789 , pp. 203-223
    • Krishna Rao, M.R.K.1
  • 8
    • 0029404554 scopus 로고
    • Modular proofs for completeness of hierarchical term rewriting systems
    • Krishna Rao M.R.K. Modular proofs for completeness of hierarchical term rewriting systems. Theoret. Comput. Sci. 151:1995;487-512.
    • (1995) Theoret. Comput. Sci. , vol.151 , pp. 487-512
    • Krishna Rao, M.R.K.1
  • 9
    • 84867766788 scopus 로고    scopus 로고
    • Approximating dependency graphs using tree automata techniques
    • Proceedings of the International Joint Conference on Automated Reasoning Springer, Berlin
    • Middeldorp A. Approximating dependency graphs using tree automata techniques. Proceedings of the International Joint Conference on Automated Reasoning. Lecture Notes in Artificial Intelligence. 2083:2001;593-610 Springer, Berlin.
    • (2001) Lecture Notes in Artificial Intelligence , vol.2083 , pp. 593-610
    • Middeldorp, A.1
  • 10
    • 0010548038 scopus 로고    scopus 로고
    • Forschungsberichte der Technischen Fakultät, Abteilung Informationstechnik, Universität Bielefeld
    • Ohlebusch E. Hierarchical termination revisited. Report 01-05, Forschungsberichte der Technischen Fakultät, Abteilung Informationstechnik. 2001;Universität Bielefeld.
    • (2001) Hierarchical termination revisited. Report 01-05
    • Ohlebusch, E.1
  • 11
    • 84867764644 scopus 로고    scopus 로고
    • Automated incremental termination proofs for hierarchically defined term rewriting systems
    • Proceedings of the International Joint Conference on Automated Reasoning, Springer, Berlin
    • Urbain X. Automated incremental termination proofs for hierarchically defined term rewriting systems. Proceedings of the International Joint Conference on Automated Reasoning. Lecture Notes in Artificial Intelligence. 2083:2001;485-499 Springer, Berlin.
    • (2001) Lecture Notes in Artificial Intelligence , vol.2083 , pp. 485-499
    • Urbain, X.1

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