2137 search results - page 308 / 428 » Proving Abstract Non-interference |
98
Voted
STACS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
114
Voted
TCC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Algorithmic progress and future technology threaten today’s cryptographic protocols. Long-term secure protocols should not even in future reveal more information to aâ€...
119
Voted
TLCA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The intuitionistic fragment of the call-by-name version of Curien and Herbelin’s λµ˜µ-calculus is isolated and proved strongly normalising by means of an embedding ...
WADS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Assumptions about node density in the Sensor Networks literature are frequently too strong or too weak. Neither absolutely arbitrary nor uniform deployment seem feasible ...
139
Voted
WAW
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We study the relation between PageRank and other parameters of information networks such as in-degree, out-degree, and the fraction of dangling nodes. We model this relat...