When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied -calculus

Recommendations

Symbolic Bisimulation for the Applied Pi Calculus
A pure labeled transition semantics for the applied pi calculus
Bisimulations respecting duration and causality for the non-interleaving applied \(\pi\)-calculus
Stateful applied pi calculus: observational equivalence and labelled bisimilarity
Proof system for applied pi calculus

Cites work

scientific article; zbMATH DE number 3825707 (Why is no real title available?)
scientific article; zbMATH DE number 4039251 (Why is no real title available?)
scientific article; zbMATH DE number 92600 (Why is no real title available?)
scientific article; zbMATH DE number 1251177 (Why is no real title available?)
scientific article; zbMATH DE number 1302834 (Why is no real title available?)
scientific article; zbMATH DE number 1759615 (Why is no real title available?)
scientific article; zbMATH DE number 1848312 (Why is no real title available?)
scientific article; zbMATH DE number 1863170 (Why is no real title available?)
scientific article; zbMATH DE number 7350777 (Why is no real title available?)
scientific article; zbMATH DE number 7379295 (Why is no real title available?)
scientific article; zbMATH DE number 7577583 (Why is no real title available?)
scientific article; zbMATH DE number 7407774 (Why is no real title available?)
scientific article; zbMATH DE number 7407787 (Why is no real title available?)
scientific article; zbMATH DE number 3222098 (Why is no real title available?)
scientific article; zbMATH DE number 3413831 (Why is no real title available?)
A General Theory of Barbs, Contexts, and Labels
A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
A Unification Algorithm for Associative-Commutative Functions
A calculus of mobile processes. I
A characterisation of open bisimilarity using an intuitionistic modal logic
A complete symbolic bisimilarity for an extended spi calculus
A complete symbolic bisimulation for full applied pi calculus
A logic for true concurrency
A new approach to abstract syntax with variable binding
A procedure for deciding symbolic equivalence between sets of constraint systems
A proof theory for generic judgments
A proof theory for model checking
A theory of bisimulation for the -calculus
Abella: a system for reasoning about relational specifications
Algebraic laws for nondeterminism and concurrency
Analysing privacy-type properties in cryptographic protocols (invited talk)
Associative-commutative unification
Automated verification of equivalence properties of cryptographic protocols
Automated verification of selected equivalences for security protocols
Barbed bisimulation
CONCUR 2004 - Concurrency Theory
Canonical form for graphs in quasipolynomial time: preliminary report
Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity
Computing strong and weak bisimulations for psi-calculi
Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
Deciding knowledge in security protocols under equational theories
Deducibility constraints and blind signatures
From rewrite rules to bisimulation congruences
Hennessy-Milner properties via topological compactness
Intruder deduction problem for locally stable theories with normal forms and inverses
Mobile values, new names, and secure communication
Modal logics for mobile processes
Modal logics for nominal transition systems
On bisimulations for the spi calculus
On the bisimulation proof method
Open bisimulation, revisited
Private authentication
Processes against tests: on defining contextual equivalences
Programming Languages and Systems
Proof techniques for cryptographic processes
Psi-calculi: a framework for mobile processes with nominal data and logic
Quasi-open bisimilarity with mismatch is intuitionistic
Refinement of actions and equivalence notions for concurrent systems
SPEC: an equivalence checker for security protocols
Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS
Stochastic Relations: Congruences, Bisimulations and the Hennessy--Milner Theorem
The Applied Pi Calculus
The \(\pi\)-calculus: A theory of mobile processes
The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
Three logics for branching bisimulation

This page was built for publication: When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041667)