Efficient and timely mutual authentication
ACM SIGOPS Operating Systems Review
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Handbook of logic in computer science (vol. 2)
Specification and proof in membership equational logic
Theoretical Computer Science - Trees in algebra and programming
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
A Meta-Notation for Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
A Formal Analysis of Some Properties of Kerberos 5 Using MSR
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Data access specification and the most powerful symbolic attacker in MSR
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
Theoretical Computer Science - Automated reasoning for security protocol analysis
The rewriting logic semantics project
Theoretical Computer Science
A rewriting logic approach to operational semantics
Information and Computation
Memory Representations in Rewriting Logic Semantics Definitions
Electronic Notes in Theoretical Computer Science (ENTCS)
The Rewriting Logic Semantics Project
Electronic Notes in Theoretical Computer Science (ENTCS)
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Formal foundations for situation awareness based on dependent type theory
Information Fusion
| Hi-index | 0.00 |
This paper presents a shallow and hence efficient embedding of the security protocol specification 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.