Inverse Unfold Problem and Its Heuristic Solving

DOI10.4230/OASIcs.WPTE.2014.27zbMath1428.68126OpenAlexW2246650901MaRDI QIDQ5240134

Masahiko Sakai, Masanori Nagashima, Tomofumi Kato, Naoki Nishida

Publication date: 24 October 2019

Full work available at URL: https://dblp.uni-trier.de/db/conf/rta/wpte2014.html#NagashimaKSN14

zbMATH Keywords

program transformationunfoldingconditional term rewriting system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transformations of CLP modules
• Conditional rewrite rules: Confluence and termination
• Order-sorted completion: The many-sorted way
• Equivalence-preserving first-order unfold/fold transformation systems
• A transformation system for deductive database modules with perfect model semantics
• Transforming constraint logic programs
• Completeness results for basic narrowing
• Determinization of conditional term rewriting systems
• Constraint-based correctness proofs for logic program transformations
• Computing More Specific Versions of Conditional Rewriting Systems
• Improving Determinization of Grammar Programs for Program Inversion
• BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS
• A Transformation System for Developing Recursive Programs
• Term Rewriting and All That
• Unfold⧸fold transformation of general logic programs for the well-founded semantics
• Program Inversion for Tail Recursive Functions
• Term Rewriting and Applications
• Program Development in Computational Logic

This page was built for publication: Inverse Unfold Problem and Its Heuristic Solving