Date of Original Version

2007

Type

Article

Rights Management

DOI 10.1007/s10990-007-9003-3

Abstract or Table of Contents

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.

Comments

The original publication is available at www.springerlink.com Higher-Order and Symbolic Computation (2007) 20:3–35 DOI 10.1007/s10990-007-9003-3

Share

COinS