Fixes paper ref

algorithm.md

@@ -5,35 +5,35 @@ title: IDE Algorithm
 
 # Original IDE Algorithm
 
-Here, we provide a copy of the pseudocode of the original IDE algorithm [[21]](#references) that is relevant to our work.
+Here, we provide a copy of the pseudocode of the original IDE algorithm [[20]](#references) that is relevant to our work.
 
 <!-- <object data="appendix.pdf" width="100%" height="1000px"></object> -->
 
 <!-- ![appendix1](appendix-1.svg) -->
 ## Phase I
 
-A shortened version of the *ForwardComputeJumpFunctionsSLRPs* procedure from phase I of the original IDE algorithm [[21]](#references).
+A shortened version of the *ForwardComputeJumpFunctionsSLRPs* procedure from phase I of the original IDE algorithm [[20]](#references).
 
 ![forward compute jumpfunctions SLRPs](img/fcjfslrps-1.svg)
 
 ### Propagate
 
-The *Propagate* procedure from the original IDE algorithm [[21]](#references).
+The *Propagate* procedure from the original IDE algorithm [[20]](#references).
 
 ![propagate](img/propagate-alg-1.svg)
 
 ## Phase II
 
-Phase II (value propagation and value computation) of the original IDE algorithm [[21]](#references).
+Phase II (value propagation and value computation) of the original IDE algorithm [[20]](#references).
 
 ![phase-II](img/phase2-1.svg)
 
 ### Propagate Value
 
-The *PropagateValue* procedure from the original IDE algorithm [[21]](#references).
+The *PropagateValue* procedure from the original IDE algorithm [[20]](#references).
 
 ![propagate-value](img/prop-value-1.svg)
 
 ## References
 
-[21] Mooly Sagiv, Thomas Reps, and Susan Horwitz. Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation. Theor. Comput. Sci., 167(1-2):131–170, 1996.3
+[20] Mooly Sagiv, Thomas Reps, and Susan Horwitz. Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation. Theor. Comput. Sci., 167(1-2):131–170, 1996.3