8 search results - page 2 / 2 » On Global Model Checking Trees Generated by Higher-Order Rec... |
APLAS
2010
ACM
13 years 6 months ago
2010
ACM
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
POPL
2009
ACM
14 years 7 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...