This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
We present a new formalization of the algebraic hierarchy in Coq, exploiting its new type class mechanism to make practical a solution formerly thought infeasible. Our approach add...
Security protocols are often specified at the application layer; however, application layer specifications give little detail regarding message data structures at the presentation...
Benjamin W. Long, Colin J. Fidge, David A. Carring...
We propose a type and effect system for authentication protocols built upon a tagging scheme that formalizes the intended semantics of ciphertexts. The main result is that the val...
A general framework for studying the transitivity of reciprocal relations is presented. The key feature is the cyclic evaluation of transitivity: triangles (i.e. any three points)...