[llvm-commits] CVS: llvm/www/pubs/2003-04-29-DataStructureAnalysisTR.html

Sun May 11 16:36:01 PDT 2003

Changes in directory llvm/www/pubs:

2003-04-29-DataStructureAnalysisTR.html added (r1.1)

---
Log message:

Initial checkin

---
Diffs of the changes:

Index: llvm/www/pubs/2003-04-29-DataStructureAnalysisTR.html
diff -c /dev/null llvm/www/pubs/2003-04-29-DataStructureAnalysisTR.html:1.1
*** /dev/null	Sun May 11 16:35:35 2003
--- llvm/www/pubs/2003-04-29-DataStructureAnalysisTR.html	Sun May 11 16:35:25 2003
***************
*** 0 ****
--- 1,63 ----
+ <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+ <html><head>
+ <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+ <title>Data Structure Analysis: An Efficient Context-Sensitive Heap Analysis</title>
+ </head>
+ <body bgcolor="#FFFFFF" text="#000000"> <!-- leftmargin="0" marginwidth="0" -->
+ 
+ <p align="center"><br>
+ 
+ <font size="6" face="Georgia,Palatino,Times,Roman"><b>
+   Data Structure Analysis: <br>An Efficient Context-Sensitive Heap Analysis
+ </b></font><br>
+ 
+ <font size=4>
+    <a href="http://www.nondot.org/sabre/">Chris Lattner</a> and
+    <a href="http://www.cs.uiuc.edu/~vadve">Vikram Adve</a>
+ </font></p>
+ 
+ 
+ <h2>Abstract:</h2>
+ <blockquote>
+ This paper presents an efficient context-sensitive heap analysis algorithm
+ called Data Structure Analysis designed to enable analyses and transformations
+ on entire disjoint recursive data structures.  The analysis has several
+ challenging properties needed to enable such transformations:
+ <i>context-sensitivity with cloning</i> (essential for proving disjointness),
+ <i>field-sensitivity</i>, and the use of an <i>explicit heap model</i> rather
+ than just alias information.  It is also applicable to arbitrary C programs.  To
+ our knowledge no prior work provides all these properties <i>and</i> is
+ efficient and scalable enough for large programs.  Measurements for 29 programs
+ show that the algorithm is extremely fast, space-efficient, and scales almost
+ linearly across 3 orders-of-magnitude of code size.
+ 
+ </blockquote>
+ 
+ <h2>Published:</h2>
+ <ul>
+   "Data Structure Analysis: An Efficient Context-Sensitive Heap Analysis",
+       Chris Lattner & Vikram Adve<br>
+   Technical Report #UIUCDCS-R-2003-2340, Computer Science Dept., Univ. of Illinois, Apr. 2003.
+ </ul>
+ 
+ <h2>Download:</h2>
+ <ul>
+ <li><a href="2003-04-29-DataStructureAnalysisTR.ps">Data Structure Analysis: An Efficient Context-Sensitive Heap Analysis</a> (PS)
+ <li><a href="2003-04-29-DataStructureAnalysisTR.pdf">Data Structure Analysis: An Efficient Context-Sensitive Heap Analysis</a> (PDF)
+ </ul>
+ 
+ <h2>Bibtex Entry:</h2>
+ <pre>
+   @TechReport{LattnerAdve:DSA,
+     Author      = {Chris Lattner and Vikram Adve},
+     Title       = {Data Structure Analysis: An Efficient Context-Sensitive Heap Analysis},
+     Institution = {Computer Science Dept.,
+                    Univ. of Illinois at Urbana-Champaign},
+     Number      = {UIUCDCS-R-2003-2340},
+     Type        = {Tech. Report},
+     Month       = {Apr},
+     Year        = {2003}
+   }
+ </pre>
+ 
+ </body></html>