Sciweavers

888 search results - page 96 / 178
» The Power of Temporal Proofs
Sort
View
CSL
2007
Springer
15 years 4 months ago
Typed Normal Form Bisimulation
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
Søren B. Lassen, Paul Blain Levy
DSN
2005
IEEE
15 years 3 months ago
Assured Reconfiguration of Fail-Stop Systems
Hardware dependability improvements have led to a situation in which it is sometimes unnecessary to employ extensive hardware replication to mask hardware faults. Expanding upon o...
Elisabeth A. Strunk, John C. Knight, M. Anthony Ai...
CTRSA
2005
Springer
79views Cryptology» more  CTRSA 2005»
15 years 3 months ago
Malicious Cryptography: Kleptographic Aspects
Abstract. In the last few years we have concentrated our research efforts on new threats to the computing infrastructure that are the result of combining malicious software (malwar...
Adam Young, Moti Yung
IFM
2005
Springer
100views Formal Methods» more  IFM 2005»
15 years 3 months ago
Embedding the Stable Failures Model of CSP in PVS
We present an embedding of the stable failures model of CSP in the PVS theorem prover. Our work, extending a previous embedding of the traces model of CSP in [6], provides a platfo...
Kun Wei, James Heather
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
15 years 3 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi