566 search results - page 10 / 114 » Array Abstractions from Proofs |
FSTTCS
2003
Springer
14 years 21 days ago
2003
Springer
We prove the Needham-Schroeder-Lowe public-key protocol secure under real, active cryptographic attacks including concurrent protocol runs. This proof is based on an abstract crypt...
ESOP
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. We describe a symbolic heap abstraction that unifies reasoning about arrays, pointers, and scalars, and we define a fluid update operation on this symbolic heap that rela...
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We investigate the question of what constitutes a proof when quantifiers and multiplicative units are both present. On the technical level this paper provides two new as...
LACL
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
CRYPTO
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. We present EasyCrypt, an automated tool for elaborating security proofs of cryptographic systems from proof sketches—compact, formal representations of the essence of a...