A Formalization of Natural Semantics of Imperative Programming Languages in Coq

Simple item page
dc.contributor.advisorHubbers, E.M.G.M.
dc.contributor.advisorWiedijk, F.
dc.contributor.authorKruger, L.
dc.date.issued2020-07-09
dc.description.abstractIn this thesis, we construct a formalization of natural semantics of imperative programming languages in Coq. Speci cally to use in the course Semantics and Correctness. We use already existing formalizations, like Software Foundations [13], to make a formalization that matches the theory and notation used in the course. The formalization covers the topics discussed during the course Semantics and Correctness and a few extensions of While. Then, we construct non-trivial proofs using the framework to show how it should be used. Lastly, we conducted an experiment to test whether the formalization can help students of the course Semantics and Correctness to better understand the proofs. Due to small sample size there are inconclusive results on whether the formalization actually helps the students to better understand the proofs. However, there are many possible improvements possible to make the formalization more useful.en_US
dc.embargo.lift10000-01-01
dc.embargo.typePermanent embargoen_US
dc.identifier.urihttps://theses.ubn.ru.nl/handle/123456789/12646
dc.language.isoenen_US
dc.thesis.facultyFaculteit der Sociale Wetenschappenen_US
dc.thesis.specialisationBachelor Artificial Intelligenceen_US
dc.thesis.studyprogrammeArtificial Intelligenceen_US
dc.thesis.typeBacheloren_US
dc.titleA Formalization of Natural Semantics of Imperative Programming Languages in Coqen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
1001459 Kruger.pdf
Size:
1.11 MB
Format:
Adobe Portable Document Format
Download
Collections
Faculteit der Sociale Wetenschappen