MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
A symbolic semantics for the &pgr;-calculus
Information and Computation
A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Constraint solving for bounded-process cryptographic protocol analysis
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Complete inference systems for weak bisimulation equivalences in the π-calculus
Information and Computation
Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Theoretical Computer Science - Special issue: Foundations of wide area network computing
A method for symbolic analysis of security protocols
Theoretical Computer Science
Deciding security of protocols against off-line guessing attacks
Proceedings of the 12th ACM conference on Computer and communications security
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
A Complete Symbolic Bisimilarity for an Extended Spi Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A Method for Proving Observational Equivalence
CSF '09 Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium
Psi-calculi: Mobile Processes, Nominal Data, and Logic
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
A Complete Symbolic Bisimulation for Full Applied Pi Calculus
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Symbolic bisimulation for the applied pi calculus
Journal of Computer Security - Security Issues in Concurrency (SecCo'07)
| Hi-index | 5.23 |
Symbolic characterisations of bisimilarities for the applied pi calculus proposed so far are sound but incomplete, even restricted to the finite fragment of the calculus. In this paper we present a novel approach to symbolic semantics for the applied pi calculus, leading to a notion of symbolic bisimulation which is both sound and complete with respect to the standard labelled bisimilarity. Moreover, our framework accommodates replications hence works for the full calculus.