Higher-Order and Symbolic Computation

, Volume 20, Issue 1, pp 3–35

Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types

Authors

    • Carnegie Mellon University
  • Mark-Oliver Stehr
    • Computer Science LaboratorySRI International
Article

DOI: 10.1007/s10990-007-9003-3

Cite this article as:
Cervesato, I. & Stehr, M. Higher-Order Symb Comput (2007) 20: 3. doi:10.1007/s10990-007-9003-3

Abstract

This paper presents a shallow and efficient embedding of the security protocol specification language MSR into an extension of rewriting logic with dependent types. The latter is 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. The encoding presented in this paper has served as the basis for the implementation of an MSR specification and analysis environment using the first-order rewriting engine Maude.

Keywords

Security protocolMultiset rewritingSpecificationDependent types

Copyright information

© Springer Science+Business Media, LLC 2007