Automatic determination of may/must set usage in data-flow analysis
| dc.contributor.author | Stone, Andrew, author | |
| dc.contributor.author | Strout, Michelle, advisor | |
| dc.contributor.author | Rajopadhye, Sanjay Vishnu, committee member | |
| dc.contributor.author | Liu, Jiangguo, committee member | |
| dc.date.accessioned | 2007-01-03T04:32:32Z | |
| dc.date.available | 2007-01-03T04:32:32Z | |
| dc.date.issued | 2009 | |
| dc.description | Department Head: L. Darrell Whitley. | |
| dc.description.abstract | Data-flow analysis is a common technique for gathering program information for use in performance improving transformations such as register allocation, deadcode elimination, common subexpression elimination, and scheduling. Current tools for generating data-flow analysis implementations enable analysis details to be specified orthogonally to the solution algorithm, but still require implementation details regarding the may and must use and definition sets that occur due to the effects of pointers, side effects, arrays, and user-defined structures. This thesis presents the Data-Flow Analysis Generator tool (DFAGen), which enables analysis writers to generate pointer, aggregate, and side-effect cognizant analyzers for separable and nonseparable data-flow analyses, from a specification that assumes only scalars. By hiding the compiler-specific details behind predefined set definitions, the analysis specifications for the DFAGen tool are typically less than ten lines long and similar to those in standard compiler textbooks. The two main contributions of this work are the automatic determination of when to use the may or must variant of a predefined set reference in the analysis specification, and the design of the analysis specification language so that data-flow problem and compiler framework implementation details are specified orthogonally. | |
| dc.format.medium | masters theses | |
| dc.identifier | 2009_Summer_Stone_Andrew.pdf | |
| dc.identifier | ETDF2009100002COMS | |
| dc.identifier.uri | http://hdl.handle.net/10217/37716 | |
| dc.language | English | |
| dc.language.iso | eng | |
| dc.publisher | Colorado State University. Libraries | |
| dc.relation | Catalog record number (MMS ID): 991011896589703361 | |
| dc.relation | QA76.76.C65.S765 2009 | |
| dc.relation.ispartof | 2000-2019 | |
| dc.rights | Copyright and other restrictions may apply. User is responsible for compliance with all applicable laws. For information about copyright law, please see https://libguides.colostate.edu/copyright. | |
| dc.title | Automatic determination of may/must set usage in data-flow analysis | |
| dc.type | Text | |
| dcterms.rights.dpla | This Item is protected by copyright and/or related rights (https://rightsstatements.org/vocab/InC/1.0/). You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s). | |
| thesis.degree.discipline | Computer Science | |
| thesis.degree.grantor | Colorado State University | |
| thesis.degree.level | Masters | |
| thesis.degree.name | Master of Science (M.S.) |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- 2009_Summer_Stone_Andrew.pdf
- Size:
- 588.89 KB
- Format:
- Adobe Portable Document Format
- Description: