In English

Methods for using Agda to prove Safety and Liveness for Concurrent Programs

Erik Bergsten ; Oskar Larsson ; Tobias Rastemo ; Oskar Rutqvist ; Anderas Standar
Göteborg : Chalmers tekniska högskola, 2017. 46 s.
[Examensarbete för kandidatexamen]

It is hard and error-prone to prove that a given concurrent program has a given property. To help develop such proofs, a modern implementation of dependent type theory, the proof checking tool Agda [Nor09], is used. The methods are based on the semi-formal theory of the semantics of concurrent programming from [OL82] (Owicki and Lamport, 1981);. The formalisation and implementation in Agda is done with two di erent approaches, which we call Proof by Construction and Proof by Control Flow. The rst uses the dependent data types of Agda to create proofs in the form of type elements. The second uses recursive functions to check proofs written down as a tree of steps. With each method, how to prove liveness properties for concurrent programs is shown. For safety properties, time constraints restricted the work to proofs for sequential programs. The Agda implementations of these methods work well, but like formal and manually constructed proofs our machine checked proofs are still long and tedious. The implementations have potential for further development.



Publikationen registrerades 2017-08-16.

CPL ID: 251204

Detta är en tjänst från Chalmers bibliotek