Representing the MSR Cryptoprotocol Specification Language in an Extension of Rewriting Logic with Dependent Types

This paper presents a shallow and hence effcient embedding of the security protocol specifcation language MSR into rewriting logic with dependent types, an instance of the open calculus of constructions which integrates key concepts from equational logic, rewriting logic, and type theory. MSR is based on a form of first-order multiset rewriting extended with existential name generation and a flexible type infrastructure centered on dependent types with subsorting. This encoding is intended to serve as the basis for implementing an MSR specification and analysis environment using existing first-order rewriting engines such as Maude.