uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Spi Calculus Translated to pi-Calculus Preserving May-Tests
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (Mobility)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (Mobility)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (Mobility)ORCID iD: 0000-0003-0174-9032
2004 (English)In: Proceedings of LICS 2004: Logic in Computer Science, Los Alamitos, Calif: IEEE Computer Society, 2004, 22-31 p.Conference paper, Published paper (Refereed)
Abstract [en]

We present a concise and natural encoding of the spi-calculus into the more basic pi-calculus and establish its correctness with respect to a formal notion of testing. This is particularly relevant for security protocols modelled in spi since the tests can be viewed as adversaries. The translation has been implemented in a prototype tool. As a consequence, protocols can be described in the spi calculus and analysed with the emerging flora of tools already available for pi. The translation also entails a more detailed operational understanding of spi since high level constructs like encryption are encoded in a well known lower level. The formal correctness proof is nontrivial and interesting in its own; so called context bisimulations and new techniques for compositionality make the proof simpler and more concise.

Place, publisher, year, edition, pages
Los Alamitos, Calif: IEEE Computer Society, 2004. 22-31 p.
Series
Proceedings / Symposium on Logic in Computer Science, ISSN 1043-6871
National Category
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-71921DOI: 10.1109/LICS.2004.1319597ISBN: 0769521924 (print)OAI: oai:DiVA.org:uu-71921DiVA: diva2:99832
Conference
19th Annual IEEE Symposium on Logic in Computer Science, LICS 2004 : Turku, Finland, 13 - 17 July 2004
Available from: 2005-09-16 Created: 2005-09-16 Last updated: 2016-02-25Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full texthttp://csdl.computer.org/comp/proceedings/lics/2004/2192/00/2192toc.htm

Authority records BETA

Baldamus, MichaelParrow, JoachimVictor, Björn

Search in DiVA

By author/editor
Baldamus, MichaelParrow, JoachimVictor, Björn
By organisation
Computing Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 414 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf