ref/offset fixes

Author: nkrusch

text/bg-mwp.tex

@@ -72,7 +72,7 @@ \subsubsection{Tracking Value Growth With Coefficients}
 If a command \pr|C|\symbo{p2} computes a function growing exponentially, the statement \(\prm{C} : M\) will be false for all matrices \(M\)\symbo{matrix}.
 The flow calculus\index{mwp-calculus} result is sound but incomplete.
 If a derivable\index{derivability} program terminates\index{termination},
-the soundness theorem~\cite[p. 11]{jones2009} guarantees that the variable value growth is polynomially bounded.
+the soundness theorem~\cite[p. 12]{jones2009} guarantees that the variable value growth is polynomially bounded.
 
 \begin{theorem}[{Soundness of mwp-calculus}]
 \label{mwp-soundness}\index{soundness of mwp-calculus}

text/ch-aims.tex

@@ -237,7 +237,7 @@ \subsection{Dissertation Goals}\label{subsec:specific-aims}
 \ndx{expressiveness}. A common strategy is to show that the newly presented
 system gives a guarantee for some subset of programs that were not expressible
 previously.\footnote{The strategy is used \eg in~\cite[p.16--17]{hainry2023},
-~\cite[p. 17]{jones2009}, and~\cite[p. 147]{feree2018}.} However, this strategy
+~\cite[p. 18]{jones2009}, and~\cite[p. 147]{feree2018}.} However, this strategy
 is limited in quantifying practical usefulness of the ICC systems. Particularly,
 it does not account for the \enquote{methodological cost} at which the
 improvement is achieved. Applications would provide complementary insight and

text/ch-discussion.tex

@@ -377,7 +377,7 @@ \subsection{Questions About the Flow Calculus}
 \begin{itemize}
 \item \emph{Have the developments changed the complexity of the derivability
         problem?}\footnote{The problem is \ccx{np}-complete by~\cite[p.
-        37]{jones2009}).}
+        40]{jones2009}).}
       The manuscripts in \autoref{sec:fscd},~\autoref{sec:atva},
       and~\autoref{sec:postcond} alter the inference procedure, therefore the
       answer is not obvious.

text/pubs-pc.tex

@@ -325,7 +325,7 @@ \subsubsection{Conceptual primer of the flow calculus}
 \emph{\ndx{mwp-bound}} to every variable of a derivable program. An
 \ndx{mwp-bound} is an expression, in terms of the inputs, that characterizes the
 value growth of a single variable. If a derivable program terminates, the
-soundness theorem of the flow calculus~\cite[p. 11]{jones2009}\index{soundness
+soundness theorem of the flow calculus~\cite[p. 12]{jones2009}\index{soundness
 of mwp-calculus}\index{mwp-calculus} guarantees that the variable value growth
 is polynomially-bounded. The result is sound but not complete, \ie not all
 satisfactory programs can be captured, but on success we can prove the result
@@ -597,7 +597,7 @@ \subsubsection{About construction of mwp-matrices}
 derivable.\index{derivability} The rule E3 says \enquote{the vector of the left
 operand is multiplied by a polynomial coefficient.} The
 \(p\)\symbo{p}-coefficient tracks the fact that certain data flow patterns might
-not be polynomially bounded~\cite[p. 13]{jones2009}. Applying the rules to a
+not be polynomially bounded~\cite[p. 14]{jones2009}. Applying the rules to a
 vector propagates the effect to all variables that are transitively dependent on
 the left operand. Rule E4 is similar to E3, except the \(p\)\symbo{p}
 coefficient is applied to the right operand. Thus, three different derivation
@@ -1039,7 +1039,7 @@ \subsubsection{Variable projection and querying mwp-bounds}
 
 \noindent Variable query is safe for derivable programs\index{derivability},
 because all variables are guaranteed to have an \ndx{mwp-bound} by the soundness
-theorem of the flow calculus~\cite[p. 11]{jones2009}.\index{soundness of
+theorem of the flow calculus~\cite[p. 12]{jones2009}.\index{soundness of
 mwp-calculus} Additional caution is needed when a program is not derivable.
 
 \subsubsection{Variable mwp-bounds in presence of failure}