Optimizing a Solver of Polymorphism Constraints: SEMI </HEAD> <BODY> <h2>Optimizing a Solver of Polymorphism Constraints: SEMI</h2> <h3> <B>Author: </B>Robert O'Callahan<br> </h3> <p> Technical Report CMU-CS-99-136.<br> <p> Download the <a HREF="/afs/cs.cmu.edu/project/compose/ftp/CMU-CS-99-136.ps"> Postscript</a> or <a HREF="/afs/cs.cmu.edu/project/compose/ftp/pdf/CMU-CS-99-136.pdf"> PDF</a> <H2>Abstract</H2> As part of the Ajax system for analyzing Java bytecode programs, I have developed an analysis called SEMI, based on type inference with polymorphic recursion. SEMI has a number of optimizations which significantly decrease the time and space requirements for analyzing large programs. These optimizations exploit the characteristics of Java programs to make analysis tractable. These assumptions, and the optimizations that follow from them, may apply in other domains using type inference with polymorphic recursion. In this report, I describe the SEMI algorithm, the optimizations it incorporates, and the characteristics of Java programs that justify the optimizations. <p> <hr> <p> <font size="2">Brought to you by <a href="http://www.cs.cmu.edu/~Compose/"><font size="2">Composable Software Systems Research Group</font></a><font size="2"> in the </font><a href="http://www.cs.cmu.edu/SCS-HOME.html"><font size="2">School of Computer Science</font></a><font size="2"> at </font><a href="http://www.cmu.edu"><font size="2">Carnegie Mellon University</font></a><font size="2">. </font></p> <font size="2">[Last modified 23-Aug-1999.<br> Mail suggestions to the </font><a href="mailto:compose@cs.cmu.edu"><font size="2">Maintainer</font></a><font size="2">.] </font> </body> </html>