Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
From MaRDI portal
Publication:3522011
DOI10.1007/978-3-540-70590-1_7zbMATH Open1145.68445OpenAlexW1496435538MaRDI QIDQ3522011FDOQ3522011
Publication date: 28 August 2008
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70590-1_7
Recommendations
- Operational termination of conditional rewriting with built-in numbers and semantic data structures
- Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
- Dependency Pairs for Rewriting with Non-free Constructors
- Publication:2778873
- Proving Termination of Integer Term Rewriting
Cites Work
- Termination of term rewriting using dependency pairs
- Complete Sets of Reductions for Some Equational Theories
- Normalized rewriting: An alternative to rewriting modulo a set of equations
- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
- Title not available (Why is that?)
- Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures
- Frontiers of Combining Systems
- Logic for Programming, Artificial Intelligence, and Reasoning
- Tyrolean termination tool: techniques and features
- Mechanizing and improving dependency pairs
- Proving Termination by Bounded Increase
- SAT Solving for Termination Analysis with Polynomial Interpretations
- Mechanically proving termination using polynomial interpretations
- Title not available (Why is that?)
- Modular and incremental proofs of AC-termination
- Dependency Pairs for Rewriting with Non-free Constructors
- On the Implementation of Construction Functions for Non-free Concrete Data Types
Cited In (14)
- Generalized rewrite theories, coherence completion, and symbolic methods
- Operationally-based program equivalence proofs using LCTRSs
- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
- Applications and extensions of context-sensitive rewriting
- Title not available (Why is that?)
- Proving confluence in the confluence framework with confident
- Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures
- On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs
- Rewriting modulo SMT and open system analysis
- Proving Termination of Integer Term Rewriting
- Transforming concurrent programs with semaphores into logically constrained term rewrite systems
- Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
- Title not available (Why is that?)
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
Uses Software
This page was built for publication: Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522011)
