Verification of tree-processing programs via higher-order mode checking

Abstract

We propose a new method to verify that a higher-order, tree-processing functional program conforms to an input/output specification. Our method reduces the verification problem to multiple verification problems for higher-order multi-tree transducers, which are then transformed into higher-order recursion schemes and model-checked. Unlike previous methods, our new method can deal with arbitrary higher-order functional programs manipulating algebraic data structures, as long as certain invariants on intermediate data structures are provided by a programmer. We have proved the soundness of the method and implemented a prototype verifier.

Unboundedness for Recursion Schemes: A Simpler Type System

“…They make use of appropriate systems of intersection types. Namely, a Japanese group created model-checkers TRecS [13] and HorSat [4], and prototype verification tools, MoCHi [15] and EHMTT verifier [28], on top of them. A group hosted in Oxford created model-checkers HORSC [19] and TravMC2 [18].…”