A Complete Symbolic Bisimilarity for an Extended Spi Calculus
2009 (English)In: Electronical Notes in Theoretical Computer Science, ISSN 1571-0661, Vol. 242, no 3, 3-20 p.Article in journal (Refereed) Published
Several symbolic notions of bisimilarity have been defined for the spi calculus and the applied pi calculus. In this paper, we treat a spi calculus with a general constructor-destructor message algebra, and define a symbolic bisimilarity that is both sound and complete with respect to its concrete counterpart.
Place, publisher, year, edition, pages
Amsterdam, The Netherlands: Elsevier, 2009. Vol. 242, no 3, 3-20 p.
Cryptographic Protocols; Formal Verification; Bisimulation; Symbolic Techniques
IdentifiersURN: urn:nbn:se:uu:diva-161494DOI: 10.1016/j.entcs.2009.07.078OAI: oai:DiVA.org:uu-161494DiVA: diva2:456317
SecCo 2008 6th International Workshop on Security Issues in Concurrency, August 23, 2008, Toronto, Canada
Conference paper presented at the SecCo 2008, 6th International Workshop on Security Issues in Concurrency, August 23, 2008, Toronto, Canada2011-12-062011-11-142011-12-06Bibliographically approved