Refactoring SASyLF Proofs

dc.contributor.advisorJohn T Boyland
dc.contributor.committeememberChristine Cheng
dc.contributor.committeememberTian Zhao
dc.creatorRodenbeck, Kayla
dc.date.accessioned2025-01-16T18:38:04Z
dc.date.available2025-01-16T18:38:04Z
dc.date.issued2021-05-01
dc.description.abstractRefactoring is a common practice undertaken by software developers that is used to improve the quality of existing code. Originally done by hand, several automated refactorings have been introduced over the years, saving both time and effort expended by the developer. Proof engineering, on the other hand, is a more recent concept which has not advanced as quickly over the years, thus they do not have similar tools to be able to make similar changes automatically. Since proof assistants resemble programming languages in many regards, a similar practice may be applied.Thus, the main idea behind this thesis is introduced. The topic of refactoring is discussed, and how it can be applied to proof assistants as well as for programming languages. The framework of the proof assistant SASyLF is also introduced, including a description of its different components and its syntax. Additionally, some related work regarding proof refactoring is mentioned.
dc.identifier.urihttp://digital.library.wisc.edu/1793/87179
dc.relation.replaceshttps://dc.uwm.edu/etd/2720
dc.titleRefactoring SASyLF Proofs
dc.typethesis
thesis.degree.disciplineComputer Science
thesis.degree.grantorUniversity of Wisconsin-Milwaukee
thesis.degree.nameMaster of Science

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Rodenbeck_uwm_0263M_12982.pdf
Size:
263.97 KB
Format:
Adobe Portable Document Format
Description:
Main File