A data-flow analysis method
| dc.contributor.advisor | Huang, J. | |
| dc.contributor.committeeMember | Bau, Betty | |
| dc.creator | Lim, Kwang Cook | |
| dc.date.accessioned | 2022-02-14T19:34:57Z | |
| dc.date.available | 2022-02-14T19:34:57Z | |
| dc.date.issued | 1976 | |
| dc.description.abstract | Presented in this thesis is a method by which one can determine for a given program graph (1) what data definitions reach each node in the graph, (2) what data items have an upward exposed use at each node, and (3) what data definitions are "live" on each edge in the graph. The method is developed based on the topological sorting of edges and the acyclic image of a program graph. It is conceptually simple and easy to implement. | |
| dc.description.department | Computer Science, Department of | |
| dc.format.digitalOrigin | reformatted digital | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.other | 3463507 | |
| dc.identifier.uri | https://hdl.handle.net/10657/8807 | |
| dc.language.iso | en | |
| dc.rights | This item is protected by copyright but is made available here under a claim of fair use (17 U.S.C. §107) for non-profit research and educational purposes. Users of this work assume the responsibility for determining copyright status prior to reusing, publishing, or reproducing this item for purposes other than what is allowed by fair use or other copyright exemptions. Any reuse of this item in excess of fair use or other copyright exemptions requires express permission of the copyright holder. | |
| dc.title | A data-flow analysis method | |
| dc.type.dcmi | Text | |
| dc.type.genre | Thesis | |
| thesis.degree.college | College of Natural Sciences and Mathematics | |
| thesis.degree.department | Computer Science, Department of | |
| thesis.degree.discipline | Computer Science | |
| thesis.degree.grantor | University of Houston | |
| thesis.degree.level | Masters | |
| thesis.degree.name | Master of Science |
Files
Original bundle
1 - 1 of 1