On the Semantic Equivalence of a Program and Any of its Intermediate Representations
Description
The central goal of this thesis is to develop a practical approach to validating the correctness of SSA forms. Since achieving this goal is very involved for a general program, we restrict our attention to simple programs. In particular, the programs we consider are loop-free and are comprised of simple assignments to scalar variables, as well as input and output statements. Even for such a simple program, a full formal treatment would be very involved, extending beyond the scope of an undergraduate honors thesis.
Date Created
The date the item was original created (prior to any relationship with the ASU Digital Repositories.)
2015-05
Agent
- Author (aut): Lusi, Dylan Patrick
- Thesis director: Bazzi, Rida
- Committee member: Fainekos, Georgios
- Contributor (ctb): Barrett, The Honors College
- Contributor (ctb): School of Mathematical and Statistical Sciences
- Contributor (ctb): Computer Science and Engineering Program