Javascript must be enabled for the correct page display

An Exercise on Program Equivalence for Message-passing Processes

Udrescu, Bianca (2019) An Exercise on Program Equivalence for Message-passing Processes. Bachelor's Thesis, Computing Science.


Download (606kB) | Preview
[img] Text
Restricted to Registered users only

Download (56kB)


This paper represents an extension to the research output extracted from the paper “Minimal Session Types” [1] authored by A. Arslanagić, J. A. Pérez, and E. Voogd in the context of the bachelors project presented in the final year of the Computing Science degree. Delving into one of the fundamental aspects or concurrency, this project analyzes equivalence between message-passing programs by using a popular technique in process calculi called simulation. Following the recent research in the previously mentioned paper, it was concluded that certain message-passing programs can be decomposed into smaller pieces denoted as trios or concerts. A program P, will be decomposed into another program D(P ) typed using minimal session types by applying a breakdown function on its inner component values. My scientific contribution to the fundamental computing group is a proof showcasing the equivalence relation between P and its decomposition, D(P). As a prerequisite to the deliverable, my research includes an in-depth look into mathematical models of processes including π-calculus, Higher-order π-calculus and the analysis of program equivalence techniques including weak and strong simulation and bi-simulation.

Item Type: Thesis (Bachelor's Thesis)
Supervisor name: Perez Parra, J.A. and Renardel de Lavalette, G.R.
Degree programme: Computing Science
Thesis type: Bachelor's Thesis
Language: English
Date Deposited: 08 Oct 2019
Last Modified: 10 Oct 2019 09:34

Actions (login required)

View Item View Item