A Formal Theory of Correct-by-Construction Refactorings
The goal of this project is to prove formally that certain refactorings of a simple programming language preserve the static and dynamic semantics of the program. Building on top of this, we could then try to build a meta-language where we can express refactorings that are correct-by-construction.
Contacts for the project
Supervisor(s): Jesper Cockx, Casper Bach Poulsen
Posted: October 25, 2022