From 9015f6f36bdb966e169f97e6e4330de2619ff8e2 Mon Sep 17 00:00:00 2001
From: Mike Lam <lam2mo@jmu.edu>
Date: Thu, 11 Jul 2024 13:48:27 -0400
Subject: [PATCH] Fix or remove some broken links on community and education
 pages

---
 community.html | 37 ++++++++++++++++---------------------
 education.html |  6 +++---
 2 files changed, 19 insertions(+), 24 deletions(-)

diff --git a/community.html b/community.html
index b88aafd..d9c644a 100644
--- a/community.html
+++ b/community.html
@@ -58,7 +58,7 @@ <h2> Dynamic Tools </h2>
     <dt>AMP</dt>
 
     <dd>AMP (Automated Mixed Precision) is a tool developed by Ralph Nathan and
-    <a href="http://people.ee.duke.edu/~sorin/">Daniel Sorin</a> (Duke University)
+    <a href="https://people.ee.duke.edu/~sorin/">Daniel Sorin</a> (Duke University)
     for mixed-precision analysis. It begins with a single-precision version of a
     program and uses a variety of metrics and heuristics to gradually raise certain
     portions of the program to higher precision in order to achieve the desired
@@ -107,7 +107,7 @@ <h2> Dynamic Tools </h2>
 
     <dd> <ul>
         <li> Paper: <a href="https://doi.org/10.1016/j.cpc.2008.02.003">"CADNA: A Library for Estimating Round-off Error Propagation"</a> (CPC'08) </li>
-        <li> Paper: <a href="https://hal.archives-ouvertes.fr/hal-01331917">"Auto-tuning for Floating-point Precision with Discrete Stochastic Arithmetic"</a> (preprint) </li>
+        <li> Paper: <a href="https://hal.science/hal-01331917">"Auto-tuning for Floating-point Precision with Discrete Stochastic Arithmetic"</a> (preprint) </li>
         <li> Website (CADNA): <a href="http://cadna.lip6.fr/index.php">cadna.lip6.fr</a> </li>
         <li> Website (PROMISE): <a href="http://promise.lip6.fr/">promise.lip6.fr</a> </li>
     </ul> </dd>
@@ -285,7 +285,7 @@ <h2> Dynamic Tools </h2>
 
     <dd> <ul>
         <li> Paper: <a href="https://doi.org/10.1145/3192366.3192411">"Finding Root Causes of Floating Point Error"</a> (PLDI'18) </li>
-        <li> Website: <a href="http://herbgrind.ucsd.edu">herbgrind.ucsd.edu</a> </li>
+        <li> Website: <a href="https://herbgrind.ucsd.edu">herbgrind.ucsd.edu</a> </li>
         <li> Source: <a href="https://github.com/uwplse/herbgrind">github.com/uwplse/herbgrind</a> </li>
     </ul> </dd>
 
@@ -371,7 +371,7 @@ <h2> Dynamic Tools </h2>
     </dd>
 
     <dd> <ul>
-        <li> Thesis: <a href="https://tel.archives-ouvertes.fr/tel-03116750">"Compromise between precision and performance in high-performance computing"</a></li>
+        <li> Thesis: <a href="https://theses.hal.science/tel-03116750">"Compromise between precision and performance in high-performance computing"</a></li>
         <li> Source: <a href="https://gitlab.com/numerical_shaman/shaman">gitlab.com/numerical_shaman/shaman</a></li>
         <li> Web interface: <a href="https://repl.it/@nestordemeure/ShamanDemo?lite=true#main.cpp">repl.it/~nestordemeure/ShamanDemo</a></li>
     </ul> </dd>
@@ -403,14 +403,13 @@ <h2> Dynamic Tools </h2>
 
     <dt>STOKE</dt>
 
-    <dd> <a href="https://stoke.stanford.edu">STOKE</a> is a general stochastic
+    <dd> STOKE is a general stochastic
     optimization and program synthesis tool from Stanford that has been extended
     to handle floating-point computation. STOKE can trade off accuracy for
     performance for floating-point computations.</dd>
 
     <dd> <ul>
         <li> Paper: <a href="https://doi.org/10.1145/2666356.2594302">"Stochastic Optimization of Floating-Point Programs with Tunable Precision"</a> (PLDI'14) </li>
-        <li> Website: <a href="https://stoke.stanford.edu">stoke.stanford.edu</a> </li>
         <li> Source: <a href="https://github.com/StanfordPL/stoke">github.com/StanfordPL/stoke</a> </li>
     </ul> </dd>
 
@@ -445,7 +444,7 @@ <h2> Dynamic Tools </h2>
     Verificarlo front-end (see above) for lower overhead.</dd>
 
     <dd> <ul>
-        <li> Paper: <a href="https://hal.archives-ouvertes.fr/hal-01383417">"Verrou: Assessing Floating-Point Accuracy Without Recompiling"</a> (unpublished) </li>
+        <li> Paper: <a href="https://hal.science/hal-01383417">"Verrou: Assessing Floating-Point Accuracy Without Recompiling"</a> (unpublished) </li>
         <li> Paper: <a href="https://doi.org/10.1007/978-3-319-63501-9_5">"Studying the Numerical Quality of an Industrial Computing Code: A Case Study on Code_aster"</a> (NSV'17) </li>
         <li> Source: <a href="https://github.com/edf-hpc/verrou">github.com/edf-hpc/verrou</a> </li>
     </ul> </dd>
@@ -543,13 +542,13 @@ <h2> Static Tools </h2>
     <dt>Flocq</dt>
 
     <dd> Flocq is a floating-point formalization for Coq, written by
-    <a href="https://www.lri.fr/~sboldo/">Sylvie Boldo</a> and others. It provides
-    a library of theorems for analyzing arbitrary-precision floating-point
-    arithmetic. </dd>
+    <a href="https://pages.saclay.inria.fr/sylvie.boldo/">Sylvie Boldo</a> and
+    others. It provides a library of theorems for analyzing arbitrary-precision
+    floating-point arithmetic. </dd>
 
     <dd> <ul>
         <li> Paper: <a href="https://doi.org/10.1109/ARITH.2011.40">"Flocq: A Unified Library for Proving Floating-Point Algorithms in Coq"</a> (SCA'11) </li>
-        <li> Book: <a href="https://www.elsevier.com/books/computer-arithmetic-and-formal-proofs/boldo/978-1-78548-112-3">"Computer Arithmetic and Formal Proofs"</a> (Elsevier) </li>
+        <li> Book: <a href="https://shop.elsevier.com/books/computer-arithmetic-and-formal-proofs/boldo/978-1-78548-112-3">"Computer Arithmetic and Formal Proofs"</a> (Elsevier) </li>
         <li> Website: <a href="https://flocq.gitlabpages.inria.fr">flocq.gitlabpages.inria.fr</a> </li>
     </ul> </dd>
 
@@ -588,7 +587,7 @@ <h2> Static Tools </h2>
 
     <dd> They have also built a mixed-precision tool for Python code based on this
     technique. Note that it also requires the commercial
-    <a href="https://www.gurobi.com/products/gurobi-optimizer/">Gurobi Optimizer</a>. </dd>
+    <a href="https://www.gurobi.com/solutions/gurobi-optimizer/">Gurobi Optimizer</a>. </dd>
 
     <dd> <ul>
         <li> Paper: <a href="https://doi.org/10.1145/3009837.3009846">"Rigorous Floating-Point Mixed-Precision Tuning"</a> (POPL'17) </li>
@@ -598,8 +597,7 @@ <h2> Static Tools </h2>
     <dt>Gappa</dt>
 
     <dd>Gappa helps automated reasoning about floating-point and
-    fixed-point arithmetic. It has been used to prove
-    the <a href="https://gforge.inria.fr/scm/browser.php?group_id=5929&extra=crlibm">CRlibm</a>
+    fixed-point arithmetic. It has been used to prove the CRlibm
     implementations of elementary functions correct.</dd>
 
     <dd> <ul>
@@ -642,7 +640,6 @@ <h2> Static Tools </h2>
         <li> Paper: <a href="https://doi.org/10.1007/978-3-319-66266-4_14">"Automatic Estimation of Verified Floating-Point Round-Off Errors via Static Analysis"</a> (SAFECOMP2017) </li>
         <li> Paper: <a href="https://doi.org/10.1007/978-3-319-73721-8_24">"An Abstract Interpretation Framework for the Round-Off Error Analysis of Floating-Point Programs"</a> (VMCAI 2018, preferred citation) </li>
         <li> Paper: <a href="https://doi.org/10.1007/978-3-030-20652-9_25">"A Mixed Real and Floating-Point Solver"</a> (NFM 2019) </li>
-        <li> Website: <a href="http://precisa.nianet.org">precisa.nianet.org</a> </li>
         <li> Source: <a href="https://github.com/nasa/PRECiSA">github.com/nasa/PRECiSA</a> </li>
     </ul> </dd>
 
@@ -673,16 +670,14 @@ <h2> Static Tools </h2>
 
     <dd> Salsa is an abstract-interpretation-based floating-point analysis tool that
     suggests transformations to minimize floating-point error, and is the dissertation
-    work of <a href="https://perso.univ-perp.fr/nasrine.damouche/">Nasrine Damouche</a>.
-    The source code is not available.
+    work of Nasrine Damouche. The source code is not available.
     </dd>
 
     <dd> <ul>
         <li> Paper: <a href="https://doi.org/10.29007/j2fd">"Salsa: An Automatic Tool to Improve the Numerical Accuracy of Programs"</a> (AFM'17) </li>
         <li> Paper: <a href="https://doi.org/10.1007/s10009-016-0435-0">"Improving the numerical accuracy of programs by automatic transformation"</a> (STTT'17, preferred citation) </li>
-        <li> Thesis: <a href="https://tel.archives-ouvertes.fr/tel-01455727/">"Improving the Numerical Accuracy of Floating-Point Programs with Automatic Code Transformation Methods"</a> (2016)</li>
+        <li> Thesis: <a href="https://theses.hal.science/tel-01455727/">"Improving the Numerical Accuracy of Floating-Point Programs with Automatic Code Transformation Methods"</a> (2016)</li>
         <li> Paper: <a href="https://doi.org/10.1007/978-3-319-19458-5_3">"Intra-procedural Optimization of the Numerical Accuracy of Programs"</a> (FMICS'15) </li>
-        <li> Website: <a href="https://perso.univ-perp.fr/nasrine.damouche/Salsa/">perso.univ-perp.fr/nasrine.damouche/Salsa/</a> </li>
     </ul> </dd>
 
     <dt>Satire</dt>
@@ -851,7 +846,7 @@ <h2> Miscellaneous </h2>
 
     <dd> <ul>
         <li> Paper: <a href="https://dl.acm.org/citation.cfm?id=1855756">"KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs"</a> (OSDI'08) </li>
-        <li> Website: <a href="https://klee.github.io">klee.github.io</a> </li>
+        <li> Website: <a href="https://klee-se.org">klee-se.org</a> </li>
         <li> Source: <a href="https://github.com/ApproxSymate/klee">github.com/ApproxSymate/klee</a> (<a href="https://github.com/ApproxSymate/fp-examples">examples</a>) </li>
     </ul> </dd>
 
@@ -883,7 +878,7 @@ <h2> Miscellaneous </h2>
 
     <dd> <ul>
         <li> Paper: <a href="https://doi.org/10.1145/2555243.2555265">"Efficient Search for Inputs Causing High Floating-point Errors"</a> (PPoPP'14) </li>
-        <li> Website: <a href="https://formalverification.cs.utah.edu/grt/">formalverification.cs.utah.edu/grt</a> </li>
+        <li> Source: <a href="https://github.com/soarlab/S3FP">github.com/soarlab/S3FP</a> </li>
     </ul> </dd>
 
     <dt>SOAP</dt>
diff --git a/education.html b/education.html
index 857b9d7..9caba87 100644
--- a/education.html
+++ b/education.html
@@ -99,10 +99,10 @@ <h2> Videos </h2>
         <li> <a href="https://www.youtube.com/watch?v=CnECL5x6MwQ">"What Every 21st Century Computer Scientist
             Should Know About Floating-Point Arithmetic"</a> workshop talk by Bill Zorn (2022) </li>
 
-        <li> <a href="https://youtube.com/watch?v=9AcCrF_nX-I">"Z-Fighting"</a> video about floating-point artifacts
+        <li> <a href="https://www.youtube.com/watch?v=9AcCrF_nX-I">"Z-Fighting"</a> video about floating-point artifacts
             in 3d rendering by Jamie King (2012) </li>
 
-        <li> <a href="https://youtube.com/watch?v=9hdFG2GcNuA">"Floats"</a> video about floating-point discretization
+        <li> <a href="https://www.youtube.com/watch?v=9hdFG2GcNuA">"Floats"</a> video about floating-point discretization
             in Super Mario 64 by Pannenkoek2012 </li>
 
     </ul> </dd>
@@ -135,7 +135,7 @@ <h2> Tools and Miscellaneous </h2>
       <li> <a href="http://tom7.org/nand/">"NaN Gates"</a> and <a href="http://tom7.org/grad/">"GradIEEEnt half decent"</a> projects
         by Tom Murphy ("Tom 7") </li>
 
-      <li> <a href="https://xkcd.com/217">Relevant xkcd</a> </li>
+      <li> <a href="https://xkcd.com/217/">Relevant xkcd</a> </li>
 
     </ul> </dd>