1032 search results - page 7 / 207 » Extended Computation Tree Logic |
SPAA
1998
ACM
15 years 4 months ago
1998
ACM
106
click to vote
LICS
2010
IEEE
14 years 10 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We introduce hybrid branching-time logics as extensions of CT L-like logics with hybrid machinery such as the downarrow-operator. Following recent work in the linear framework, we...
133
click to vote
ESOP
2000
Springer
15 years 3 months ago
2000
Springer
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
185
click to vote
ICANN
2011
Springer
14 years 3 months ago
2011
Springer
The definition of appropriate kernel functions is crucial for the performance of a kernel method. In many of the state-of-the-art kernels for trees, matching substructures are con...