Sciweavers

154 search results - page 6 / 31
» Cryptographically Sound Theorem Proving
Sort
View
ENTCS
2006
131views more  ENTCS 2006»
13 years 7 months ago
Cooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite
This paper is a case study in combining theorem provers. We define a derived rule in HOL-Light, CVC PROVE, which calls CVC Lite and translates the resulting proof object back to HO...
Sean McLaughlin, Clark Barrett, Yeting Ge
CSFW
2006
IEEE
14 years 1 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...
ECOOP
1998
Springer
13 years 12 months ago
An Imperative, First-Order Calculus with Object Extension
This paper presents an imperative object calculus designed to support class-based programming via a combination of extensible objects and encapsulation. This calculus simplifies th...
Viviana Bono, Kathleen Fisher
ETRICS
2006
13 years 11 months ago
Allowing State Changes in Specifications
Abstract. We provide a static analysis (using both dataflow analysis and theorem proving) to allow state changes within specifications. This can be used for specification languages...
Michael Barnett, David A. Naumann, Wolfram Schulte...
ESORICS
2005
Springer
14 years 1 months ago
Limits of the Cryptographic Realization of Dolev-Yao-Style XOR
The abstraction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently si...
Michael Backes, Birgit Pfitzmann