79 search results - page 8 / 16 » Universal Languages and the Power of Diagonalization |
CONCUR
2009
Springer
14 years 1 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
The XPath language incorporates powerful primitives for formulating queries containing nested subexpressions which are existentially or universally quantified. However, even the b...
ICDE
2003
IEEE
14 years 8 months ago
2003
IEEE
We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given function...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Motivated by the challenging task of designing “secure” vote storage mechanisms, we study information storage mechanisms that operate in extremely hostile environments. In suc...
HASE
1998
IEEE
13 years 11 months ago
1998
IEEE
It is widely accepted that the OO paradigm will signi cantly increase software reusability, extendibility, interoperability, and reliability. This is also true for high assurance ...