110 search results - page 13 / 22 » Mean-Payoff Automaton Expressions |
SP
1998
IEEE
14 years 25 days ago
1998
IEEE
Current implementations of Java make security decisions by searching the runtime call stack. These systems have attractive security properties, but they have been criticized as be...
CONCUR
2003
Springer
14 years 1 months ago
2003
Springer
We identify a necessary condition for when a given BPP process can be expressed as a BPA process. We provide an effective procedure for testing if this condition holds of a given B...
ICDT
2003
ACM
14 years 1 months ago
2003
ACM
We consider the problem of evaluating a large number of XPath expressions on an XML stream. Our main contribution consists in showing that Deterministic Finite Automata (DFA) can b...
WIA
2004
Springer
14 years 1 months ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
PODS
2009
ACM
14 years 9 months ago
2009
ACM
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...