The following pages link to (Q4230922):
Displaying 22 items.
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols (Q511946) (← links)
- Ping-pong protocols as prefix grammars: modelling and verification via program transformation (Q739638) (← links)
- Deciding knowledge in security protocols under equational theories (Q860894) (← links)
- Decidability issues for extended ping-pong protocols (Q861694) (← links)
- Linearity and bisimulation (Q997996) (← links)
- A calculus for cryptographic protocols: The spi calculus (Q1283776) (← links)
- Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity (Q2119978) (← links)
- Bisimulation and coinduction enhancements: a historical perspective (Q2280213) (← links)
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols (Q2368990) (← links)
- Open bisimulation, revisited (Q2465030) (← links)
- Automated verification of selected equivalences for security protocols (Q2474047) (← links)
- Cryptographic logical relations (Q2481976) (← links)
- Information flow security in boundary ambients (Q2482455) (← links)
- Bisimulation-based Non-deterministic Admissible Interference and its Application to the Analysis of Cryptographic Protocols (Q2841265) (← links)
- Modal Logics for Cryptographic Processes (Q2842609) (← links)
- (Q2842870) (← links)
- Companions, Codensity and Causality (Q2988363) (← links)
- A Testing Theory for a Higher-Order Cryptographic Language (Q3000588) (← links)
- Formalising Observer Theory for Environment-Sensitive Bisimulation (Q3183528) (← links)
- A Complete Symbolic Bisimilarity for an Extended Spi Calculus (Q5170184) (← links)
- Bisimulation and Co-induction: Some Problems (Q5262977) (← links)
- When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus (Q6041667) (← links)
