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
Bisimulation up-to techniques for psi-calculi
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)
2016 (English)In: Proc. 5th ACM SIGPLAN Conference on Certified Programs and Proofs / [ed] Avigad, J; Chlipala, A, New York: ACM Press, 2016, 142-153 p.Conference paper, Published paper (Refereed)
Abstract [en]

Psi-calculi is a parametric framework for process calculi similar to popular pi-calculus extensions such as the explicit fusion calculus, the applied pi-calculus and the spi calculus. Remarkably, machine-checked proofs of standard algebraic and congruence properties of bisimilarity apply to all calculi within the framework. Bisimulation up-to techniques are methods for reducing the size of relations needed in bisimulation proofs. In this paper, we show how these bisimulation proof methods can be adapted to psi-calculi. We formalise all our definitions and theorems in Nominal Isabelle, and show examples where the use of up to-techniques yields drastically simplified proofs of known results. We also prove new structural laws about the replication operator.

Place, publisher, year, edition, pages
New York: ACM Press, 2016. 142-153 p.
Keyword [en]
Bisimulation up-to, process calculus, psi-calculi, Isabelle, Nominal Isabelle, nominal logic
National Category
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-229008DOI: 10.1145/2854065.2854080ISI: 000389021600016ISBN: 9781450341271 (print)OAI: oai:DiVA.org:uu-229008DiVA: diva2:735357
Conference
CPP 2016, January 18–19, Saint Petersburg, FL
Available from: 2016-01-18 Created: 2014-07-25 Last updated: 2017-01-24Bibliographically approved
In thesis
1. Bells and Whistles: Advanced language features in psi-calculi
Open this publication in new window or tab >>Bells and Whistles: Advanced language features in psi-calculi
2013 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Psi-calculi is a parametric framework for process calculi similar to popular pi-calculus extensions such as the explicit fusion calculus, the applied pi-calculus and the spi calculus. Remarkably, machine-checked proofs of standard algebraic and congruence properties of bisimilarity apply to every instance of the framework.

The contribution of this licentiate thesis is to significantly extend the applicability and expressiveness of psi-calculi by incorporating several advanced language features into the framework: broadcasts, higher-order communication, generalised pattern matching, sorts and priorities. The extensions present several interesting technical challenges, such as negative premises. The machine-checked proofs for standard results about bisimilarity are generalised to each of these new settings, and the proof scripts are freely available online.

Place, publisher, year, edition, pages
Uppsala University, 2013
Series
Information technology licentiate theses: Licentiate theses from the Department of Information Technology, ISSN 1404-5117 ; 2013-004
National Category
Computer Science
Research subject
Computer Science
Identifiers
urn:nbn:se:uu:diva-227638 (URN)
Supervisors
Projects
UPMARC
Available from: 2013-10-04 Created: 2014-06-29 Last updated: 2017-08-31Bibliographically approved
2. Culling Concurrency Theory: Reusable and trustworthy meta-theory, proof techniques and separation results
Open this publication in new window or tab >>Culling Concurrency Theory: Reusable and trustworthy meta-theory, proof techniques and separation results
2016 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

As concurrent systems become ever more complex and ever more ubiquitous, the need to understand and verify them grows ever larger. For this we need formal modelling languages that are well understood, with rigorously verified foundations and proof techniques, applicable to a wide variety of concurrent systems.

Defining modelling languages is easy; there is a stupefying variety of them in the literature. Verifying their foundations and proof techniques, and developing an understanding of their interrelationship with other modelling languages, is difficult, tedious and error-prone. The contributions of this thesis support these tasks in reusable and trustworthy ways, by results that apply to a wide variety of modelling languages, verified to the highest standards of mathematical rigour in an interactive theorem prover.

To this end, we extend psi-calculi - a family of process calculi with reusable foundations for formal verification - with several new language features. We prove that the bisimulation meta-theory of psi-calculi carries over to these extended settings. This widens the scope of psi-calculi to important application areas, such as cryptography and wireless communication. We develop bisimulation up-to techniques - powerful proof techniques for showing that two processes exhibit the same observable behaviour - that apply to all psi-calculi. By showing how psi-calculi can encode dynamic priorities under very strong quality criteria, we demonstrate that the expressive power is greater than previously thought. Finally, we develop a simple and widely applicable technique for showing that a process calculus adds expressiveness over another, based on little more than whether parallel components may act independently or not. Many separation results, both novel ones and strengthenings of known results from the literature, emerge as special cases of this technique.

Place, publisher, year, edition, pages
Uppsala: Acta Universitatis Upsaliensis, 2016. 113 p.
Series
Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology, ISSN 1651-6214 ; 1397
National Category
Computer Science
Research subject
Computer Science
Identifiers
urn:nbn:se:uu:diva-297488 (URN)978-91-554-9639-5 (ISBN)
External cooperation:
Public defence
2016-09-22, ITC/2446, Lägerhyddsvägen 2, Uppsala, 13:15 (English)
Opponent
Supervisors
Available from: 2016-08-26 Created: 2016-06-23 Last updated: 2016-09-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Åman Pohjola, JohannesParrow, Joachim

Search in DiVA

By author/editor
Åman Pohjola, JohannesParrow, Joachim
By organisation
Computing Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 676 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