Towards an Efficient Implementation of Tree Automata Completion-Reference-Cited by-同舟云学术

Towards an Efficient Implementation of Tree Automata Completion

Published: Issue: Volume: Page:67-82
ISSN:0302-9743
Container-title:Algebraic Methodology and Software Technology
language:
Short-container-title:

Author:

Balland Emilie,Boichut Yohan,Genet Thomas,Moreau Pierre-Etienne

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-79980-1_6.pdf

Reference20 articles.

1. RAVAJ project (ANR-06-SETI-014)– Rewriting and Approximations for Java Applications Verification, http://www.irisa.fr/lande/genet/RAVAJ/index.html

2. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

3. Lecture Notes in Computer Science;E. Balland,2007

4. Balland, E., Moreau, P.-E.: Optimizing pattern matching compilation by program transformation. In: 3rd Workshop on Software Evolution through Transformations (SeTra 2006). Electronic Communications of EASST (2006) ISSN 1863-2122

5. Lecture Notes in Computer Science;Y. Boichut,2007

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

1. Optimised determinisation and completion of finite tree automata;Journal of Logical and Algebraic Methods in Programming;2018-02

2. Rewriting Approximations for Properties Verification over CCS Specifications;Fundamentals of Software Engineering;2012

3. Widening techniques for regular tree model checking;International Journal on Software Tools for Technology Transfer;2011-08-03

4. TAGED Approximations for Temporal Properties Model-Checking;Implementation and Application of Automata;2009

5. How to Tackle Integer Weighted Automata Positivity;Lecture Notes in Computer Science;2009