171 search results - page 3 / 35 » CoSP: a general framework for computational soundness proofs |
94
Voted
ENTCS
2006
14 years 9 months ago
2006
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
87
Voted
TCS
2011
14 years 4 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
78
Voted
FMSD
2006
14 years 9 months ago
2006
We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between ...
CCS
2005
ACM
15 years 3 months ago
2005
ACM
d abstract) Prateek Gupta and Vitaly Shmatikov The University of Texas at Austin We present a cryptographically sound formal method for proving correctness of key exchange protoco...
95
Voted
CADE
2005
Springer
15 years 9 months ago
2005
Springer
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...