2137 search results - page 139 / 428 » Proving Abstract Non-interference |
131
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for th...
FS
2006
15 years 3 months ago
2006
Abstract The problem of finding the best-possible lower bound on the distribution of a non-decreasing function of n dependent risks is solved when n = 2 and a lower bound on the co...
CI
2007
15 years 3 months ago
2007
Abstract. We present a general discussion of what constitutes a marketoriented approach to optimization. We demonstrate how a general framework can be used to conceptually improve ...
116
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract— We consider the level of information security provided by random linear network coding in network scenarios in which all nodes comply with the communication protocols y...
123
click to vote
JDA
2006
15 years 3 months ago
2006
Abstract. Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the p...