254 search results - page 44 / 51 » Restarting Tree Automata |
COMPUTER
1998
13 years 8 months ago
1998
ER ABSTRACTIONS ter service uses several abstractions— including resource, resource dependencies, and resource groups—to simplify both the cluster service itself and user-visib...
PODS
2004
ACM
14 years 9 months ago
2004
ACM
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
ATVA
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. The bounded synthesis problem is to construct an implementation that satisfies a given temporal specification and a given bound on the number of states. We present a so...
CONCUR
2007
Springer
14 years 3 months ago
2007
Springer
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
FOSSACS
2007
Springer
14 years 3 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...