17 search results - page 3 / 4 » On Model-Checking Trees Generated by Higher-Order Recursion ... |
FOSSACS
2007
Springer
15 years 3 months ago
2007
Springer
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
177
Voted
POPL
2009
ACM
15 years 10 months ago
2009
ACM
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
FOSSACS
2010
Springer
15 years 29 days ago
2010
Springer
A new framework for higher-order program verification has been recently proposed, in which higher-order functional programs are modelled as higher-order recursion schemes and then ...
88
Voted
LICS
2010
IEEE
14 years 7 months ago
2010
IEEE
Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
87
Voted
LICS
2008
IEEE
15 years 4 months ago
2008
IEEE
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...