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
The Expressive Power of Monotonic Parallel Composition
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: Programming Languages and Systems, Berlin: Springer, 2016, 780-803 p.Conference paper, Published paper (Refereed)
Resource type
Text
Place, publisher, year, edition, pages
Berlin: Springer, 2016. 780-803 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 9632
National Category
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-297465DOI: 10.1007/978-3-662-49498-1_30ISI: 000401936100030ISBN: 978-3-662-49497-4 (print)OAI: oai:DiVA.org:uu-297465DiVA: diva2:941906
Conference
ESOP 2016, April 3–7, Eindhoven, The Netherlands
Available from: 2016-03-22 Created: 2016-06-23 Last updated: 2017-12-14Bibliographically approved
In thesis
1. 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: 261 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