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...
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Abstract--We present a refinement-based compositional framework for showing that pipelined machines satisfy the same safety and liveness properties as their non-pipelined specifica...
We develop a general method for proving properties of contract-signing protocols using a specialized protocol logic. The method is applied to the Asokan-ShoupWaidner and the Garay...
Michael Backes, Anupam Datta, Ante Derek, John C. ...