Change search
CiteExportLink to record
Permanent link

Direct link
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Symbolic Bisimulation in the Spi Calculus
2004 (English)In: CONCUR 2004: Concurrency theory, proceedings / [ed] P. Gardner and N. Yoshida, Berlin Heidelberg: Springer Berlin/Heidelberg, 2004, Vol. 3170, 161-176 p.Conference paper, Published paper (Refereed)
Abstract [en]

The spi calculus is an executable model for the description and analysis of cryptographic protocols. Security objectives like secrecy and authenticity can be formulated as equations between spi calculus terms, where equality is interpreted as a contextual equivalence. One problem with verifying contextual equivalences for message-passing process calculi is the infinite branching on process input. In this paper, we propose a general symbolic semantics for the spi calculus, where an input prefix gives rise to only one transition. To avoid infinite quantification over contexts, non-contextual concrete bisimulations approximating barbed equivalence have been defined. We propose a symbolic bisimulation that is sound with respect to barbed equivalence, and brings us closer to automated bisimulation checks.

Place, publisher, year, edition, pages
Berlin Heidelberg: Springer Berlin/Heidelberg, 2004. Vol. 3170, 161-176 p.
Lecture Notes in Computer Science, ISSN 0302-9743 ; 3170
National Category
Computer Science
URN: urn:nbn:se:uu:diva-161485DOI: 10.1007/978-3-540-28644-8_11ISBN: 3-540-22940-X (print)OAI: diva2:456278
International Conference on Concurrency Theory (CONCUR), 15th international conference, August 31 - September 3, 2004, London, UK
Available from: 2011-12-06 Created: 2011-11-14 Last updated: 2011-12-06Bibliographically approved

Open Access in DiVA

fulltext(521 kB)