Sciweavers

5084 search results - page 133 / 1017
» Proving Possibility Properties
Sort
View
CSFW
2006
IEEE
15 years 11 months ago
Computationally Sound Compositional Logic for Key Exchange Protocols
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
Anupam Datta, Ante Derek, John C. Mitchell, Bogdan...
175
Voted
IJCNN
2006
IEEE
15 years 11 months ago
Automated Model Selection (AMS) on Finite Mixtures: A Theoretical Analysis
— From the Bayesian Ying-Yang (BYY) harmony learning theory, a harmony function has been developed for finite mixtures with a novel property that its maximization can make model...
Jinwen Ma
IFM
2005
Springer
15 years 11 months ago
A Fixpoint Semantics of Event Systems With and Without Fairness Assumptions
Abstract. We present a fixpoint semantics of event systems. The semantics is presented in a general framework without concerns of fairness. Soundness and completeness of rules for...
Héctor Ruíz Barradas, Didier Bert
PODC
2000
ACM
15 years 10 months ago
Debugging distributed programs using controlled re-execution
Distributed programs are hard to write. A distributed debugger equipped with the mechanism to re-execute the traced computation in a controlled fashion can greatly facilitate the ...
Neeraj Mittal, Vijay K. Garg
ISAAC
1998
Springer
90views Algorithms» more  ISAAC 1998»
15 years 9 months ago
Generalized Self-Approaching Curves
Abstract. We consider all planar oriented curves that have the following property depending on a fixed angle . For each point B on the curve, the rest of the curve lies inside a we...
Oswin Aichholzer, Franz Aurenhammer, Christian Ick...