Reachability analysis of innermost rewriting
From MaRDI portal
Publication:2980977
DOI10.23638/LMCS-13(1:12)2017zbMATH Open1398.68274arXiv1610.05156MaRDI QIDQ2980977FDOQ2980977
Authors: Thomas Genet, Yann Salmon 
Publication date: 8 May 2017
Full work available at URL: https://arxiv.org/abs/1610.05156
Recommendations
- Reachability analysis of innermost rewriting
- Reachability analysis over term rewriting systems
- Reachability analysis of term rewriting systems with Timbuk
- Improved functional flow and reachability analyses using indexed linear tree grammars
- Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Functional programming and lambda calculus (68N18)
Cites Work
- C-SHORe: a collapsible approach to higher-order verification
- A faithful encoding of programmable strategies into term rewriting systems
- Analysing the complexity of functional programs: higher-order meets first-order
- Term Rewriting and All That
- Termination criteria for tree automata completion
- Mechanizing and improving dependency pairs
- Title not available (Why is that?)
- Reachability analysis over term rewriting systems
- Towards static analysis of functional programs using tree automata completion
- Model checking higher-order programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reachability analysis of innermost rewriting
- Flow analysis of lazy higher-order functional programs
- Sequentiality, monadic second-order logic and tree automata.
- Title not available (Why is that?)
- Closure of tree automata languages under innermost rewriting
- Higher-order multi-parameter tree transducers and recursion schemes for program verification
- Improved functional flow and reachability analyses using indexed linear tree grammars
- Verifying higher-order functional programs with pattern-matching algebraic data types
- Term Rewriting and Applications
- Rewriting Techniques and Applications
- Equational approximations for tree automata completion
- Approximations for strategies and termination
- Proving termination of programs automatically with AProVE
- Model-checking higher-order programs with recursive types
- Over-approximating descendants by synchronized tree languages
- Handling left-quadratic rules when completing tree automata
- Polymorphic functions with set-theoretic types. I: Syntax, semantics, and evaluation
Cited In (7)
- Term Rewriting and Applications
- Reachability-based acyclicity analysis by abstract interpretation
- Reachability analysis of innermost rewriting
- Improved functional flow and reachability analyses using indexed linear tree grammars
- Reachability analysis over term rewriting systems
- Some decidability results on one-pass reductions
- Innermost termination of rewrite systems by labeling
Uses Software
This page was built for publication: Reachability analysis of innermost rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980977)
