Skip to main content
Article thumbnail
Location of Repository

C-SHORe: a collapsible approach to higher-order verification

By Christopher H. Broadbent, Arnaud Carayol, Matthew Hague and Olivier Serre


International audienceHigher-order recursion schemes (HORS) have recently received much attention as a useful abstraction of higher-order functional programs with a number of new verification techniques employing HORS model-checking as their centrepiece. This paper contributes to the ongoing quest for a truly scalable model-checker for HORS by offering a different, automata theoretic perspective. We introduce the first practical model-checking algorithm that actson a generalisation of pushdown automata equi-expressive with HORS called collapsible pushdown systems (CPDS). At its core is a substantial modification of a recently studied saturation algorithm for CPDS. In particular it is able to use information gathered from an approximate forward reachability analysis to guide its backward search. Moreover, we introduce an algorithm that prunes the CPDS prior to model-checking and a method for extractingcounter-examples in negative instances. We compare our tool with the state-of-the-art verification tools for HORS and obtain encouraging results. In contrast to some of the main competition tackling the same problem, our algorithm is fixed-parameter tractable, and we also offer significantly improved performance over the only previously published tool of which we are aware that also enjoys this property. The tool and additional material are available from

Topics: Higher-Order, Verification, Model-Checking, Recursion Schemes, Collapsible Pushdown Systems, [ INFO.INFO-LO ] Computer Science [cs]/Logic in Computer Science [cs.LO]
Publisher: ACM
Year: 2013
DOI identifier: 10.1145/2500365.2500589
OAI identifier: oai:HAL:hal-00865155v1
Provided by: Hal-Diderot

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.