The following pages link to CONCUR 2004 - Concurrency Theory (Q5311472):
Displaying 16 items.
- Computing strong and weak bisimulations for psi-calculi (Q444457) (← links)
- First-order reasoning for higher-order concurrency (Q456466) (← links)
- A complete symbolic bisimulation for full applied pi calculus (Q1758155) (← links)
- Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity (Q2119978) (← links)
- A formal semantics for protocol narrations (Q2463562) (← links)
- Open bisimulation, revisited (Q2465030) (← links)
- Automated verification of selected equivalences for security protocols (Q2474047) (← links)
- Compositional equivalences based on open pNets (Q2683032) (← links)
- A Testing Theory for a Higher-Order Cryptographic Language (Q3000588) (← links)
- SPEC: An Equivalence Checker for Security Protocols (Q3179281) (← links)
- Formalising Observer Theory for Environment-Sensitive Bisimulation (Q3183528) (← links)
- Implementing Spi Calculus Using Nominal Techniques (Q3507444) (← links)
- A Complete Symbolic Bisimilarity for an Extended Spi Calculus (Q5170184) (← links)
- Automated Verification of Equivalence Properties of Cryptographic Protocols (Q5278194) (← links)
- Symbolic Bisimulation for the Applied Pi Calculus (Q5458829) (← links)
- When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus (Q6041667) (← links)
