2137 search results - page 128 / 428 » Proving Abstract Non-interference |
CIE
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We prove that for any k 3 each element of the homomorphic quasiorder of finite k-labeled forests is definable, provided that the minimal non-smallest elements are allowe...
113
click to vote
CONCUR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving...
109
click to vote
CSR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...
110
click to vote
DBPL
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Formal semantics for XQuery with side-effects have been proposed in [13, 16]. We propose a different semantics which is better suited for database compilation. We substan...
132
click to vote
RTA
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...