Automata-Based Abstraction for Automated Verification of Higher-Order Tree-Processing Programs-Reference-Cited by-同舟云学术

Automata-Based Abstraction for Automated Verification of Higher-Order Tree-Processing Programs

Published:2015 Issue: Volume: Page:295-312
ISSN:0302-9743
Container-title:Programming Languages and Systems
language:
Short-container-title:

Author:

Matsumoto Yuma,Kobayashi Naoki,Unno Hiroshi

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-26529-2_16

Reference20 articles.

1. Asada, K., Sato, R., Kobayashi, N.: Verifying relational properties of functional programs by first-order refinement. In: Proceedings of PEPM 2015, pp. 61–72 (2015)

2. Blumensath, A., Grädel, E.: Automatic structures. In: Proceedings of LICS 2000, pp. 51–62 (2000)

3. Broadbent, C.H., Kobayashi, N.: Saturation-based model checking of higher-order recursion schemes. In: Proceedings of CSL 2013. LIPIcs, vol. 23, pp. 129–148 (2013)

4. Comon, H., et al.: Tree automata techniques and applications (2007). http://www.grappa.univ-lille3.fr/tata

5. Lecture Notes in Computer Science;L Moura de,2008

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

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

2. Extending Timbuk to Verify Functional Programs;Rewriting Logic and Its Applications;2018

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

4. Modular Verification of Higher-Order Functional Programs;Programming Languages and Systems;2017

5. Automata-Based Abstraction for Automated Verification of Higher-Order Tree-Processing Programs;Programming Languages and Systems;2015