Completion after Program Inversion of Injective Functions
From MaRDI portal
Publication:5170160
DOI10.1016/j.entcs.2009.03.034zbMath1294.68064OpenAlexW2034902781WikidataQ114182431 ScholiaQ114182431MaRDI QIDQ5170160
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.034
Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (2)
Determinization of inverted grammar programs via context-free expressions ⋮ Applications and extensions of context-sensitive rewriting
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The universal resolving algorithm and its correctness: Inverse computation in a functional language
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
- Operational termination of conditional term rewriting systems
- How to prove equivalence of term rewriting systems without induction
- Undecidable properties of deterministic top-down tree transducers
- Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting system
- Elimination of conditions
- Unravelings and ultra-properties
- Computationally Equivalent Elimination of Conditions
- Slothrop: Knuth-Bendix Completion with a Modern Termination Checker
- Automatic Partial Inversion of Inductively Sequential Functions
- Bidirectionalization transformation based on automatic derivation of view complement functions
- Term Rewriting and Applications
- Logic for Programming, Artificial Intelligence, and Reasoning
- Termination of logic programs: Transformational methods revisited
This page was built for publication: Completion after Program Inversion of Injective Functions
