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...
Abstract. In this paper we propose an effective procedure for translating a proof term of the Calculus of Inductive Constructions (CIC), which is very similar to a program written...
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...
d Abstract) Brian Aydemir Aaron Bohannon Stephanie Weirich Department of Computer and Information Science University of Pennsylvania Philadelphia, PA, USA We explore an axiomatize...
Brian E. Aydemir, Aaron Bohannon, Stephanie Weiric...
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...