Termination criteria for tree automata completion (Q730470): Difference between revisions

@@ Property / DOI @@
-.1016/j.jlamp.2015.05.003
@@ Property / DOI: 10.1016/j.jlamp.2015.05.003 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+AVISPA
@@ Property / describes a project that uses: AVISPA / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Timbuk
@@ Property / describes a project that uses: Timbuk / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+OCaml
@@ Property / describes a project that uses: OCaml / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jlamp.2015.05.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2256367468
@@ Property / OpenAlex ID: W2256367468 / rank @@
+Normal rank
@@ Property / cites work @@
+Rewriting Approximations for Fast Prototyping of Static Analyzers
+Normal rank
@@ Property / cites work @@
+Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars
+Normal rank
@@ Property / cites work @@
+Computer Aided Verification
@@ Property / cites work: Computer Aided Verification / rank @@
+Normal rank
@@ Property / cites work @@
+Term Rewriting and Applications
@@ Property / cites work: Term Rewriting and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability analysis over term rewriting systems
@@ Property / cites work: Reachability analysis over term rewriting systems / rank @@
+Normal rank
@@ Property / cites work @@
+Equational approximations for tree automata completion
+Normal rank
@@ Property / cites work @@
+Towards Static Analysis of Functional Programs Using Tree Automata Completion
+Normal rank
@@ Property / cites work @@
+Rewriting Techniques and Applications
@@ Property / cites work: Rewriting Techniques and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q4938423
@@ Property / cites work: Q4938423 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2723905
@@ Property / cites work: Q2723905 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidable approximations of term rewriting systems
+Normal rank
@@ Property / cites work @@
+Finite Models vs Tree Automata in Safety Verification
+Normal rank
@@ Property / cites work @@
+HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA
+Normal rank
@@ Property / cites work @@
+Q4847003
@@ Property / cites work: Q4847003 / rank @@
+Normal rank
@@ Property / cites work @@
+Tree automata for rewrite strategies
@@ Property / cites work: Tree automata for rewrite strategies / rank @@
+Normal rank
@@ Property / cites work @@
+Closure of Tree Automata Languages under Innermost Rewriting
+Normal rank
@@ Property / cites work @@
+Tree generating regular systems
@@ Property / cites work: Tree generating regular systems / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic tree pushdown automata and monadic tree rewriting systems
+Normal rank
@@ Property / cites work @@
+Bottom-up tree pushdown automata and rewrite systems
+Normal rank
@@ Property / cites work @@
+Decidable call by need computations in term rewriting (extended abstract)
+Normal rank
@@ Property / cites work @@
+Q4938609
@@ Property / cites work: Q4938609 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4808741
@@ Property / cites work: Q4808741 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear generalized semi-monadic rewrite systems effectively preserve recognizability
+Normal rank
@@ Property / cites work @@
+Left-linear Bounded TRSs are Inverse Recognizability Preserving
+Normal rank
@@ Property / cites work @@
+Certifying a Tree Automata Completion Checker
@@ Property / cites work: Certifying a Tree Automata Completion Checker / rank @@
+Normal rank
@@ Property / cites work @@
+All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
+Normal rank
@@ Property / cites work @@
+Equational abstractions
@@ Property / cites work: Equational abstractions / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing Conclusive Approximations by Logical Formulae
+Normal rank
@@ Property / cites work @@
+A theoretical limit for safety verification techniques with regular fix-point computations
+Normal rank
@@ Property / cites work @@
+Flow analysis of lazy higher-order functional programs
+Normal rank
@@ Property / cites work @@
+Higher-order multi-parameter tree transducers and recursion schemes for program verification
+Normal rank
@@ Property / cites work @@
+Verifying higher-order functional programs with pattern-matching algebraic data types
+Normal rank
@@ Property / cites work @@
+Model Checking Higher-Order Programs
@@ Property / cites work: Model Checking Higher-Order Programs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5277878
@@ Property / cites work: Q5277878 / rank @@
+Normal rank
@@ Property / cites work @@
+A Completion Algorithm for Lattice Tree Automata
@@ Property / cites work: A Completion Algorithm for Lattice Tree Automata / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JLAMP.2015.05.003
@@ Property / DOI: 10.1016/J.JLAMP.2015.05.003 / rank @@
+Normal rank