Sciweavers

43 search results - page 9 / 9
» Quantum weakest preconditions
Sort
View
CCS
2006
ACM
13 years 9 months ago
Replayer: automatic protocol replay by binary analysis
We address the problem of replaying an application dialog between two hosts. The ability to accurately replay application dialogs is useful in many security-oriented applications,...
James Newsome, David Brumley, Jason Franklin, Dawn...
LOGCOM
2007
125views more  LOGCOM 2007»
13 years 5 months ago
Epistemic Actions as Resources
We provide algebraic semantics together with a sound and complete sequent calculus for information update due to epistemic actions. This semantics is flexible enough to accommoda...
Alexandru Baltag, Bob Coecke, Mehrnoosh Sadrzadeh
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...