Higher-order model checking has been recently applied to automated verification of higher-order functional programs, but there have been difficulties in dealing with algebraic data types such as lists and trees. To remedy the problem, we propose an automata-based abstraction of tree data, and a counterexample-guided refinement of the abstraction. By combining them with higher-order model checking, we can construct a fully-automated verification tool for higher-order, tree-processing functional programs. We formalize the verification method, prove its correctness, and report experimental results.
CITATION STYLE
Matsumoto, Y., Kobayashi, N., & Unno, H. (2015). Automata-based abstraction for automated verification of higher-order tree-processing programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9458, pp. 295–312). Springer Verlag. https://doi.org/10.1007/978-3-319-26529-2_16
Mendeley helps you to discover research relevant for your work.