159 search results - page 7 / 32 » Weak Equivalences in Psi-Calculi |
102
Voted
CCA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
122
click to vote
MEMOCODE
2008
IEEE
15 years 7 months ago
2008
IEEE
Equivalence checking is a classical verification method determining if a finite-state concurrent system (protocol) satisfies its desired external behaviour (service) by compari...
97
Voted
SACRYPT
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Inthis paper we present several weaknesses in the keyscheduling algorithm of RC4, and describe their cryptanalytic signi cance. We identify a large number of weak keys, i...
101
click to vote
CSFW
2003
IEEE
15 years 6 months ago
2003
IEEE
To be practical, systems for ensuring secure information flow must be as permissive as possible. To this end, the author recently proposed a type system for multi-threaded progra...
CIE
2007
Springer
15 years 2 months ago
2007
Springer
This paper examines the constructive Hausdorff and packing dimensions of weak truth-table degrees. The main result is that every infinite sequence S with constructive Hausdorff...