|
Rapid Type Analysis (RTA)
is an algorithm for the efficient creation of call graphs for
object-oriented languages, and is the basis for many optimization
algorithms in compilers and tools for object-oriented languages
like Java and C++.
Rapid Type Analysis was designed to occupy a "sweet spot" in the
design space of algorithms for determining code reachability in
object-oriented programs. It is quite precise while still being
very fast (linear time). In particular, it is significantly more
precise than class hierarchy analysis (CHA) and significantly
faster than methods based on pointer alias analysis or 0-CFA.
Rapid Type Analysis was developed as part of
David F. Bacon's Ph.D. Thesis
and has resulted in three
patents.
It also provides the basis for
JAX
(the Java Application Extractor) and
Websphere
Studio Device Developer.
| 
Other
projects in