655 search results - page 91 / 131 » Automata, Logic, and XML |
LATA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We consider policies that are described by regular expressions, finite automata, or formulae of linear temporal logic (LTL). Such policies are assumed to describe situat...
WIA
2000
Springer
15 years 1 months ago
2000
Springer
The Mona tool provides an implementation of the decision procedures for the logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably efficient in prac...
LICS
2010
IEEE
14 years 8 months ago
2010
IEEE
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
185
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
During the life cycle of an XML application, both schemas and queries may change from one version to another. Schema evolutions may affect query results and potentially the validi...
CADE
2009
Springer
15 years 10 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...