402 search results - page 9 / 81 » Model Checking Quantified Computation Tree Logic |
145
Voted
BIRTHDAY
2004
Springer
15 years 6 months ago
2004
Springer
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
141
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We introduce streaming tree transducers as an analyzable and expressive model for transforming hierarchically structured data in a single pass. Given a linear encoding of the inpu...
107
click to vote
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
In multi-valued model checking, a temporal logic formula is interpreted relative to a structure not as a truth value but as a lattice element. In this paper we present new algorith...
122
click to vote
GCC
2003
Springer
15 years 8 months ago
2003
Springer
We use 2-Dimensional language to construct 2-Dimensional computer graphics model, use MSO or other logics to specify some graph property, and use automata model checking technique ...
128
click to vote
LICS
2006
IEEE
15 years 9 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...