126 search results - page 5 / 26 » Pattern-Based Verification for Trees |
ICALP
2009
Springer
14 years 5 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...
DAS
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, a reliable and efficient structural analysis method for mathematical formulae is proposed for practical mathematical OCR. The proposed method consists of three steps...
COLCOM
2008
IEEE
13 years 7 months ago
2008
IEEE
Abstract. Mashups are defined to be lightweight Web applications aggregating data from different Web services, built using ad-hoc composition and being not concerned with long term...
POPL
2009
ACM
14 years 6 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...
CADE
2008
Springer
14 years 5 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...