53 search results - page 2 / 11 » Computationally Sound Mechanized Proofs of Correspondence As... |
CCS
2008
ACM
14 years 11 months ago
2008
ACM
SP
2006
IEEE
15 years 3 months ago
2006
IEEE
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool does not rely on the Dolev-Yao model, but on the co...
180
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
We present a proof calculus and method for the static verification of assertions and procedure specifications in shared-memory concurrent programs. The key idea in our approach is...
JAR
2008
14 years 9 months ago
2008
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...
CCS
2008
ACM
14 years 11 months ago
2008
ACM
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...