Sciweavers

634 search results - page 15 / 127
» Groundwork for Weak Analysis
Sort
View
TCS
2008
13 years 9 months ago
Using bisimulation proof techniques for the analysis of distributed abstract machines
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
Damien Pous
HASE
1997
IEEE
14 years 1 months ago
Automated Computation of Decomposable Synchronization Conditions
: The most important aspect of concurrent and distributed computation is the interaction between system components. Integration of components into a system requires some synchroniz...
Gilberto Matos, James M. Purtilo, Elizabeth L. Whi...
ASIACRYPT
1999
Springer
14 years 2 months ago
Equivalent Keys of HPC
This paper presents a weakness in the key schedule of the AES candidate HPC (Hasty Pudding Cipher). It is shown that for the HPC version with a 128-bit key, 1 in 256 keys is weak i...
Carl D'Halluin, Gert Bijnens, Bart Preneel, Vincen...
MLQ
2000
73views more  MLQ 2000»
13 years 9 months ago
Sequential Continuity of Functions in Constructive Analysis
It is shown, constructively, that the mapping T AT is sequentially continuous with respect to the weak
Douglas S. Bridges, Ayan Mahalanobis
ESWA
2006
122views more  ESWA 2006»
13 years 9 months ago
Ontology construction for information classification
Following the advent of the Internet technology and the rapid growth of its applications, users have spent long periods of time browsing through the ocean of information found in ...
Sung-Shun Weng, Hsine-Jen Tsai, Shang-Chia Liu, Ch...