181 search results - page 21 / 37 » Programming Language Techniques for Cryptographic Proofs |
98
Voted
PLPV
2009
ACM
15 years 6 months ago
2009
ACM
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
for reasoning about abstract models of protocols. The work on informal methods attempts to discern common patterns in the extensive record of flawed protocols, and to formulate po...
177
Voted
POPL
2009
ACM
15 years 10 months ago
2009
ACM
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
PASTE
2004
ACM
15 years 3 months ago
2004
ACM
This work discusses two non-traditional approaches for evaluating the imprecision of static analysis. The approaches are based on proofs of feasibility or infeasibility that are c...
BIRTHDAY
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...