In response, this dissertation presents a fast, flow-sensitive type-recovery algorithm based on the linear-time, flow-insensitive sub-0CFA. The algorithm has been implemented as an experimental optimization into Chez Scheme compiler, where it has proven to be effective, justifying the elimination of about 60% of run-time type checks in a large set of bench-marks. The algorithm processes on average over 100,000 lines of code per second and scales well asymptotically, running in only O(n log n) time. This compile-time performance and scalability is achieved through a novel combination of data structures and algorithms.
Some files may require a special program or browser plug-in. More Information
|Advisor:||Dybvig, R. Kent|
|Commitee:||Ahmed, Amal, Leivant, Daniel, Sabry, Amr|
|School Location:||United States -- Indiana|
|Source:||DAI-B 73/04, Dissertation Abstracts International|
|Keywords:||Control-flow, Flow sensitivity, Linear-log time, Type recovery|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
supplemental files is subject to the ProQuest Terms and Conditions of use.