Innermost termination of rewrite systems by labeling

DOI10.1016/J.ENTCS.2008.03.050MaRDI QIDQ2873673zbMATH OpenOpenAlexFDO

Authors René Thiemann, Aart Middeldorp

Publication date 24 January 2014

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.2008.03.050

zbMATH Keywords

innermost terminationpredictive labelingsemantic labelingterm rewritingtermination

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Termination of rewrite systems by elementary interpretations
• scientific article; zbMATH DE number 1948501
• scientific article; zbMATH DE number 794240
• scientific article; zbMATH DE number 1615229
• Termination of linear bounded term rewriting systems
• The termination hierarchy for term rewriting
• Conditions for confluence of innermost terminating term rewriting systems
• Reachability analysis of innermost rewriting
• Reachability analysis of innermost rewriting
• scientific article; zbMATH DE number 1722711

Cites work

• Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
• scientific article; zbMATH DE number 794240 (Why is no real title available?)
• Mechanizing and improving dependency pairs
• Predictive Labeling
• Predictive Labeling with Dependency Pairs Using SAT
• Termination of term rewriting using dependency pairs
• TPA: Termination Proved Automatically
• Tyrolean termination tool: techniques and features

Cited in

(10)

• scientific article; zbMATH DE number 1670496 (Why is no real title available?)
• Root-Labeling
• Predictive Labeling
• Semantic labelling for proving termination of combinatory reduction systems
• Predictive Labeling with Dependency Pairs Using SAT
• Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
• Transforming termination by self-labelling
• scientific article; zbMATH DE number 794240 (Why is no real title available?)
• Modular and certified semantic labeling and unlabeling
• Search Techniques for Rational Polynomial Orders

Describes a project that uses

Uses Software

• Tyrolean
• TPA

This page was built for publication: Innermost termination of rewrite systems by labeling

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