Proving termination of context-sensitive rewriting by transformation
type: Item
instance of: scholarly article
title: Proving termination of context-sensitive rewriting by transformation
zbMATH Open document ID: 1171.68514
author: Salvador Lucas
published in: Information and Computation
publication date: 2007-01-22T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 5117648
zbMATH Keywords: context-sensitive rewriting
zbMATH Keywords: program analysis
zbMATH Keywords: term rewriting
zbMATH Keywords: termination
zbMATH Keywords: transformations
cites work: OBJ3
cites work: Q4428288
cites work: Correct and complete (positive) strategy annotations for \textsf{OBJ}
cites work: Termination of term rewriting using dependency pairs
cites work: Q4809069
cites work: Specification and proof in membership equational logic
cites work: Q4449180
cites work: Maude: specification and programming in rewriting logic
cites work: Q4447224
cites work: A note on simplification orderings
cites work: Orderings for term-rewriting systems
cites work: Termination of rewriting
cites work: Q4385532
cites work: Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
cites work: Relaxing monotonicity for innermost termination
cites work: Q4938610
cites work: Modular termination proofs for rewriting using dependency pairs
cites work: Transformation techniques for context-sensitive rewrite systems
cites work: Logic for Programming, Artificial Intelligence, and Reasoning
cites work: Generalized sufficient conditions for modular termination of rewriting
cites work: Rewriting Techniques and Applications
cites work: Artificial Intelligence and Symbolic Computation
cites work: Term Rewriting and Applications
cites work: Transfinite reductions in orthogonal term rewriting systems
cites work: Q4259973
cites work: Q5581665
cites work: Q4818829
cites work: Q4259966
cites work: Termination of Rewriting with Strategy Annotations
cites work: Context-sensitive rewriting strategies
cites work: Lazy rewriting and context-sensitive rewriting
cites work: Rewriting techniques and applications. 15th international conference, RTA 2004, Aachen, Germany, June 3--5, 2004. Proceedings.
cites work: Foundations of Software Science and Computation Structures
cites work: Polynomials over the reals in proofs of termination : from theory to practice
cites work: Recursive functions of symbolic expressions and their computation by machine, Part I
cites work: Simple termination is difficult
cites work: Q2783416
cites work: Q4846999
cites work: Q4799892
cites work: Modular and incremental automated termination proofs
cites work: Termination of context-sensitive rewriting
describes a project that uses: OBJ3
describes a project that uses: Matchbox
describes a project that uses: Tyrolean
describes a project that uses: Maude
describes a project that uses: Haskell
describes a project that uses: AProVE
describes a project that uses: CiME
describes a project that uses: MU-TERM
MaRDI profile type: Publication
full work available at URL: j.ic.2006.07.001
OpenAlex ID: W2093571287
DOI: 10.1016/J.IC.2006.07.001
Recommended article: Using context-sensitive rewriting for proving innermost termination of rewriting
Recommended article: Methods for proving termination of rewriting-based programming languages by transformation
Recommended article: Proving termination of context-sensitive rewriting with MU-TERM
Recommended article: Q4818829
Recommended article: Q4202962
Recommended article: Foundations of Software Science and Computation Structures
Recommended article: Q4808754
Recommended article: Q2778874
Recommended article: Proving termination of (conditional) rewrite systems. A semantic approach
Recommended article: Proving Termination of Rewrite Systems Using Bounds
description: scientific article; zbMATH DE number 5117648