[llvm-commits] CVS: llvm-www/pubs/2002-06-AutomaticPoolAllocation.html 2002-08-08-CASES02-ControlC.html 2002-08-09-LLVMCompilationStrategy.html 2002-12-LattnerMSThesis.html 2003-04-29-DataStructureAnalysisTR.html 2003-05-01-GCCSummit2003.html 2003-05-05-LCTES03-CodeSafety.html 2003-09-30-LifelongOptimizationTR.html 2003-10-01-LLVA.html
Misha Brukman
brukman at cs.uiuc.edu
Tue Oct 21 19:27:02 PDT 2003
Changes in directory llvm-www/pubs:
2002-06-AutomaticPoolAllocation.html updated: 1.4 -> 1.5
2002-08-08-CASES02-ControlC.html updated: 1.7 -> 1.8
2002-08-09-LLVMCompilationStrategy.html updated: 1.5 -> 1.6
2002-12-LattnerMSThesis.html updated: 1.3 -> 1.4
2003-04-29-DataStructureAnalysisTR.html updated: 1.3 -> 1.4
2003-05-01-GCCSummit2003.html updated: 1.7 -> 1.8
2003-05-05-LCTES03-CodeSafety.html updated: 1.4 -> 1.5
2003-09-30-LifelongOptimizationTR.html updated: 1.2 -> 1.3
2003-10-01-LLVA.html updated: 1.3 -> 1.4
---
Log message:
* Use <div>s instead of explicit <font> tags
* Favor <blockquote> over <ul> for indent
* Indent <li> within <ul>
* Delete unnecessary space and {} within BibTeX entry
---
Diffs of the changes: (+253 -243)
Index: llvm-www/pubs/2002-06-AutomaticPoolAllocation.html
diff -u llvm-www/pubs/2002-06-AutomaticPoolAllocation.html:1.4 llvm-www/pubs/2002-06-AutomaticPoolAllocation.html:1.5
--- llvm-www/pubs/2002-06-AutomaticPoolAllocation.html:1.4 Tue Oct 21 17:43:15 2003
+++ llvm-www/pubs/2002-06-AutomaticPoolAllocation.html Tue Oct 21 19:26:00 2003
@@ -8,14 +8,13 @@
<body>
-<p align="center"><br> <font size="6"
-face="Georgia,Palatino,Times,Roman">Automatic Pool Allocation for Disjoint Data
-Structures</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>
-
+<div class="pub_title">
+Automatic Pool Allocation for Disjoint Data Structures
+</div>
+<div class="pub_author">
+ <a href="http://www.nondot.org/sabre/">Chris Lattner</a> and
+ <a href="http://www.cs.uiuc.edu/~vadve">Vikram Adve</a>
+</div>
<h2>Abstract:</h2>
<blockquote>
@@ -36,29 +35,33 @@
</blockquote>
<h2>Published:</h2>
-<ul>
+<blockquote>
"Automatic Pool Allocation for Disjoint Data Structures",
- Chris Lattner & Vikram Adve,<br>
- ACM SIGPLAN <a href="http://research.microsoft.com/~trishulc/msp2002/">Workshop on Memory System Performance</a> (MSP),
- Berlin, Germany, June 2002.<br>
-</ul>
+ Chris Lattner & Vikram Adve,<br>
+ ACM SIGPLAN <a
+ href="http://research.microsoft.com/~trishulc/msp2002/">Workshop on Memory
+ System Performance</a> (MSP), Berlin, Germany, June 2002.<br>
+</blockquote>
<h2>Download:</h2>
<ul>
-<li><a href="2002-06-AutomaticPoolAllocation.ps">Automatic Pool Allocation for Disjoint Data Structures</a> (PS)
-<li><a href="2002-06-AutomaticPoolAllocation.pdf">Automatic Pool Allocation for Disjoint Data Structures</a> (PDF)
-<li><a href="2002-06-AutomaticPoolAllocation.ppt">Automatic Pool Allocation for Disjoint Data Structures</a> (Powerpoint slides)
+ <li><a href="2002-06-AutomaticPoolAllocation.ps">Automatic Pool Allocation for
+ Disjoint Data Structures</a> (PS)</li>
+ <li><a href="2002-06-AutomaticPoolAllocation.pdf">Automatic Pool Allocation
+ for Disjoint Data Structures</a> (PDF)</li>
+ <li><a href="2002-06-AutomaticPoolAllocation.ppt">Automatic Pool Allocation
+ for Disjoint Data Structures</a> (Powerpoint slides)</li>
</ul>
-<h2>Bibtex Entry:</h2>
+<h2>BibTeX Entry:</h2>
<pre>
@InProceedings{LattnerAdve:MSP02,
- Author = {Chris Lattner and Vikram Adve},
- Title = {{A}utomatic {P}ool {A}llocation for {D}isjoint {D}ata {S}tructures},
- Booktitle = {Proc. ACM SIGPLAN Workshop on Memory System Performance},
- Address = {Berlin, Germany},
- Month = {Jun},
- Year = {2002}
+ Author = "{Chris Lattner and Vikram Adve}",
+ Title = "{Automatic Pool Allocation for Disjoint Data Structures}",
+ Booktitle = "{Proc. ACM SIGPLAN Workshop on Memory System Performance}",
+ Address = "{Berlin, Germany}",
+ Month = {Jun},
+ Year = {2002}
}
</pre>
Index: llvm-www/pubs/2002-08-08-CASES02-ControlC.html
diff -u llvm-www/pubs/2002-08-08-CASES02-ControlC.html:1.7 llvm-www/pubs/2002-08-08-CASES02-ControlC.html:1.8
--- llvm-www/pubs/2002-08-08-CASES02-ControlC.html:1.7 Tue Oct 21 17:31:42 2003
+++ llvm-www/pubs/2002-08-08-CASES02-ControlC.html Tue Oct 21 19:26:00 2003
@@ -3,9 +3,9 @@
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />
<link rel="stylesheet" href="../llvm.css" type="text/css" media="screen" />
- <title>Ensuring Code Safety Without Runtime Checks for Real-Time Control Systems</title>
+ <title>Ensuring Code Safety Without Runtime Checks for Real-Time Control
+ Systems</title>
</head>
-
<body>
<div class="pub_title">
@@ -61,12 +61,12 @@
Runtime Checks for Real-Time Control Systems - Presentation</a> (PPT)</li>
</ul>
-<h2>Bibtex Entry:</h2>
+<h2>BibTeX Entry:</h2>
<pre>
@inproceedings{KDA:LCTES03,
Author = {Sumant Kowshik, Dinakar Dhurjati and Vikram Adve},
- Title = {{E}nsuring {C}ode {S}afety {W}ithout {R}untime {C}hecks for {R}eal-{T}ime {C}ontrol {S}ystems},
- Booktitle = {Proc. Int'l Conf. on Compilers Architecture and Synthesis for Embedded Systems, 2002},
+ Title = "{Ensuring Code Safety Without Runtime Checks for Real-Time Control Systems}",
+ Booktitle = "{Proc. Int'l Conf. on Compilers Architecture and Synthesis for Embedded Systems, 2002}",
Address = {Grenoble, France},
Month = {Oct},
Year = {2002},
Index: llvm-www/pubs/2002-08-09-LLVMCompilationStrategy.html
diff -u llvm-www/pubs/2002-08-09-LLVMCompilationStrategy.html:1.5 llvm-www/pubs/2002-08-09-LLVMCompilationStrategy.html:1.6
--- llvm-www/pubs/2002-08-09-LLVMCompilationStrategy.html:1.5 Tue Oct 21 17:43:15 2003
+++ llvm-www/pubs/2002-08-09-LLVMCompilationStrategy.html Tue Oct 21 19:26:00 2003
@@ -7,17 +7,13 @@
</head>
<body>
-<p align="center"><br>
-
-<font size="6" face="Georgia,Palatino,Times,Roman"><b>
+<div class="pub_title">
The LLVM Instruction Set and Compilation Strategy
-</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>
-
+</div>
+<div class="pub_author">
+ <a href="http://www.nondot.org/sabre/">Chris Lattner</a> and
+ <a href="http://www.cs.uiuc.edu/~vadve">Vikram Adve</a>
+</div>
<h2>Abstract:</h2>
<blockquote>
@@ -31,50 +27,55 @@
</blockquote>
<h2>Published:</h2>
-<ul>
+<blockquote>
"The LLVM Instruction Set and Compilation Strategy",
- Chris Lattner & Vikram Adve<br>
- Technical Report #UIUCDCS-R-2002-2292, Computer Science Dept., Univ. of Illinois, Aug. 2002.
-</ul>
+ Chris Lattner & Vikram Adve<br>
+ Technical Report #UIUCDCS-R-2002-2292, Computer Science Dept., Univ. of
+ Illinois, Aug. 2002.
+</blockquote>
<h2>Update:</h2>
-<ul>
- Since this document was published, one <b>significant</b> change has been made
- to LLVM: the GCC C front-end described in the document has been completely
- rewritten from scratch. The new C front-end is based on the mainline GCC CVS
- tree (what will become GCC 3.4), and expands type-safe LLVM code from the GCC
- AST representation, instead of from the untyped GCC RTL representation.<p>
-
- This change dramatically improved the quality of code generated and the
- stability of the system as a whole.<p>
-</ul>
-
-
+<blockquote>
+ <p>
+ Since this document was published, one <b>significant</b> change has been
+ made to LLVM: the GCC C front-end described in the document has been
+ completely rewritten from scratch. The new C front-end is based on the
+ mainline GCC CVS tree (what will become GCC 3.4), and expands type-safe LLVM
+ code from the GCC AST representation, instead of from the untyped GCC RTL
+ representation.
+ </p>
+ <p>
+ This change dramatically improved the quality of code generated and the
+ stability of the system as a whole.
+ </p>
+</blockquote>
<h2>Download:</h2>
<ul>
-<li><a href="2002-08-09-LLVMCompilationStrategy.ps">The LLVM Instruction Set and Compilation Strategy</a> (PS)
-<li><a href="2002-08-09-LLVMCompilationStrategy.pdf">The LLVM Instruction Set and Compilation Strategy</a> (PDF)
+ <li><a href="2002-08-09-LLVMCompilationStrategy.ps">The LLVM Instruction Set
+ and Compilation Strategy</a> (PS)</li>
+ <li><a href="2002-08-09-LLVMCompilationStrategy.pdf">The LLVM Instruction Set
+ and Compilation Strategy</a> (PDF)</li>
</ul>
-<h2>Bibtex Entry:</h2>
+<h2>BibTeX Entry:</h2>
<B>NOTE</b>: This document has been superseded by <a
href="2002-12-LattnerMSThesis.html">LLVM: An Infrastructure for Multi-Stage
-Optimization</a>. If you want to cite a paper about LLVM, please cite it
-instead.<p>
+Optimization</a>. If you want to cite a paper about LLVM, please cite it
+instead.
<pre>
- @TechReport{LattnerAdve:LLVM:ISCS,
- Author = {Chris Lattner and Vikram Adve},
- Title = {The {LLVM} Instruction Set and Compilation Strategy},
- Institution = {Computer Science Dept.,
- Univ. of Illinois at Urbana-Champaign},
- Number = {UIUCDCS-R-2002-2292},
- Type = {Tech. Report},
- Month = {Aug},
- Year = {2002}
- }
+ at TechReport{LattnerAdve:LLVM:ISCS,
+ Author = "{Chris Lattner and Vikram Adve}",
+ Title = "{The LLVM Instruction Set and Compilation Strategy}",
+ Institution = "{CS Dept., Univ. of Illinois at Urbana-Champaign}",
+ Number = {UIUCDCS-R-2002-2292},
+ Type = {Tech. Report},
+ Month = {Aug},
+ Year = {2002}
+}
</pre>
-</body></html>
+</body>
+</html>
Index: llvm-www/pubs/2002-12-LattnerMSThesis.html
diff -u llvm-www/pubs/2002-12-LattnerMSThesis.html:1.3 llvm-www/pubs/2002-12-LattnerMSThesis.html:1.4
--- llvm-www/pubs/2002-12-LattnerMSThesis.html:1.3 Tue Oct 21 17:43:15 2003
+++ llvm-www/pubs/2002-12-LattnerMSThesis.html Tue Oct 21 19:26:00 2003
@@ -7,32 +7,33 @@
</head>
<body>
-<p align="center"><br>
-
-<font size="6" face="Georgia,Palatino,Times,Roman"><b>
+<div class="pub_title">
LLVM: An Infrastructure for Multi-Stage Optimization
-</b></font><br>
-
-<font size=4> <a href="http://www.nondot.org/sabre/">Chris Lattner</a>, M.S. Thesis
-</font></p>
+</div>
+<div class="pub_author">
+ <a href="http://www.nondot.org/sabre/">Chris Lattner</a>, M.S. Thesis
+</div>
<h2>Abstract:</h2>
<blockquote>
+<p>
Modern programming languages and software engineering principles are causing
increasing problems for compiler systems. Traditional approaches, which use
a simple compile-link-execute model, are unable to provide adequate application
performance under the demands of the new conditions. Traditional approaches to
interprocedural and profile-driven compilation can provide the application
performance needed, but require infeasible amounts of compilation time to build
-the application.<p>
+the application.</p>
+<p>
This thesis presents LLVM, a design and implementation of a compiler
infrastructure which supports a unique <i>multi-stage</i> optimization system.
This system is designed to support extensive interprocedural and
profile-driven optimizations, while being efficient enough for use in
-commercial compiler systems.<p>
+commercial compiler systems.</p>
+<p>
The LLVM virtual instruction set is the glue that holds the system together. It
is a low-level representation, but with <i>high-level type information</i>.
This provides the benefits of a low-level representation (compact
@@ -40,34 +41,38 @@
providing high-level information to support aggressive interprocedural
optimizations at link- and post-link time. In particular, this system is
designed to support optimization in the field, both at run-time and during
-otherwise unused idle time on the machine.<p>
+otherwise unused idle time on the machine.</p>
+<p>
This thesis also describes an implementation of this compiler design, the LLVM
compiler infrastructure, proving that the design is feasible. The LLVM
compiler infrastructure is a maturing and efficient system, which we show is a
good host for a variety of research. More information about LLVM can be found
-on its web site at: <a href="http://llvm.cs.uiuc.edu/"><tt>http://llvm.cs.uiuc.edu/</tt></a>
+on its web site at: <a
+href="http://llvm.cs.uiuc.edu/"><tt>http://llvm.cs.uiuc.edu/</tt></a></p>
</blockquote>
<h2>Published:</h2>
-<ul>
- "LLVM: An Infrastructure for Multi-Stage Optimization", Chris Lattner.<br>
- <i>Masters Thesis</i>, Computer Science Dept., University of Illinois at
- Urbana-Champaign, Dec. 2002.
-</ul>
+<blockquote>
+ "LLVM: An Infrastructure for Multi-Stage Optimization", Chris Lattner.<br>
+ <i>Masters Thesis</i>, Computer Science Dept., University of Illinois at
+ Urbana-Champaign, Dec. 2002.
+</blockquote>
<h2>Download:</h2>
<ul>
-<li><a href="2002-12-LattnerMSThesis.ps">LLVM: An Infrastructure for Multi-Stage Optimization</a> (PS)
-<li><a href="2002-12-LattnerMSThesis.pdf">LLVM: An Infrastructure for Multi-Stage Optimization</a> (PDF)
+ <li><a href="2002-12-LattnerMSThesis.ps">LLVM: An Infrastructure for
+ Multi-Stage Optimization</a> (PS)</li>
+ <li><a href="2002-12-LattnerMSThesis.pdf">LLVM: An Infrastructure for
+ Multi-Stage Optimization</a> (PDF)</li>
</ul>
-<h2>Bibtex Entry:</h2>
+<h2>BibTeX Entry:</h2>
<pre>
@MastersThesis{Lattner:MSThesis02,
author = {Chris Lattner},
- title = {{LLVM}: An Infrastructure for Multi-Stage Optimization},
- school = {Computer Science Dept., University of Illinois at Urbana-Champaign},
+ title = "{LLVM: An Infrastructure for Multi-Stage Optimization}",
+ school = "{Computer Science Dept., University of Illinois at Urbana-Champaign}",
year = {2002},
address = {Urbana, IL},
month = {Dec},
@@ -75,4 +80,5 @@
}
</pre>
-</body></html>
+</body>
+</html>
Index: llvm-www/pubs/2003-04-29-DataStructureAnalysisTR.html
diff -u llvm-www/pubs/2003-04-29-DataStructureAnalysisTR.html:1.3 llvm-www/pubs/2003-04-29-DataStructureAnalysisTR.html:1.4
--- llvm-www/pubs/2003-04-29-DataStructureAnalysisTR.html:1.3 Tue Oct 21 17:43:15 2003
+++ llvm-www/pubs/2003-04-29-DataStructureAnalysisTR.html Tue Oct 21 19:26:00 2003
@@ -8,17 +8,13 @@
</head>
<body>
-<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>
+<div class="pub_title">
+ Data Structure Analysis:<br>An Efficient Context-Sensitive Heap Analysis
+</div>
+<div class="pub_author">
<a href="http://www.nondot.org/sabre/">Chris Lattner</a> and
<a href="http://www.cs.uiuc.edu/~vadve">Vikram Adve</a>
-</font></p>
-
+</div>
<h2>Abstract:</h2>
<blockquote>
@@ -33,34 +29,35 @@
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>
+<blockquote>
"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>
+ Chris Lattner & Vikram Adve<br>
+ Technical Report #UIUCDCS-R-2003-2340, Computer Science Dept., Univ. of
+ Illinois, Apr. 2003.
+</blockquote>
<h2>Update:</h2>
-<ul>
+<blockquote>
This document was updated on September 15, 2003 to be more clear and precise.
-</ul>
+</blockquote>
<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)
+ <li><a href="2003-04-29-DataStructureAnalysisTR.ps">Data Structure Analysis:
+ An Efficient Context-Sensitive Heap Analysis</a> (PS)</li>
+ <li><a href="2003-04-29-DataStructureAnalysisTR.pdf">Data Structure Analysis:
+ An Efficient Context-Sensitive Heap Analysis</a> (PDF)</li>
</ul>
-<h2>Bibtex Entry:</h2>
+<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},
+ 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},
@@ -68,4 +65,5 @@
}
</pre>
-</body></html>
+</body>
+</html>
Index: llvm-www/pubs/2003-05-01-GCCSummit2003.html
diff -u llvm-www/pubs/2003-05-01-GCCSummit2003.html:1.7 llvm-www/pubs/2003-05-01-GCCSummit2003.html:1.8
--- llvm-www/pubs/2003-05-01-GCCSummit2003.html:1.7 Tue Oct 21 17:43:15 2003
+++ llvm-www/pubs/2003-05-01-GCCSummit2003.html Tue Oct 21 19:26:00 2003
@@ -7,14 +7,13 @@
</head>
<body>
-<p align="center"><br> <font size="7"
-face="Georgia,Palatino,Times,Roman">Architecture for a Next-Generation
- GCC</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>
-
+<div class="pub_title">
+ Architecture for a Next-Generation GCC
+</div>
+<div class="pub_author">
+ <a href="http://www.nondot.org/sabre/">Chris Lattner</a> and
+ <a href="http://www.cs.uiuc.edu/~vadve">Vikram Adve</a>
+</div>
<h2>Abstract:</h2>
<blockquote>
@@ -34,36 +33,42 @@
</blockquote>
<h2>Published:</h2>
-<ul>
- "Architecture For a Next-Generation GCC", Chris Lattner &
- Vikram Adve,<br>
- <i><a href="http://www.gccsummit.org/2003/">First Annual GCC
- Developers' Summit</a></i>, Ottawa, Canada, May 2003.<br>
-</ul>
+<blockquote>
+ "Architecture For a Next-Generation GCC", Chris Lattner &
+ Vikram Adve,<br>
+ <i><a href="http://www.gccsummit.org/2003/">First Annual GCC Developers'
+ Summit</a></i>, Ottawa, Canada, May 2003.<br>
+</blockquote>
<h2>Download:</h2>
<ul>
-<li><a href="2003-05-01-GCCSummit2003.ps">Architecture for a Next-Generation GCC</a> (PS)
-<li><a href="2003-05-01-GCCSummit2003.pdf">Architecture for a Next-Generation GCC</a> (PDF)
+ <li><a href="2003-05-01-GCCSummit2003.ps">Architecture for a Next-Generation
+ GCC</a> (PS)</li>
+ <li><a href="2003-05-01-GCCSummit2003.pdf">Architecture for a Next-Generation
+ GCC</a> (PDF)</li>
</ul>
Presentation:
<ul>
-<li><a href="2003-05-01-GCCSummit2003pres.ppt">Architecture for a Next-Generation GCC (presentation)</a> (Powerpoint)
-<li><a href="2003-05-01-GCCSummit2003pres.pdf">Architecture for a Next-Generation GCC (presentation)</a> (PDF) - <i>Warning: Animation on slide #13 doesn't work.</i>
+ <li><a href="2003-05-01-GCCSummit2003pres.ppt">Architecture for a
+ Next-Generation GCC (presentation)</a> (Powerpoint)</li>
+ <li><a href="2003-05-01-GCCSummit2003pres.pdf">Architecture for a
+ Next-Generation GCC (presentation)</a> (PDF) - <i>Warning: Animation on
+ slide #13 doesn't work.</i></li>
</ul>
-<h2>Bibtex Entry:</h2>
+<h2>BibTeX Entry:</h2>
<pre>
- @inproceedings{LattnerAdve:GCCSummit03,
- Author = {Chris Lattner and Vikram Adve},
- Title = {{A}rchitecture for a {N}ext-{G}eneration {GCC}},
- Booktitle = {Proc. First Annual GCC Developers' Summit},
- Address = {Ottawa, Canada},
- Month = {May},
- Year = {2003},
- URL = {http://llvm.cs.uiuc.edu/pubs/2003-05-01-GCCSummit2003.html}
+ @InProceedings{LattnerAdve:GCCSummit03,
+ Author = {Chris Lattner and Vikram Adve},
+ Title = "{Architecture for a Next-Generation GCC}",
+ Booktitle = "{Proc. First Annual GCC Developers' Summit}",
+ Address = {Ottawa, Canada},
+ Month = {May},
+ Year = {2003},
+ URL = {http://llvm.cs.uiuc.edu/pubs/2003-05-01-GCCSummit2003.html}
}
</pre>
-</body></html>
+</body>
+</html>
Index: llvm-www/pubs/2003-05-05-LCTES03-CodeSafety.html
diff -u llvm-www/pubs/2003-05-05-LCTES03-CodeSafety.html:1.4 llvm-www/pubs/2003-05-05-LCTES03-CodeSafety.html:1.5
--- llvm-www/pubs/2003-05-05-LCTES03-CodeSafety.html:1.4 Tue Oct 21 17:43:15 2003
+++ llvm-www/pubs/2003-05-05-LCTES03-CodeSafety.html Tue Oct 21 19:26:00 2003
@@ -7,76 +7,71 @@
</head>
<body>
-<p align="center"><br> <font size="6"
-face="Georgia,Palatino,Times,Roman">Memory Safety Without Runtime Checks or Garbage Collection</font><br><font size=4>
- Dinakar Dhurjati, Sumant Kowshik,
- <a href="http://www.cs.uiuc.edu/~vadve">Vikram Adve</a> and
- <a href="http://www.nondot.org/sabre/">Chris Lattner</a>
- </font></p>
-
+<div class="pub_title">
+ Memory Safety Without Runtime Checks or Garbage Collection
+</div>
+<div class="pub_author">
+ Dinakar Dhurjati, Sumant Kowshik,
+ <a href="http://www.cs.uiuc.edu/~vadve">Vikram Adve</a> and
+ <a href="http://www.nondot.org/sabre/">Chris Lattner</a>
+</div>
<h2>Abstract:</h2>
<blockquote>
Traditional approaches to enforcing memory safety of programs rely heavily on
-runtime checks of memory accesses and on garbage collection, both of which
-are unattractive for embedded applications.
-The long-term goal of our work is to
-enable 100% static enforcement of memory safety for embedded programs
-through advanced compiler techniques and minimal semantic
-restrictions on programs.
-The key result of this paper is a compiler technique that ensures
-memory safety of
-dynamically allocated memory <i>without programmer annotations, runtime
-checks, or garbage collection</i>, and works for a large subclass of type-safe
-C programs.
-The technique is based on a fully automatic pool allocation
-(i.e., region-inference)
-algorithm for C programs we developed previously, and it ensures safety of
-dynamically allocated memory while retaining explicit deallocation of
-individual objects within regions (to avoid garbage collection).
-For a diverse set of embedded C programs
-(and using a previous technique to avoid null pointer checks),
-we show that we are able to
-statically ensure the safety of pointer and dynamic memory usage
-<i>in all these programs</i>.
-We also describe some improvements over our previous work in static checking
-of array accesses.
-Overall, we achieve 100% static enforcement of memory safety
-without new language syntax for a significant subclass of embedded C
-programs, and the subclass is much broader if array bounds checks are ignored.
-
+runtime checks of memory accesses and on garbage collection, both of which are
+unattractive for embedded applications. The long-term goal of our work is to
+enable 100% static enforcement of memory safety for embedded programs through
+advanced compiler techniques and minimal semantic restrictions on programs. The
+key result of this paper is a compiler technique that ensures memory safety of
+dynamically allocated memory <i>without programmer annotations, runtime checks,
+or garbage collection</i>, and works for a large subclass of type-safe C
+programs. The technique is based on a fully automatic pool allocation (i.e.,
+region-inference) algorithm for C programs we developed previously, and it
+ensures safety of dynamically allocated memory while retaining explicit
+deallocation of individual objects within regions (to avoid garbage collection).
+For a diverse set of embedded C programs (and using a previous technique to
+avoid null pointer checks), we show that we are able to statically ensure the
+safety of pointer and dynamic memory usage <i>in all these programs</i>. We
+also describe some improvements over our previous work in static checking of
+array accesses. Overall, we achieve 100% static enforcement of memory safety
+without new language syntax for a significant subclass of embedded C programs,
+and the subclass is much broader if array bounds checks are ignored.
</blockquote>
<h2>Published:</h2>
-<ul>
- "Memory Safety Without Runtime Checks or Garbage Collection", Dinakar Dhurjati, Sumant Kowshik, Vikram Adve &
- Chris Lattner,<br>
- <i><a href="http://www.cs.purdue.edu/s3/LCTES03/">LCTES 2003
- </a></i>, San Diego, CA, June 2003.<br>
-</ul>
+<blockquote>
+ "Memory Safety Without Runtime Checks or Garbage Collection", Dinakar
+ Dhurjati, Sumant Kowshik, Vikram Adve & Chris Lattner,<br>
+ <i><a href="http://www.cs.purdue.edu/s3/LCTES03/">LCTES 2003</a></i>, San
+ Diego, CA, June 2003.<br>
+</blockquote>
<h2>Download:</h2>
<ul>
-<li><a href="2003-05-05-LCTES03-CodeSafety.ps">Memory Safety Without Runtime Checks or Garbage Collection</a> (PS)
-<li><a href="2003-05-05-LCTES03-CodeSafety.pdf">Memory Safety Without Runtime Checks or Garbage Collection</a> (PDF)
-<li><a href="2003-06-12-LCTES03-CodeSafety.ppt">Memory Safety Without Runtime Checks or Garbage Collection - Presentation</a> (PPT)
+ <li><a href="2003-05-05-LCTES03-CodeSafety.ps">Memory Safety Without Runtime
+ Checks or Garbage Collection</a> (PS)</li>
+ <li><a href="2003-05-05-LCTES03-CodeSafety.pdf">Memory Safety Without Runtime
+ Checks or Garbage Collection</a> (PDF)</li>
+ <li><a href="2003-06-12-LCTES03-CodeSafety.ppt">Memory Safety Without Runtime
+ Checks or Garbage Collection - Presentation</a> (PPT)</li>
</ul>
-<h2>Bibtex Entry:</h2>
+<h2>BibTeX Entry:</h2>
<pre>
- @inproceedings{DKAL:LCTES03,
- Author = {Dinakar Dhurjati, Sumant Kowshik, Vikram Adve and Chris Lattner},
- Title = {{M}emory {S}afety {W}ithout {R}untime {C}hecks or {G}arbage {C}ollection},
- Booktitle = {Proc. Languages Compilers and Tools for Embedded Systems 2003},
- Address = {San Diego, CA},
- Month = {June},
- Year = {2003},
- URL = {http://llvm.cs.uiuc.edu/pubs/2003-05-05-LCTES03-CodeSafety.html}
+ @InProceedings{DKAL:LCTES03,
+ Author = {Dinakar Dhurjati, Sumant Kowshik, Vikram Adve and Chris Lattner},
+ Title = "{Memory Safety Without Runtime Checks or Garbage Collection}",
+ Booktitle = "{Proc. Languages Compilers and Tools for Embedded Systems 2003}",
+ Address = {San Diego, CA},
+ Month = {June},
+ Year = {2003},
+ URL = {http://llvm.cs.uiuc.edu/pubs/2003-05-05-LCTES03-CodeSafety.html}
}
</pre>
-<h2> Links: </h2>
-
+<h2>Links:</h2>
<a href="http://safecode.cs.uiuc.edu/">SAFECode project</a>
-</body></html>
+</body>
+</html>
Index: llvm-www/pubs/2003-09-30-LifelongOptimizationTR.html
diff -u llvm-www/pubs/2003-09-30-LifelongOptimizationTR.html:1.2 llvm-www/pubs/2003-09-30-LifelongOptimizationTR.html:1.3
--- llvm-www/pubs/2003-09-30-LifelongOptimizationTR.html:1.2 Tue Oct 21 17:43:15 2003
+++ llvm-www/pubs/2003-09-30-LifelongOptimizationTR.html Tue Oct 21 19:26:00 2003
@@ -8,25 +8,22 @@
</head>
<body>
-<p align="center"><br>
-
-<font size="6" face="Georgia,Palatino,Times,Roman"><b>
+<div class="pub_title">
LLVM: A Compilation Framework for<br>
- Lifelong Program Analysis & Transformation
-</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>
+ Lifelong Program Analysis & Transformation
+</div>
+<div class="pub_author">
+ <a href="http://www.nondot.org/sabre/">Chris Lattner</a> and
+ <a href="http://www.cs.uiuc.edu/~vadve">Vikram Adve</a>
+</div>
<h2>Abstract:</h2>
<blockquote>
This paper describes LLVM (Low Level Virtual Machine), a compiler framework
designed to support <i>transparent, lifelong program analysis and
-transformation</i> for arbitrary programs, by providing high-level information to
-compiler transformations at compile-time, link-time, run-time, and offline.
+transformation</i> for arbitrary programs, by providing high-level information
+to compiler transformations at compile-time, link-time, run-time, and offline.
LLVM defines a common, low-level code representation in Static Single Assignment
(SSA) form, with several novel features: a simple, <i>language-independent</i>
type-system that exposes the primitives commonly used to implement high-level
@@ -45,25 +42,28 @@
</blockquote>
<h2>Published:</h2>
-<ul>
- "LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation",
- Chris Lattner & Vikram Adve<br>
- Technical Report #UIUCDCS-R-2003-2380, Computer Science Dept., Univ. of Illinois, Sep. 2003.
-</ul>
+<blockquote>
+ "LLVM: A Compilation Framework for Lifelong Program Analysis &
+ Transformation", Chris Lattner & Vikram Adve<br>
+ Technical Report #UIUCDCS-R-2003-2380, Computer Science Dept., Univ. of
+ Illinois, Sep. 2003.
+</blockquote>
<h2>Download:</h2>
<ul>
-<li><a href="2003-09-30-LifelongOptimizationTR.ps">LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation</a> (PS)
-<li><a href="2003-09-30-LifelongOptimizationTR.pdf">LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation</a> (PDF)
+ <li><a href="2003-09-30-LifelongOptimizationTR.ps">LLVM: A Compilation
+ Framework for Lifelong Program Analysis & Transformation</a> (PS)</li>
+ <li><a href="2003-09-30-LifelongOptimizationTR.pdf">LLVM: A Compilation
+ Framework for Lifelong Program Analysis & Transformation</a>
+ (PDF)</li>
</ul>
-<h2>Bibtex Entry:</h2>
+<h2>BibTeX Entry:</h2>
<pre>
@TechReport{LattnerAdve:LifeLong,
Author = {Chris Lattner and Vikram Adve},
- Title = {LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation},
- Institution = {Computer Science Dept.,
- Univ. of Illinois at Urbana-Champaign},
+ Title = "{LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation}",
+ Institution = "{Computer Science Dept., Univ. of Illinois at Urbana-Champaign}",
Number = {UIUCDCS-R-2003-2380},
Type = {Tech. Report},
Month = {Sep},
@@ -71,4 +71,5 @@
}
</pre>
-</body></html>
+</body>
+</html>
Index: llvm-www/pubs/2003-10-01-LLVA.html
diff -u llvm-www/pubs/2003-10-01-LLVA.html:1.3 llvm-www/pubs/2003-10-01-LLVA.html:1.4
--- llvm-www/pubs/2003-10-01-LLVA.html:1.3 Tue Oct 21 17:43:15 2003
+++ llvm-www/pubs/2003-10-01-LLVA.html Tue Oct 21 19:26:00 2003
@@ -7,20 +7,16 @@
</head>
<body>
-<p align="center"><br>
-
-<font size="6" face="Georgia,Palatino,Times,Roman"><b>
+<div class="pub_title">
LLVA: A Low-level Virtual Instruction Set Architecture
-</b></font><br>
-
-<font size=4>
+</div>
+<div class="pub_author">
<a href="http://www.cs.uiuc.edu/~vadve">Vikram Adve</a>,
<a href="http://www.nondot.org/sabre/">Chris Lattner</a>,
<a href="http://misha.brukman.net">Michael Brukman</a>,
Anand Shukla, and
<a href="http://www.students.uiuc.edu/~gaeke/">Brian Gaeke</a>
-</font></p>
-
+</div>
<h2>Abstract:</h2>
<blockquote>
@@ -47,27 +43,32 @@
</blockquote>
<h2>Published:</h2>
-<ul>
- "LLVA: A Low-level Virtual Instruction Set Architecture", Vikram Adve, Chris Lattner, Michael Brukman, Anand Shukla, and Brian Gaeke.<br>
-Proceedings of the 36th annual ACM/IEEE international symposium on Microarchitecture (MICRO-36), San Diego, California, Dec. 2003.
-</ul>
+<blockquote>
+ "LLVA: A Low-level Virtual Instruction Set Architecture", Vikram Adve, Chris
+ Lattner, Michael Brukman, Anand Shukla, and Brian Gaeke.<br>
+ Proceedings of the 36th annual ACM/IEEE international symposium on
+ Microarchitecture (MICRO-36), San Diego, California, Dec. 2003.
+</blockquote>
<h2>Download:</h2>
<ul>
-<li><a href="2003-10-01-LLVA.ps">LLVA: A Low-level Virtual Instruction Set Architecture</a> (PS)
-<li><a href="2003-10-01-LLVA.pdf">LLVA: A Low-level Virtual Instruction Set Architecture</a> (PDF)
+ <li><a href="2003-10-01-LLVA.ps">LLVA: A Low-level Virtual Instruction Set
+ Architecture</a> (PS)</li>
+ <li><a href="2003-10-01-LLVA.pdf">LLVA: A Low-level Virtual Instruction Set
+ Architecture</a> (PDF)</li>
</ul>
-<h2>Bibtex Entry:</h2>
+<h2>BibTeX Entry:</h2>
<pre>
@InProceedings{ALBSG:MICRO36,
author = {Vikram Adve and Chris Lattner and Michael Brukman and Anand Shukla and Brian Gaeke},
- title = {{LLVA: A Low-level Virtual Instruction Set Architecture}},
- booktitle = {Proceedings of the 36th annual ACM/IEEE international symposium on Microarchitecture (MICRO-36)},
- address = {San Diego, California},
- month = {Dec},
- year = {2003}
+ title = "{LLVA: A Low-level Virtual Instruction Set Architecture}",
+ booktitle = "{Proceedings of the 36th annual ACM/IEEE international symposium on Microarchitecture (MICRO-36)}",
+ address = {San Diego, California},
+ month = {Dec},
+ year = {2003}
}
</pre>
-</body></html>
+</body>
+</html>
More information about the llvm-commits
mailing list