Sciweavers

82 search results - page 17 / 17
» Inductive Proofs of Computational Secrecy
Sort
View
PLPV
2009
ACM
14 years 5 months ago
Positively dependent types
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...
Daniel R. Licata, Robert Harper
FMCAD
2008
Springer
13 years 10 months ago
Automatic Non-Interference Lemmas for Parameterized Model Checking
Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems arbitrary number of processes. One popular approach to thi...
Jesse D. Bingham