![136275-Thumbnail Image.png](https://d1rbsgppyrdqq4.cloudfront.net/s3fs-public/styles/width_400/public/2021-05/136275-Thumbnail%20Image.png?versionId=gp3Fgs_Id6bCvnK9CK4lromDw2eC0RjA&X-Amz-Content-Sha256=UNSIGNED-PAYLOAD&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIASBVQ3ZQ42ZLA5CUJ/20240619/us-west-2/s3/aws4_request&X-Amz-Date=20240619T174728Z&X-Amz-SignedHeaders=host&X-Amz-Expires=120&X-Amz-Signature=0f4ea49f18fa6f00660cc857e79fde1091b2aef29927b85686b9b973966ed573&itok=MS8Bcz8A)
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.
Details
Title
- On the Semantic Equivalence of a Program and Any of its Intermediate Representations
Contributors
- Lusi, Dylan Patrick (Author)
- Bazzi, Rida (Thesis director)
- Fainekos, Georgios (Committee member)
- Barrett, The Honors College (Contributor)
- School of Mathematical and Statistical Sciences (Contributor)
- Computer Science and Engineering Program (Contributor)
Date Created
The date the item was original created (prior to any relationship with the ASU Digital Repositories.)
2015-05
Resource Type
Collections this item is in