Termination criteria for tree automata completion-Reference-Cited by-同舟云学术

Termination criteria for tree automata completion

Author:

Genet Thomas

Publisher

Elsevier BV

Subject

Software,Theoretical Computer Science,Computational Theory and Mathematics,Logic

Reference47 articles.

1. Rewriting approximations for fast prototyping of static analyzers;Boichut,2007

2. Improved functional flow and reachability analyses using indexed linear tree grammars;Kochems,2011

3. Verification of copy protection cryptographic protocol using approximations of term rewriting systems;Genet,2003

4. The AVISPA tool for the automated validation of Internet security protocols and applications;Armando,2005

5. On tree automata that certify termination of left-linear term rewriting systems;Geser,2005

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Static analysis of pattern-free properties;23rd International Symposium on Principles and Practice of Declarative Programming;2021-09-06

2. Pattern Eliminating Transformations;Logic-Based Program Synthesis and Transformation;2021

3. Regular language type inference with term rewriting;Proceedings of the ACM on Programming Languages;2020-08-02

4. Some decidability results on one-pass reductions;Journal of Logical and Algebraic Methods in Programming;2019-06