Sciweavers

APLAS
2010
ACM
13 years 4 months ago
Verification of Tree-Processing Programs via Higher-Order Model Checking
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...
Hiroshi Unno, Naoshi Tabuchi, Naoki Kobayashi
CONCUR
1998
Springer
13 years 8 months ago
The Regular Viewpoint on PA-Processes
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest viewing PA-processes as trees, and using treeautomata technique...
Denis Lugiez, Ph. Schnoebelen