Sciweavers

30 search results - page 5 / 6
» A Calculus for Game-Based Security Proofs
Sort
View
SAC
2010
ACM
14 years 9 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...
111
Voted
POPL
1999
ACM
15 years 4 months ago
Typed Memory Management in a Calculus of Capabilities
An increasing number of systems rely on programming language technology to ensure safety and security of low-level code. Unfortunately, these systems typically rely on a complex, ...
Karl Crary, David Walker, J. Gregory Morrisett
82
Voted
JFP
2006
88views more  JFP 2006»
14 years 11 months ago
Type-based confinement
Confinement properties impose a structure on object graphs which can be used to enforce encapsulation properties. From a practical point of view, encapsulation is essential for bu...
Tian Zhao, Jens Palsberg, Jan Vitek
195
Voted
POPL
2004
ACM
15 years 12 months ago
A bisimulation for dynamic sealing
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
Eijiro Sumii, Benjamin C. Pierce
80
Voted
ENTCS
2007
129views more  ENTCS 2007»
14 years 11 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...