Choreographies and Cost Semantics for Reliable Communicating Systems
Licentiate thesis, 2020
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
Author
Alejandro Gómez Londoño
Chalmers, Computer Science and Engineering (Chalmers), Formal methods
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
Swedish Foundation for Strategic Research (SSF) (FFL15-0191), 2017-01-01 -- 2021-12-31.
Areas of Advance
Information and Communication Technology
Subject Categories
Computer Science
Computer Systems
Publisher
Chalmers