Strand spaces with choice via a process algebra semantics
From MaRDI portal
Publication:6175115
DOI10.1007/978-3-031-31476-6_17zbMath1529.94036arXiv1904.09946MaRDI QIDQ6175115
No author found.
Publication date: 17 August 2023
Published in: Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.09946
Cryptography (94A60) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- State space reduction in the Maude-NRL protocol analyzer
- Conditional rewriting logic as a unified model of concurrency
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Symbolic Protocol Analysis with Disequality Constraints Modulo Equational Theories
- A Probabilistic Applied Pi–Calculus
- Adding Branching to the Strand Space Model
- Mobile values, new names, and secure communication
This page was built for publication: Strand spaces with choice via a process algebra semantics
