181 search results - page 9 / 37 » Programming Language Techniques for Cryptographic Proofs |
96
Voted
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
We study the behavioural theory of Cardelli and Gordon’s Mobile Ambients. We give an lts based operational semantics, and a labelled bisimulation based equivalence that coincide...
71
Voted
ENTCS
2008
14 years 9 months ago
2008
In the book on Advanced Topics in Types and Programming Languages, Crary illustrates the reasoning technique of logical relations in a case study about equivalence checking. He pr...
102
click to vote
IFIP
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
163
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
95
Voted
APLAS
2007
ACM
15 years 1 months ago
2007
ACM
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...