3658 search results - page 16 / 732 » The logic of proofs, semantically |
275
click to vote
ASIAN
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We presents a compositional Hoare logic for proving semantic security of modes of operation for symmetric key block ciphers. We propose a simple programming language to s...
179
click to vote
ENTCS
2010
15 years 4 months ago
2010
A previously introduced combination of the bialgebraic approach to structural operational semantics with aic modal logic is re-examined and improved in some aspects. Firstly, a mo...
149
click to vote
TPHOL
2007
IEEE
16 years 28 days ago
2007
IEEE
Cminor is a mid-level imperative programming language; there are proved-correct optimizing compilers from C to Cminor and from Cminor to machine language. We have redesigned Cminor...
185
click to vote
CSFW
2006
IEEE
16 years 21 days ago
2006
IEEE
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...
168
click to vote
TLCA
2009
Springer
16 years 1 months ago
2009
Springer
G¨odel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proo...