Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp015m60qv74k
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorDvir, Zeev-
dc.contributor.advisorAppel, Andrew-
dc.contributor.authorVassilev, Katja-
dc.date.accessioned2019-07-26T12:23:24Z-
dc.date.available2019-07-26T12:23:24Z-
dc.date.created2019-05-06-
dc.date.issued2019-07-26-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/dsp015m60qv74k-
dc.description.abstractDead parameter elimination is an optimization which can be performed on programs in an intermediate phase of the CertiCoq compiler to eliminate parameters which are not live in the function. Here, I provide an implementation of dead parameter elimination as well as an abstract relation $\leadsto_{live}$ which describes the transformation. I prove this relation correct with respect to the semantics of the CPS lambda calculus of the intermediate phase of the compiler. I also make use of existing relations on such programs in the proofs presented. We also show that the transformation preserves the time and space of the input program. The proofs are written and verified in Coq.en_US
dc.format.mimetypeapplication/pdf-
dc.language.isoenen_US
dc.titleSpecification of the Dead Parameter Elimination Optimization of the CertiCoq Compileren_US
dc.typePrinceton University Senior Theses-
pu.date.classyear2019en_US
pu.departmentMathematicsen_US
pu.pdf.coverpageSeniorThesisCoverPage-
pu.contributor.authorid961181928-
Appears in Collections:Mathematics, 1934-2023

Files in This Item:
File Description SizeFormat 
VASSILEV-KATJA-THESIS.pdf631.07 kBAdobe PDF    Request a copy


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.