From Outermost Termination to Innermost Termination
From MaRDI portal
Publication:3599101
DOI10.1007/978-3-540-95891-8_48zbMath1206.68094OpenAlexW1688466215MaRDI QIDQ3599101
Publication date: 3 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-95891-8_48
Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (3)
Lazy productivity via termination ⋮ Loops under Strategies ⋮ From Outermost to Context-Sensitive Rewriting
Uses Software
Cites Work
- Tyrolean termination tool: techniques and features
- On tree automata that certify termination of left-linear term rewriting systems
- Mechanizing and improving dependency pairs
- Termination of term rewriting using dependency pairs
- Termination of rewriting under strategies
- Deciding Innermost Loops
- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
- Proving Termination by Bounded Increase
- Term Rewriting and All That
- A Transformational Approach to Prove Outermost Termination Automatically
- Frontiers of Combining Systems
- Transformation techniques for context-sensitive rewrite systems
- Logic for Programming, Artificial Intelligence, and Reasoning
- Verification of Erlang processes by dependency pairs
- Termination of logic programs: Transformational methods revisited
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: From Outermost Termination to Innermost Termination