Model Checking Higher-Order Programs1

← Back to document page

2 · N. Kobayashi analysis (“Does a subterm e of a given program evaluate to a value generated at program point l?”), and resource usage verification (“Does a given program access resources such as files and memory in a valid manner?”). Our verification technique is based on model checking of higher-order recursion schemes (recursion schemes, for short) [Ong 2006], and consists of ...

  Higher, Based, Model, Order, Checking, Programs1, Model checking higher order programs1