Reachability analysis of innermost rewriting
From MaRDI portal
Publication:2980977
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
Cites work
- scientific article; zbMATH DE number 1615242 (Why is no real title available?)
- scientific article; zbMATH DE number 2090069 (Why is no real title available?)
- scientific article; zbMATH DE number 1405449 (Why is no real title available?)
- scientific article; zbMATH DE number 3303661 (Why is no real title available?)
- A faithful encoding of programmable strategies into term rewriting systems
- Analysing the complexity of functional programs: higher-order meets first-order
- Approximations for strategies and termination
- C-SHORe: a collapsible approach to higher-order verification
- Closure of tree automata languages under innermost rewriting
- Equational approximations for tree automata completion
- Flow analysis of lazy higher-order functional programs
- Handling left-quadratic rules when completing tree automata
- Higher-order multi-parameter tree transducers and recursion schemes for program verification
- Improved functional flow and reachability analyses using indexed linear tree grammars
- Mechanizing and improving dependency pairs
- Model checking higher-order programs
- Model-checking higher-order programs with recursive types
- Over-approximating descendants by synchronized tree languages
- Polymorphic functions with set-theoretic types. I: Syntax, semantics, and evaluation
- Proving termination of programs automatically with AProVE
- Reachability analysis of innermost rewriting
- Reachability analysis over term rewriting systems
- Rewriting Techniques and Applications
- Sequentiality, monadic second-order logic and tree automata.
- Term Rewriting and All That
- Term Rewriting and Applications
- Termination criteria for tree automata completion
- Towards static analysis of functional programs using tree automata completion
- Verifying higher-order functional programs with pattern-matching algebraic data types
Cited in
(7)- Reachability-based acyclicity analysis by abstract interpretation
- Term Rewriting and Applications
- Some decidability results on one-pass reductions
- Improved functional flow and reachability analyses using indexed linear tree grammars
- Reachability analysis over term rewriting systems
- Innermost termination of rewrite systems by labeling
- Reachability analysis of innermost rewriting
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)
