[Valgrind-developers] valgrind-www r263 - trunk/docs

[<sv...@va...>]

Author: njn
Date: 2005-12-26 18:29:59 +0000 (Mon, 26 Dec 2005)
New Revision: 263

Log:
tweak formatting.

Modified:
   trunk/docs/pubs.html


Modified: trunk/docs/pubs.html
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
--- trunk/docs/pubs.html	2005-12-26 18:24:41 UTC (rev 262)
+++ trunk/docs/pubs.html	2005-12-26 18:29:59 UTC (rev 263)
@@ -7,20 +7,20 @@
 <ul>
=20
  <li><p>
- <a href=3D"/docs/memcheck2005.pdf">Using Valgrind to detect undefined v=
alue
+ <b><a href=3D"/docs/memcheck2005.pdf">Using Valgrind to detect undefine=
d value
    errors with bit-precision.</a><br>
   Julian Seward and Nicholas Nethercote.<br>
   Proceedings of the USENIX'05 Annual Technical Conference, Anaheim,
-    California, USA, April 2005.<br>
+    California, USA, April 2005.</b><br>
   This paper describes in detail how Memcheck's undefined value error
   detection (a.k.a.  V bits) works.  Feel free to cite it if you are tal=
king
   particularly about Memcheck's undefined value error detection.
  </p></li>
=20
  <li><p>
- <a href=3D"/docs/phd2004.pdf">Dynamic Binary Analysis and Instrumentati=
on.</a><br>
+ <b><a href=3D"/docs/phd2004.pdf">Dynamic Binary Analysis and Instrument=
ation.</a><br>
   Nicholas Nethercote.<br>
-  PhD Dissertation, University of Cambridge, November 2004.<br>
+  PhD Dissertation, University of Cambridge, November 2004.</b><br>
   This dissertation describes Valgrind in some detail (some of these det=
ails
   are now out-of-date) as well as Cachegrind, Annelid and Redux;  it als=
o
   covers some underlying theory about dynamic binary analysis in general=
 and
@@ -31,27 +31,27 @@
  </p></li>
=20
  <li><p>
- <a href=3D"/docs/bounds-checking2004.ps.bz2">Bounds-Checking Entire Pro=
grams Without
+ <b><a href=3D"/docs/bounds-checking2004.ps.bz2">Bounds-Checking Entire =
Programs Without
     Recompiling.</a><br>
   Nicholas Nethercote and Jeremy Fitzhardinge.<br>
   Informal Proceedings of the Second Workshop on Semantics, Program
     Analysis, and Computing Environments for Memory Management (SPACE 20=
04),
-    Venice, Italy, January 2004.<br>
+    Venice, Italy, January 2004.</b><br>
   This paper describes Annelid, an experimental bounds checker.
  </p></li>
=20
  <li><p>
- <a href=3D"/docs/valgrind2003.ps.bz2">Valgrind: A Program Supervision F=
ramework.</a> (<a href=3D"/gallery/valgrind2003-talk.ps.bz2">slides</a>)<=
br>
+ <b><a href=3D"/docs/valgrind2003.ps.bz2">Valgrind: A Program Supervisio=
n Framework.</a> (<a href=3D"/gallery/valgrind2003-talk.ps.bz2">slides</a=
>)<br>
   Nicholas Nethercote and Julian Seward.<br>
-  Electronic Notes in Theoretical Computer Science 89 No. 2, 2003.
+  Electronic Notes in Theoretical Computer Science 89 No. 2, 2003.</b><b=
r>
   This paper describes Valgrind in general, but is somewhat out-of-date.
   Feel free to cite it when talking about Valgrind in general.
  </p></li>
=20
  <li><p>
- <a href=3D"/docs/redux2003.ps.bz2">Redux: A Dynamic Dataflow Tracer.</a=
><br>
+ <b><a href=3D"/docs/redux2003.ps.bz2">Redux: A Dynamic Dataflow Tracer.=
</a><br>
   Nicholas Nethercote and Alan Mycroft.<br>
-  Electronic Notes in Theoretical Computer Science 89 No. 2, 2003.
+  Electronic Notes in Theoretical Computer Science 89 No. 2, 2003.</b><b=
r>
   This paper describes Redux, and experimental dynamic dataflow tracing
   tool.
  </p></li>