B. Gramlich and S. Lucas. Simple termination of context-sensitive rewriting. In Proc. of RULE'02, pages 29-41, ACM Press, New York, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Innermost Termination of Context-Sensitive Rewriting - Giesl, Middeldorp (2002) (3 citations) (Correct)
....than termination [1] it is worthwhile to investigate innermost termination of context sensitive rewriting. An alternative approach to prove termination of OBJ like programs by direct induction proofs is proposed in [8] Termination of CSRSs has been studied in a number of papers (e.g. [3, 7, 9, 11, 15 17, 20, 23]) Apart from a direct semantic characterization [23] and some recent extensions of standard termination methods for term rewriting to context sensitive rewriting [3, 15] all other proposed methods transform CSRSs into ordinary term rewrite systems (TRSs) such that termination of the transformed ....
.... induction proofs is proposed in [8] Termination of CSRSs has been studied in a number of papers (e.g. 3, 7, 9, 11, 15 17, 20, 23] Apart from a direct semantic characterization [23] and some recent extensions of standard termination methods for term rewriting to context sensitive rewriting [3, 15], all other proposed methods transform CSRSs into ordinary term rewrite systems (TRSs) such that termination of the transformed TRS implies termination of the original CSRS (i.e. all these transformations are sound ) Direct approaches to termination analysis of CSRSs and transformational ....
[Article contains additional citation context not shown here]
B. Gramlich and S. Lucas. Simple termination of context-sensitive rewriting. In Proc. 3rd Workshop on Rule-Based Programming, pages 29-41. ACM Press, 2002.
Innermost Termination of Context-Sensitive Rewriting - Giesl, Middeldorp (2002) (3 citations) (Correct)
....All remaining function symbols are called constructors. The if direction even holds without the restriction to elementary strategies [25] of OBJ like programs by direct induction proofs is proposed. Termination of context sensitive rewriting has been studied in a number of papers (e.g. [5, 10, 14, 15, 20, 23, 24, 27, 32]) Apart from a direct semantic characterization [32] and some recent extensions of standard termination methods for term rewriting to context sensitive rewriting [5, 20] all other proposed methods transform context sensitive rewrite systems (CSRSs) into ordinary term rewrite systems (TRSs) such ....
....proposed. Termination of context sensitive rewriting has been studied in a number of papers (e.g. 5, 10, 14, 15, 20, 23, 24, 27, 32] Apart from a direct semantic characterization [32] and some recent extensions of standard termination methods for term rewriting to context sensitive rewriting [5, 20], all other proposed methods transform context sensitive rewrite systems (CSRSs) into ordinary term rewrite systems (TRSs) such that termination of the transformed TRS implies termination of the original CSRS (i.e. all these transformations are sound ) Direct approaches to termination analysis ....
[Article contains additional citation context not shown here]
B. Gramlich and S. Lucas. Simple termination of context-sensitive rewriting. In Proceedings of the 3rd ACM SIGPLAN Workshop on Rule-Based Programming, pages 29-41, 2002.
mu-term: A Tool for Proving Termination of Context-Sensitive.. - Lucas Self-citation (Lucas) (Correct)
No context found.
B. Gramlich and S. Lucas. Simple termination of context-sensitive rewriting. In Proc. of RULE'02, pages 29-41, ACM Press, New York, 2002.
Polynomials for Proving Termination of Context-Sensitive Rewriting - Lucas (2004) Self-citation (Lucas) (Correct)
No context found.
B. Gramlich and S. Lucas. Simple termination of context-sensitive rewriting. In Proc. of RULE'02, pages 29-41, ACM Press, New York, 2002.
Modular & Incremental Automated Termination Proofs - Urbain (2004) (Correct)
No context found.
Gramlich, B. and S. Lucas: 2002, `Simple Termination of Context-Sensitive Rewriting'. In: B. Fischer and E. Visser (eds.): Proc. of 3rd ACM Sigplan Workshop on Rule-Based Programming, RULE'02. Pittsburgh, USA, pp. 29--41.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC