Termination criteria for tree automata completion
DOI10.1016/J.JLAMP.2015.05.003zbMATH Open1356.68132OpenAlexW2256367468MaRDI QIDQ730470FDOQ730470
Authors: Thomas Genet 
Publication date: 28 December 2016
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2015.05.003
Recommendations
regular tree languagestree automataterm rewritinganalysis of functional programsregularity preservationtree automata completion
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Functional programming and lambda calculus (68N18)
Cites Work
- Computer Aided Verification
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Title not available (Why is that?)
- Decidable approximations of term rewriting systems
- Decidable call by need computations in term rewriting (extended abstract)
- Rewriting Approximations for Fast Prototyping of Static Analyzers
- A completion algorithm for lattice tree automata
- Tree generating regular systems
- Equational abstractions
- Title not available (Why is that?)
- Left-linear bounded TRSs are inverse recognizability preserving
- Reachability analysis over term rewriting systems
- Certifying a Tree Automata Completion Checker
- Towards static analysis of functional programs using tree automata completion
- Model checking higher-order programs
- Deterministic tree pushdown automata and monadic tree rewriting systems
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability
- 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
- A theoretical limit for safety verification techniques with regular fix-point computations
- Tree automata for rewrite strategies
- Characterizing conclusive approximations by logical formulae
- HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA
- Title not available (Why is that?)
- Bottom-up tree pushdown automata and rewrite systems
- Finite Models vs Tree Automata in Safety Verification
- 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
Cited In (12)
- Towards an Efficient Implementation of Tree Automata Completion
- Pattern eliminating transformations
- Towards static analysis of functional programs using tree automata completion
- Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy
- Completeness of tree automata completion
- Equational approximations for tree automata completion
- Reachability analysis of innermost rewriting
- Certifying a Tree Automata Completion Checker
- Multi-completion with termination tools
- Some decidability results on one-pass reductions
- Reachability, confluence, and termination analysis with state-compatible automata
- HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA
Uses Software
This page was built for publication: Termination criteria for tree automata completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730470)
