PureCake: Towards a formally verified non-strict language compiler
| dc.contributor.author | ZANETTI, RICCARDO | |
| dc.contributor.department | Chalmers tekniska högskola / Institutionen för data och informationsteknik | sv |
| dc.contributor.examiner | Hughes, John | |
| dc.contributor.supervisor | Myreen, Magnus | |
| dc.date.accessioned | 2021-04-23T09:04:38Z | |
| dc.date.available | 2021-04-23T09:04:38Z | |
| dc.date.issued | 2020 | sv |
| dc.date.submitted | 2020 | |
| dc.description.abstract | CakeML is an end-to-end formally verified compiler for a subset of the Standard ML language. Its provenly correct compilation chain prevents several classes of software bugs from seeping into the project, while drastically reducing the chances of many others to occur. In turn, other software projects can be built on top of CakeML; their correctness can be proven with respect to CakeML semantics, and ultimately produce software that is itself end-to-end verified. The aim of this thesis is to bring a pure non-strict language variant (PureCake) into the project. The peculiar properties of the language, which include purity, referen tial transparency and equational reasoning facilitate the proof process, ultimately encouraging the spread of formal methods. | sv |
| dc.identifier.coursecode | MPALG | sv |
| dc.identifier.uri | https://hdl.handle.net/20.500.12380/302318 | |
| dc.language.iso | eng | sv |
| dc.setspec.uppsok | Technology | |
| dc.subject | compilers | sv |
| dc.subject | formal verification | sv |
| dc.subject | interactive theorem provers | sv |
| dc.subject | functional programming | sv |
| dc.subject | formal semantics of programming languages | sv |
| dc.subject | code optimizations | sv |
| dc.subject | inlining | sv |
| dc.title | PureCake: Towards a formally verified non-strict language compiler | sv |
| dc.type.degree | Examensarbete för masterexamen | sv |
| dc.type.uppsok | H | |
| local.programme | Computer systems and networks (MPCSN), MSc |