A Formally Verified Compiler for Programs that Deal with Cached Address Translation
dc.contributor.author | Andersson, Johan | |
dc.contributor.department | Chalmers tekniska högskola / Institutionen för data och informationsteknik | sv |
dc.contributor.examiner | Ahrendt, Wolfgang | |
dc.contributor.supervisor | Taqdees Syeda, Hira | |
dc.date.accessioned | 2020-07-08T07:26:01Z | |
dc.date.available | 2020-07-08T07:26:01Z | |
dc.date.issued | 2020 | sv |
dc.date.submitted | 2020 | |
dc.description.abstract | Security in modern operating systems ultimately relies on the paging mechanism of the processor, which in turn relies upon the translation lookaside buffer (TLB). One method of showing the correctness of operating systems is formal verification, but previous work has left the correctness of the TLB as an assumption. Later work on the correctness of the TLB and high-level languages respectively leaves a gap. In this report, we investigate how to develop and verify a compiler that preserves the TLB consistency of high-level languages, bridging the gap. We describe the considerations when implementing such a compiler, the roadblocks encountered, and the result. We end with stating the compiler correctness theorem and then discuss the state of the compiler and future work. | sv |
dc.identifier.coursecode | DATX05 | sv |
dc.identifier.uri | https://hdl.handle.net/20.500.12380/301372 | |
dc.language.iso | eng | sv |
dc.setspec.uppsok | Technology | |
dc.subject | Compiler | sv |
dc.subject | Translation lookaside buffer | sv |
dc.subject | Verification | sv |
dc.subject | Formal methods | sv |
dc.subject | Language | sv |
dc.title | A Formally Verified Compiler for Programs that Deal with Cached Address Translation | sv |
dc.type.degree | Examensarbete för masterexamen | sv |
dc.type.uppsok | H |