181 search results - page 10 / 37 » Programming Language Techniques for Cryptographic Proofs |
197
click to vote
POPL
2001
ACM
15 years 10 months ago
2001
ACM
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...
166
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
175
click to vote
POPL
2004
ACM
15 years 10 months ago
2004
ACM
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...
78
Voted
APLAS
2009
ACM
15 years 1 months ago
2009
ACM
Type and effect systems are a tool to analyse statically the behaviour of programs with effects. We present a proof based on the so called reducibility candidates that a suitable ...
CEFP
2009
Springer
14 years 7 months ago
2009
Springer
Programmers happily use induction to prove properties of recursive programs. To show properties of corecursive programs they employ coinduction, but perhaps less enthusiastically. ...