Choreographies and Cost Semantics for Reliable Communicating Systems
Licentiatavhandling, 2020

Communicating systems have become ubiquitous in today's society.
Unfortunately, the complexity of their interactions makes them
particularly prone to failures such as deadlocked states caused
by misbehaving components, or memory exhaustion due to a surge in
message traffic (malicious or not). These vulnerabilities
constitute a real risk to users, with consequences ranging from
minor inconveniences to the possibility of loss of life and
capital. This thesis presents two results that aim to increase
the reliability of communicating systems. First, we implement a
choreography language which by construction can only describe
systems that are deadlock-free. Second, we develop a cost
semantics to prove programs free of out-of-memory errors. Both of
these results are formalized in the HOL4 theorem prover and
integrated with the CakeML verified stack.

Functional Programming

theorem provers

Compilers

Program Verification

Concurrency

CSE EDIT 8103
Opponent: Tjark Weber, Uppsala Universiry, Sweden

Författare

Alejandro Gómez Londoño

Chalmers, Data- och informationsteknik, Formella metoder

A. Gómez-Londoño, J. Pohjola, H. Syeda, M. Myreen, Y. Tan. Do You Have Space for Dessert?

J. Pohjola, A. Gómez-Londoño, J. Shaker, M. Norrish. An end-to-end verified compiler for a choreography language

Pålitlig mjukvara via programmering och kompilering i logik

Stiftelsen för Strategisk forskning (SSF), 2017-01-01 -- 2021-12-31.

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Datavetenskap (datalogi)

Datorsystem

Utgivare

Chalmers tekniska högskola

CSE EDIT 8103

Online

Opponent: Tjark Weber, Uppsala Universiry, Sweden

Mer information

Senast uppdaterat

2020-08-05