Higher-order recursion schemes (HORS) have recently emerged as a promising foundation for higher-order program verification. We examine the impact of enriching HORS with linear types. To that end, we introduce two frameworks that blend non-linear and linear types: a variant of the λY-calculus and an extension of HORS, called linear HORS (LHORS). First we prove that the two formalisms are equivalent and there exist polynomial-time translations between them. Then, in order to support model-checking of (trees generated by) LHORS, we propose a refined version of alternating parity tree automata, called LNAPTA, whose behaviour depends on information about linearity. We show that the complexity of LNAPTA model-checking for LHORS depends on two ty...
In this article, we develop a new and somewhat unexpected connection between higher-order model-chec...
Type-based model checking algorithms for higher-order recursion schemes have recently emerged as a p...
Accepted paper to FSTTCS'13We study a model for recursive functional programs called, higher order r...
International audienceHigher-order recursion schemes (HORS) have recently emerged as a promising fou...
The verification of higher-order recursive programs is a challenging issue, for which model-checking...
Higher-order recursion schemes are a powerful model of functional computation that grew out of tradi...
Abstract—The model checking of higher-order recursion schemes (HORS), aka. higher-order model checki...
We show a new simple algorithm that solves the model-checking problem for recursion schemes: check w...
We investigate the expressive power of higher-order recursion schemes (HORS) restricted to linear ty...
Higher-order recursion schemes are systems of equations that are used to define finite and infinite ...
Abstract. Model checking of higher-order recursion schemes (HORS, for short) has been recently studi...
The model checking of higher-order recursion schemes has important applications in the verification ...
Model checking of higher-order recursion schemes (HORS) has recently been studied extensively and ap...
Higher-order recursion schemes (HORS) have recently received much attention as a useful abstraction ...
Abstract—Higher-order model checking is about the model checking of trees generated by recursion sch...
In this article, we develop a new and somewhat unexpected connection between higher-order model-chec...
Type-based model checking algorithms for higher-order recursion schemes have recently emerged as a p...
Accepted paper to FSTTCS'13We study a model for recursive functional programs called, higher order r...
International audienceHigher-order recursion schemes (HORS) have recently emerged as a promising fou...
The verification of higher-order recursive programs is a challenging issue, for which model-checking...
Higher-order recursion schemes are a powerful model of functional computation that grew out of tradi...
Abstract—The model checking of higher-order recursion schemes (HORS), aka. higher-order model checki...
We show a new simple algorithm that solves the model-checking problem for recursion schemes: check w...
We investigate the expressive power of higher-order recursion schemes (HORS) restricted to linear ty...
Higher-order recursion schemes are systems of equations that are used to define finite and infinite ...
Abstract. Model checking of higher-order recursion schemes (HORS, for short) has been recently studi...
The model checking of higher-order recursion schemes has important applications in the verification ...
Model checking of higher-order recursion schemes (HORS) has recently been studied extensively and ap...
Higher-order recursion schemes (HORS) have recently received much attention as a useful abstraction ...
Abstract—Higher-order model checking is about the model checking of trees generated by recursion sch...
In this article, we develop a new and somewhat unexpected connection between higher-order model-chec...
Type-based model checking algorithms for higher-order recursion schemes have recently emerged as a p...
Accepted paper to FSTTCS'13We study a model for recursive functional programs called, higher order r...