Xhelo, Evrikli (2019) Strong Normalization in Message-Passing Concurrency. Bachelor's Thesis, Computing Science.
|
Text
THESIS.pdf Download (586kB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
Text
Toestemming.pdf Restricted to Registered users only Download (142kB) |
Abstract
This bachelor thesis is concerned with the termination property of message-passing concurrent systems. Type systems provide an approach to studying the behaviours of running processes and determining their resource usage and capability to terminate successfully. However, no standard rules can be defined so as to guarantee that a process will finish executing without having to execute it in the first place. We study two type systems that have been proposed for concurrent processes. More precisely, we have worked with one type system that is based upon intuitionistic linear logic from Caires, Pfenning and Toninho, and the core type system from Deng and Sangiorgi. Both papers propose their own approach to process and channel types, as well as typing rules, and both papers use formalisms based on pi-calculus. We seek to determine how the two systems relate to one another and whether they share similarities in their respective approaches to typing terminating processes.
| Item Type: | Thesis (Bachelor's Thesis) |
|---|---|
| Supervisor name: | Perez Parra, J.A. |
| Degree programme: | Computing Science |
| Thesis type: | Bachelor's Thesis |
| Language: | English |
| Date Deposited: | 26 Jul 2019 |
| Last Modified: | 26 Jul 2019 14:43 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/20448 |
Actions (login required)
 |
View Item |