Proving termination of context-sensitive rewriting with MU-TERM

DOI10.1016/J.ENTCS.2007.05.041MaRDI QIDQ2867963zbMATH OpenOpenAlexFDO

Authors Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas, José Iborra

Publication date 20 December 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2007.05.041

zbMATH Keywords

context-sensitive rewritingprogram analysisterm rewritingtermination

Mathematics Subject Classification ID

Theory of programming languages (68N15) Grammars and rewriting systems (68Q42)

Recommendations

• Proving termination of context-sensitive rewriting by transformation
• Termination of context-sensitive rewriting
• Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
• scientific article; zbMATH DE number 2090080
• Context-sensitive dependency pairs

Cites work

• Context-Sensitive Dependency Pairs
• Context-sensitive rewriting strategies
• Foundations of Software Science and Computation Structures
• scientific article; zbMATH DE number 1729952 (Why is no real title available?)
• scientific article; zbMATH DE number 1332639 (Why is no real title available?)
• scientific article; zbMATH DE number 2090310 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• Logic for Programming, Artificial Intelligence, and Reasoning
• On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
• Orderings for term-rewriting systems
• Polynomials over the reals in proofs of termination : from theory to practice
• Proving termination of context-sensitive rewriting by transformation
• Solving Partial Order Constraints for LPO Termination
• Term Rewriting and Applications
• Termination of context-sensitive rewriting
• Termination of string rewriting proved automatically
• Termination of term rewriting using dependency pairs
• Transformation techniques for context-sensitive rewrite systems

Cited in

(17)

• MU-TERM
• A context-based approach to proving termination of evaluation
• Using context-sensitive rewriting for proving innermost termination of rewriting
• Proving termination properties with \textsc{mu-term}
• Usable Rules for Context-Sensitive Rewrite Systems
• Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
• Multi-completion with termination tools
• Termination of context-sensitive rewriting
• scientific article; zbMATH DE number 2090080 (Why is no real title available?)
• scientific article; zbMATH DE number 2090310 (Why is no real title available?)
• Operational termination of membership equational programs: the order-sorted way
• Foundations of Software Science and Computation Structures
• Termination of Narrowing Using Dependency Pairs
• Characterizing and proving operational termination of deterministic conditional term rewriting systems
• Proving termination of context-sensitive rewriting by transformation
• Termination of just/fair computations in term rewriting
• Context-sensitive dependency pairs

Describes a project that uses

Uses Software

• AProVE
• Tyrolean

This page was built for publication: Proving termination of context-sensitive rewriting with MU-TERM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867963)