scientific article
From MaRDI portal
Publication:2980968
DOI10.23638/LMCS-13(1:6)2017zbMath1398.68275arXiv1510.07276MaRDI QIDQ2980968
Aart Middeldorp, Cynthia Kop, Thomas Sternagel
Publication date: 8 May 2017
Full work available at URL: https://arxiv.org/abs/1510.07276
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors ⋮ Applications and extensions of context-sensitive rewriting
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
- On tree automata that certify termination of left-linear term rewriting systems
- A rationale for conditional equational programming
- 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
- Context-sensitive rewriting strategies
- Elimination of conditions
- Analyzing innermost runtime complexity of term rewriting by dependency pairs
- Algorithms with polynomial interpretation termination proof
- Polynomial Path Orders
- Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
- 2D Dependency Pairs for Proving Operational Termination of CTRSs
- Unravelings and ultra-properties
- Tyrolean Complexity Tool: Features and Usage.
- Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems
- Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations
- Proving Termination of Programs Automatically with AProVE
- Computationally Equivalent Elimination of Conditions
- Automated Complexity Analysis Based on the Dependency Pair Method
- Term Rewriting and All That
- Automated Complexity Analysis Based on Context-Sensitive Rewriting
- Conditional Confluence (System Description)
- POLYNOMIALLY BOUNDED MATRIX INTERPRETATIONS
- Modular Complexity Analysis for Term Rewriting
- Complexity Analysis by Rewriting
- The Derivational Complexity Induced by the Dependency Pair Method
