Rewriting Approximations for Fast Prototyping of Static Analyzers-Reference-Cited by-同舟云学术

Rewriting Approximations for Fast Prototyping of Static Analyzers

Published:2007 Issue: Volume: Page:48-62
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Boichut Yohan,Genet Thomas,Jensen Thomas,Le Roux Luka

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-73449-9_6

Reference18 articles.

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

2. Bertelsen, P.: Semantics of Java Byte Code. Technical report, Technical University of Denmark (1997)

3. Boichut, Y., Genet, T., Jensen, T., Le Roux, L.: Rewriting Approximations for Fast Prototyping of Static Analyzers. Research Report RR 5997, INRIA (2006), http://www.irisa.fr/lande/genet/publications.html

4. Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract regular tree model checking. In: Proceedings of 7th International Workshop on Verification of Infinite-State Systems – INFINITY 2005, in BRICS Notes Series, vol. 4, pp. 15–24 (2005)

5. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2002), http://www.grappa.univ-lille3.fr/tata/

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

1. Detection of Uncaught Exceptions in Functional Programs by Abstract Interpretation;Lecture Notes in Computer Science;2024

2. Verifying Higher-Order Functions with Tree Automata;Lecture Notes in Computer Science;2018

3. Over-Approximating Terms Reachable by Context-Sensitive Rewriting;Lecture Notes in Computer Science;2015

4. A Completion Algorithm for Lattice Tree Automata;Implementation and Application of Automata;2013

5. Equational Abstraction Refinement for Certified Tree Regular Model Checking;Formal Methods and Software Engineering;2012