5084 search results - page 669 / 1017 » Proving Possibility Properties |
174
click to vote
IMA
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. The asymptotic security of the Blum-Blum-Shub (BBS) pseudorandom generator has been studied by Alexi et al. and Vazirani and Vazirani, who proved independently that O(log...
207
click to vote
LPAR
2005
Springer
16 years 8 days ago
2005
Springer
The notion of comparative similarity ‘X is more similar or closer to Y than to Z’ has been investigated in both foundational and applied areas of knowledge representation and r...
172
click to vote
PDCAT
2005
Springer
16 years 8 days ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
180
click to vote
RTA
2005
Springer
16 years 8 days ago
2005
Springer
Proof-carrying code provides a mechanism for insuring that a host, or code consumer, can safely run code delivered by a code producer. The host specifies a safety policy as a set ...
177
click to vote
TARK
2005
Springer
16 years 7 days ago
2005
Springer
The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighb...