We introduce the first practical model-checking algorithm that acts on a generalisation of pushdown automata equi-expressive with HORS called collapsible ...
Mar 10, 2016 · In this work we investigate a radically different approach exploiting the connection between higher-order recursion schemes and an automata ...
We introduce the first practical model-checking algorithm that acts on a generalisation of pushdown automata equi-expressive with HORS called collapsible ...
Mar 13, 2017 · C-SHORe implements the first practical model-checking algorithm that acts on a generalisation of pushdown automata equi-expressive with HORS ...
Missing: approach | Show results with:approach
We introduce the first practical model-checking algorithm that acts on a generalisation of pushdown automata equi-expressive with HORS called collapsible ...
C-SHORe: A Collapsible Approach to Verifying Higher-Order ...
pure.royalholloway.ac.uk › publications
Higher-order recursion schemes (HORS) have recently received much attention as a useful abstraction of higher-order functional programs with a number of new ...
C-SHORe: A Collapsible Approach to Verifying Higher-Order Programs. Chris Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre.
In this work we investigate a radically different approach exploiting the connection between higher-order recursion schemes and an automata model called ...
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague , Olivier Serre: C-SHORe: a collapsible approach to higher-order verification. ICFP 2013: 13-24.
C-shore: a collapsible approach to higher-order verification. C Broadbent, A Carayol, M Hague, O Serre. ACM SIGPLAN Notices 48 (9), 13-24, 2013. 36, 2013.