Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures
From MaRDI portal
Publication:5170162
DOI10.1016/j.entcs.2009.03.036zbMath1294.68096MaRDI QIDQ5170162
Publication date: 22 July 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.2009.03.036
Related Items
Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures, A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs, Verifying Procedural Programs via Constrained Rewriting Induction, Rewriting modulo SMT and open system analysis, Generalized rewrite theories, coherence completion, and symbolic methods, Using well-founded relations for proving operational termination, Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Operational termination of conditional term rewriting systems
- Proving operational termination of membership equational programs
- Normalized rewriting: An alternative to rewriting modulo a set of equations
- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
- Dependency Pairs for Rewriting with Non-free Constructors
- Complete Sets of Reductions for Some Equational Theories
- Completion-time optimization of rewrite-time goal solving
- Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures
- On the Implementation of Construction Functions for Non-free Concrete Data Types