Sciweavers

171 search results - page 2 / 35
» CoSP: a general framework for computational soundness proofs
Sort
View
SAC
2010
ACM
13 years 3 months ago
A machine-checked soundness proof for an efficient verification condition generator
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
Frédéric Vogels, Bart Jacobs 0002, F...
JAR
2010
123views more  JAR 2010»
13 years 3 months ago
A Framework for Proof Systems
Meta-logics and type systems based on intuitionistic logic are commonly used for specifying natural deduction proof systems. We shall show here that linear logic can be used as a m...
Vivek Nigam, Dale Miller
FSTTCS
2008
Springer
13 years 6 months ago
Sound Lemma Generation for Proving Inductive Validity of Equations
ABSTRACT. In many automated methods for proving inductive theorems, finding a suitable generalization of a conjecture is a key for the success of proof attempts. On the other hand...
Takahito Aoto
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
13 years 10 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
CSFW
2006
IEEE
13 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...