Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies

DOI10.1007/978-3-319-21401-6_9zbMath1465.68121OpenAlexW1476058999MaRDI QIDQ3454088

Masahiko Sakai, Yoshiharu Kojima, Florent Jacquemard

Publication date: 2 December 2015

Published in: Automated Deduction - CADE-25 (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01149319/file/pCTRS-bu.pdf

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Related Items (6)

Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy ⋮ Unnamed Item ⋮ Some decidability results on one-pass reductions ⋮ One-variable context-free hedge automata ⋮ Applications and extensions of context-sensitive rewriting ⋮ Modular termination of prefix-constrained term rewrite systems

Uses Software

• Timbuk

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reachability analysis over term rewriting systems
• Flow analysis of lazy higher-order functional programs
• Some decision problems about controlled rewriting systems
• Weak quantifier elimination for the full linear theory of the integers
• IO and OI. II
• Typechecking for XML transformers
• Decidability for left-linear growing term rewriting systems.
• Controlled Term Rewriting
• Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
• Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
• One-sided and two-sided context in formal grammars
• Rewrite Closure and CF Hedge Automata
• Bottom-Up Rewriting Is Inverse Recognizability Preserving

This page was built for publication: Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies