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
A Fully Abstract Encoding of the pi-Calculus with Data Terms
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
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
2005 (English)In: Proceedings of ICALP 2005 / [ed] Luís Caires; Guiseppe F. Italiano; Luís Monteiro; Catuscia Palamidessi; Moti Yung, Berlin: Springer , 2005, 1202-1213 p.Conference paper, Published paper (Refereed)
Abstract [en]

The π-calculus with data terms (πT) extends the pure π-calculus by data constructors and destructors and allows data to be transmitted between agents. It has long been known how to encode such data types in π, but until now it has been open how to make the encoding fully abstract, meaning that two encodings (in π) are semantically equivalent precisely when the original πT agents are semantically equivalent. We present a new type of encoding and prove it to be fully abstract with respect to may-testing equivalence. To our knowledge this is the first result of its kind, for any calculus enriched with data terms. It has particular importance when representing security properties since attackers can be regarded as may-test observers. Full abstraction proves that it does not matter whether such observers are formulated in π or πT, both are equally expressive in this respect. The technical new idea consists of achieving full abstraction by encoding data as table entries rather than active processes, and using a firewalled central integrity manager to ensure data security.

Place, publisher, year, edition, pages
Berlin: Springer , 2005. 1202-1213 p.
Series
Lecture notes in computer science, ISSN 0302-9743 ; 3580
National Category
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-74247DOI: 10.1007/11523468_97ISBN: 3540275800 (print)OAI: oai:DiVA.org:uu-74247DiVA: diva2:102157
Conference
Automata, languages and programming : 32nd international colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005
Available from: 2006-01-01 Created: 2006-01-01 Last updated: 2016-02-25

Open Access in DiVA

No full text

Other links

Publisher's full texthttp://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/11523468_97

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: 655 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