🚆

Author: nkrusch

latex/format.tex

@@ -63,9 +63,9 @@
 \let\item\@idxitem
 \setlength{\columnsep}{30pt}
 \setlength{\parindent}{0em}
-\begin{multicols*}{2}\raggedcolumns}
+\begin{multicols*}{2}\raggedcolumns} %\raggedleft}
 {\end{multicols*}}
-%\let\item\@idxitem}
+%\let\item\@idxitem}\raggedright
 {\clearpage}
 \renewcommand{\@idxitem}{\par\hangindent 15\p@}
 \renewcommand{\subitem}{\par\hangindent 30\p@\hspace*{15pt}}
@@ -75,10 +75,10 @@
 headings_flag 1
 heading_prefix "\{\\normalsize\\textbf\{"
 heading_suffix "\}\}\\hfill\\nopagebreak\n"
-delim_0 "\\mydotfill\{\\raggedleft\\footnotesize"
-delim_1 "\\mydotfill\{\\raggedleft\\footnotesize"
-delim_2 "\\mydotfill\{\\raggedleft\\footnotesize"
-delim_t "\\raggedright\} "
+delim_0 "\\mydotfill\{\\footnotesize"
+delim_1 "\\mydotfill\{\\footnotesize"
+delim_2 "\\mydotfill\{\\footnotesize"
+delim_t "\} "
 \end{filecontents}
 
 %% Glossaries

latex/symbols.tex

@@ -8,7 +8,7 @@
 \newcommand{\iconDONE}{\textnormal{\raisebox{0\height}{\scalebox{.90}{\faCheckSquare}}}} % checkbox
 \newcommand{\iconPROG}{\textnormal{\raisebox{0\height}{\scalebox{.90}{\faBorderNone}}}} % progress
 
-\newcommand{\types}{\textnormal{\raisebox{0.15\height}{\scalebox{.65}{\faStarOfLife}}}}
+\newcommand{\types}{\textnormal{\raisebox{0.15\height}{\scalebox{.65}{\faDiaspora}}}}
 \newcommand{\logics}{\textnormal{\raisebox{0.25\height}{\scalebox{.65}{\faChessKing}}}}
 \newcommand{\dataflow}{\textnormal{\raisebox{0.15\height}{\scalebox{.65}{\faShare*}}}}
 \newcommand{\syntax}{\textnormal{\raisebox{0.15\height}{\scalebox{.65}{\faFont}}}}

references/acronyms.tex

@@ -69,5 +69,6 @@
 \newacronym{trs}{TRS}{Term Rewrite System}
 \newacronym{url}{URL}{Uniform Resource Locator}
 \newacronym{usg}{USG}{University System of Georgia}
+\newacronym{utm}{UTM}{Universal Turing Machine}
 \newacronym{wcet}{WCET}{Worst-Case Execution Time}
 \newacronym{xbc}{XbC}{X-by-Construction}

references/references.bib

@@ -478,6 +478,19 @@ @article{ernst2007
     pages        = {35--45},
     doi          = {10.1016/j.scico.2007.01.015}
 }
+@article{feiertag1977,
+    title        = {Proving multilevel security of a system design},
+    author       = {Feiertag, R. J. and Levitt, K. N. and Robinson, L.},
+    year         = {1977},
+    month        = {11},
+    journal      = {ACM SIGOPS Operating Systems Review},
+    publisher    = {Association for Computing Machinery (ACM)},
+    volume       = {11},
+    number       = {5},
+    pages        = {57--65},
+    doi          = {10.1145/1067625.806547},
+    issn         = {0163-5980}
+}
 @article{focardi1997,
     title        = {{The Compositional Security Checker: a tool for the verification of information flow security properties}},
     author       = {Focardi, R. and Gorrieri, R.},
@@ -771,6 +784,19 @@ @article{lamport1977
     doi          = {10.1109/tse.1977.229904},
     issn         = {2326-3881}
 }
+@article{lawson2009,
+    title        = {Side-Channel Attacks on Cryptographic Software},
+    author       = {Lawson, Nate},
+    year         = {2009},
+    month        = {11},
+    journal      = {IEEE Security \& Privacy Magazine},
+    publisher    = {Institute of Electrical and Electronics Engineers (IEEE)},
+    volume       = {7},
+    number       = {6},
+    pages        = {65--68},
+    doi          = {10.1109/msp.2009.165},
+    issn         = {1540-7993}
+}
 @article{leroy2009,
     title        = {{Formal verification of a realistic compiler}},
     author       = {Xavier Leroy},
@@ -1014,6 +1040,19 @@ @article{srikanth2017
     doi          = {10.1145/3093333.3009864},
     issn         = {1558-1160}
 }
+@article{stefan2012,
+    title        = {Addressing covert termination and timing channels in concurrent information flow systems},
+    author       = {Stefan, Deian and Russo, Alejandro and Buiras, Pablo and Levy, Amit and Mitchell, John C. and Maziéres, David},
+    year         = {2012},
+    month        = {9},
+    journal      = {ACM SIGPLAN Notices},
+    publisher    = {Association for Computing Machinery (ACM)},
+    volume       = {47},
+    number       = {9},
+    pages        = {201--214},
+    doi          = {10.1145/2398856.2364557},
+    issn         = {1558-1160}
+}
 @article{turing1936,
     title        = {{On computable numbers, with an application to the Entscheidungsproblem}},
     author       = {Turing, A. M.},
@@ -1392,6 +1431,17 @@ @inbook{avanzini2016
     isbn         = {9783662496749},
     issn         = {1611-3349}
 }
+@inbook{avanzini2024,
+    title        = {On the Hardness of Analyzing Quantum Programs Quantitatively},
+    author       = {Avanzini, Martin and Moser, Georg and Péchoux, Romain and Perdrix, Simon},
+    year         = {2024},
+    booktitle    = {Programming Languages and Systems},
+    publisher    = {Springer Nature Switzerland},
+    pages        = {31--58},
+    doi          = {10.1007/978-3-031-57267-8_2},
+    isbn         = {9783031572678},
+    issn         = {1611-3349}
+}
 @inbook{baillot2015,
     title        = {{Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs}},
     author       = {Baillot, Patrick and Barthe, Gilles and Dal Lago, Ugo},
@@ -1481,6 +1531,17 @@ @inbook{cobham1965
     url          = {https://www.cs.toronto.edu/~sacook/homepage/cobham_intrinsic.pdf},
     editor       = {Yehoshua Bar{-}Hillel}
 }
+@inbook{colledan2024,
+    title        = {Circuit Width Estimation via Effect Typing and Linear Dependency},
+    author       = {Colledan, Andrea and Dal Lago, Ugo},
+    year         = {2024},
+    booktitle    = {Programming Languages and Systems},
+    publisher    = {Springer Nature Switzerland},
+    pages        = {3--30},
+    doi          = {10.1007/978-3-031-57267-8_1},
+    isbn         = {9783031572678},
+    issn         = {1611-3349}
+}
 @inbook{dallago2011,
     title        = {{A Short Introduction to Implicit Computational Complexity}},
     author       = {Dal Lago, Ugo},
@@ -1881,13 +1942,13 @@ @inbook{terbeek2018
 @inbook{terbeek2020,
     title        = {X-by-Construction: Correctness Meets Probability},
     author       = {ter Beek, Maurice H. and Cleophas, Loek and Legay, Axel and Schaefer, Ina and Watson, Bruce W.},
-    year         = 2020,
+    year         = {2020},
     booktitle    = {Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles},
     publisher    = {Springer International Publishing},
     pages        = {211--215},
     doi          = {10.1007/978-3-030-61362-4_11},
-    isbn         = 9783030613624,
-    issn         = {1611-3349},
+    isbn         = {9783030613624},
+    issn         = {1611-3349}
 }
 @inbook{vandermeyden2007,
     title        = {{A Comparison of Semantic Models for Noninterference}},
@@ -3380,25 +3441,3 @@ @unpublished{rusch20257
     url          = {https://nkrusch.github.io/dissertation/abstract.pdf},
     note         = {At the ECOOP 2025 Doctoral Symposium}
 }
-@inbook{colledan2024,
-    title        = {Circuit Width Estimation via Effect Typing and Linear Dependency},
-    author       = {Colledan, Andrea and Dal Lago, Ugo},
-    year         = 2024,
-    booktitle    = {Programming Languages and Systems},
-    publisher    = {Springer Nature Switzerland},
-    pages        = {3--30},
-    doi          = {10.1007/978-3-031-57267-8_1},
-    isbn         = 9783031572678,
-    issn         = {1611-3349}
-}
-@inbook{avanzini2024,
-    title        = {On the Hardness of Analyzing Quantum Programs Quantitatively},
-    author       = {Avanzini, Martin and Moser, Georg and Péchoux, Romain and Perdrix, Simon},
-    year         = 2024,
-    booktitle    = {Programming Languages and Systems},
-    publisher    = {Springer Nature Switzerland},
-    pages        = {31--58},
-    doi          = {10.1007/978-3-031-57267-8_2},
-    isbn         = 9783031572678,
-    issn         = {1611-3349}
-}

references/symbols.tex

@@ -1,5 +1,5 @@
 \newglossaryentry{symb:Delta}{name={\(\Delta\)},description={sequence of derivation choices},sort=Delta,text={}}
-\newglossaryentry{symb:G}{name={\(\Gamma\)},description={typing context},sort=t,text={}}
+\newglossaryentry{symb:G}{name={\(\Gamma\)},description={typing context},sort=G,text={}}
 \newglossaryentry{symb:PsiProd}{name={\(\bar{\Psi}\)},description={injection over cartesian product},sort=Psi,text={}}
 \newglossaryentry{symb:Xprime}{name={\texttt{X'}},description={variable referring to its final value},sort=x,text={}}
 \newglossaryentry{symb:ai}{name={\(A_i\)},description={set of derivation choices},sort=A,text={}}
@@ -67,7 +67,7 @@
 \newglossaryentry{symb:mstar}{name={\(M^*\)},description={matrix closure/fixpoint},sort={matrix fixpoint},text={}}
 \newglossaryentry{symb:mwpi}{name={\(\mwpsc^\infty\)},description={\mwpsc extended with \(\infty\)-coefficient},sort=mwpinfinity,text={}}
 \newglossaryentry{symb:mwpset}{name={\mwpsc},description={set of flow coefficients},sort=mwp,text={}}
-\newglossaryentry{symb:mzeroj}{name={\(\{_{i}^{\alpha} \rightarrow j\}\)}, description={matrix \(M\) with \(M_{ij} = \alpha\) and \(0\) elsewhere},sort={mij},text={}}
+\newglossaryentry{symb:mzeroj}{name={\(\{_{i}^{\alpha} \rightarrow j\}\)}, description={matrix \(M\) with \(M_{ij} = \alpha\) and \(0\) elsewhere},sort={aij},text={}}
 \newglossaryentry{symb:m}{name={\(m\)},description={maximally linear flow coefficient},sort=m,text={}}
 \newglossaryentry{symb:nat}{name={\(\mathbb{N}\)},description={natural number},sort=n,text={}}
 \newglossaryentry{symb:normx}{name={\(\vec{x}\)},description={normal parameters},sort=xvec,text={},parent={symb:vlist}}
@@ -108,15 +108,15 @@
 \newglossaryentry{symb:trieq}{name={\(\triangleq\)},description={defines},sort={=},text={}}
 \newglossaryentry{symb:ttrue}{name={\(\top\)},description={true},sort=true,text={}}
 \newglossaryentry{symb:upce}{name={\(\upce{}\)},description={up-to equivalence},sort=cup,text={}}
-\newglossaryentry{symb:v0a}{name={\(\{_{i}^{\alpha}\}\)},description={vector with \(\alpha\) in \(i^\text{th}\) row and \(0\) otherwise},sort={vector zero},text={}}
-\newglossaryentry{symb:vadd}{name={\(\{_{i}^{\alpha} , _{j}^{\beta}\}\)},description={component-wise vector addition},sort={vector addition},text={}}
+\newglossaryentry{symb:v0a}{name={\(\{_{i}^{\alpha}\}\)},description={vector with \(\alpha\) in \(i^\text{th}\) row and \(0\) otherwise},sort={ai},text={}}
+\newglossaryentry{symb:vadd}{name={\(\{_{i}^{\alpha} , _{j}^{\beta}\}\)},description={component-wise vector addition},sort={aibj},text={}}
 \newglossaryentry{symb:vare}{name={\(\var(\_)\)},description={variables in \(\_\)},sort={vare},text={}}
 \newglossaryentry{symb:vdash}{name={\(\vdash\)},description={syntactic implication, proves},sort=vdash,text={}}
-\newglossaryentry{symb:vec2}{name={\(\mat{\alpha \\ \beta}\)},description={column vector of flow coefficients},sort={vector column},text={}}
+\newglossaryentry{symb:vec2}{name={\(\mat{\alpha \\ \beta}\)},description={column vector of flow coefficients},sort={ab},text={}}
 \newglossaryentry{symb:vecv}{name={\(\vec{v}\)},description={value list, \ie \(\vec{v} = v_1, \hdots, v_n\), (alternatively \(\vec{w}\))},sort=vectorv,text={}}
 \newglossaryentry{symb:vec}{name={\(V\)},description={column vector},sort=V,text={}}
 \newglossaryentry{symb:vin}{name={\(\In(\_)\)},description={variables used by \(\_\)},sort={in},text={}}
-\newglossaryentry{symb:vi}{name={\vi},description={non-interference violation},sort=droplet,text={}}
+\newglossaryentry{symb:vi}{name={\vi},description={non-interference violation},sort={ni},text={}}
 \newglossaryentry{symb:vout}{name={\(\Out(\_)\)},description={variables modified by \(\_\)},sort={out},text={}}
 \newglossaryentry{symb:vrep}{name={\(M \xleftarrow{j} V\)},description={replace in matrix \(M\) the \(j^\text{th}\) column by \(V\)},sort={matrix replace vector},text={}}
 \newglossaryentry{symb:vsem}{name={\(\vDash\)},description={semantic implication},sort=vdash,text={}}
@@ -128,4 +128,5 @@
 \newglossaryentry{symb:xprime2}{name={\(x'\)},description={variable final value},sort=x,text={}}
 \newglossaryentry{symb:xvar2}{name={\(\text{\texttt{x}}\)},description={variable (alternatively \pr|w|, \pr|y|, \pr|z|, \ldots)},sort=X,text={}}
 \newglossaryentry{symb:xvar}{name={\(\text{\texttt{X}}_n\)},description={variable},sort=X,text={}}
-\newglossaryentry{symb:zero2}{name={\(0\)},description={reinitialization},sort=0,text={},parent={symb:zero}}
+\newglossaryentry{symb:zero2}{name={\(0\)},description={reinitialization},sort=0,text={},parent={symb:zero}}
+\newglossaryentry{symb:phi}{name={\phi},description={analyzed property},sort=phi,text={}}

text/bg-formal.tex

@@ -170,11 +170,12 @@ \subsubsection{Foundational Concepts}
 related to memory accesses: null-pointer dereferencing, access to unallocated
 memory, dangling pointers, out-of-bounds accesses, double-free,
 \etc~\cite{muller2024}}, absence of overflows, \ndx{termination}, \ndx{data race
-freedom}~\cite{georges2025}, \ndx{deadlock freedom}~\cite{roscoe1987}, secure
-\ndx{information flow} (cf~\autoref{if-security}), staying within available
-\ndx{resource bounds}, and \ndx{worst-case execution time} (WCET). For example,
-showing that a program is free of overflows requires expressing overflow-freedom
-as a formal specification, then proving that the implementation satisfies the
+freedom}~\cite{georges2025}, deadlock
+freedom\index{deadlocking}~\cite{roscoe1987}, secure \ndx{information flow}
+(cf~\autoref{if-security}), staying within available \ndx{resource bounds}, and
+\ndx{worst-case execution time} (WCET). For example, showing that a program is
+free of overflows requires expressing overflow-freedom as a formal
+specification, then proving that the implementation satisfies the
 specification\index{specifications}.
 
 There are various different ways to categorize families of \ndx{properties}.
@@ -541,7 +542,7 @@ \subsubsection{The Rocq Theorem Prover}
    & \textcite{honsell2001}
    \\
    \href{https://github.com/rocq-community/goedel}%
-   {\ndx{Gödel-Rosser incompleteness theorem}}
+   {\ndx{Gödel-Rosser Incompleteness Theorem}}
    & \textcite{oconnor2005}
    \\
    Modal model of impredicative semantics
@@ -766,7 +767,7 @@ \subsubsection{Tool Comparison by Light Examples}
 
 \begin{center}
 \captionsetup{type=lstlisting}
-\rocqinputlisting[breakable][firstline=176]{equiv.v}
+\rocqinputlisting[][firstline=176]{equiv.v}
 \captionof{lstlisting}[A Rocq proof of program equivalence]{
 A \ndx{Rocq} proof of program equivalence (theorem only).
 The full proof with the programming language syntax, semantics, and notations is
@@ -901,11 +902,18 @@ \subsubsection{Tool Comparison by Light Examples}
 
 \begin{center}
 \captionsetup{type=lstlisting}
-\rocqinputlisting[breakable][firstline=2]{leftpad.v}
-\captionof{lstlisting}[Leftpad in Rocq]{Leftpad in Rocq.}
+\rocqinputlisting[][firstline=2,lastline=26]{leftpad.v}
+\captionof{lstlisting}[Leftpad in Rocq (1)]{Leftpad in Rocq (part 1 of 2).}
 \label{lst:rocq-leftpad}
 \end{center}
 
+\begin{center}
+\captionsetup{type=lstlisting}
+\rocqinputlisting[][firstline=28,firstnumber=28]{leftpad.v}
+\captionof{lstlisting}[Leftpad in Rocq (2)]{Leftpad in Rocq (part 2 of 2).}
+\label{lst:rocq-leftpad2}
+\end{center}
+
 \subparagraph*{Leftpad in Rocq.}
 The \ndx{Rocq} proof of leftpad is shown in~\autoref{lst:rocq-leftpad}. The
 leftpad implementation (at L27--28) works by concatenating \(n -
@@ -917,6 +925,27 @@ \subsubsection{Tool Comparison by Light Examples}
 and the concatenated length. Proving the theorem requires introducing the
 supporting definitions and the lemmas of L6--25.
 
+\begin{center}
+\captionsetup{type=lstlisting}
+\begin{minipage}{\linewidth}
+\mathcompinputlisting[][firstline=2]{leftpad_ssrefl.v}
+\captionof{lstlisting}[Leftpad in SSReflect proof language]{
+Leftpad in the \ndx{SSReflect} proof language of the \ndx{Mathematical
+Components} library.}
+\label{lst:mathcomp-leftpad}
+\end{minipage}
+\end{center}
+
+\begin{center}
+\begin{minipage}{\linewidth}
+\captionsetup{type=lstlisting}
+\dafnyinputlisting[][]{leftpad.dfy}
+\captionof{lstlisting}[Formally verified Leftpad in Dafny]
+{Formally verified leftpad in \ndx{Dafny}.}
+\label{lst:leftdfy}
+\end{minipage}
+\end{center}
+
 \subparagraph*{Leftpad in SSReflect.}
 The \ndx{Mathematical Components} library does not contain definitions of string
 or character types. Therefore,~\autoref{lst:mathcomp-leftpad} is generalized to
@@ -936,27 +965,6 @@ \subsubsection{Tool Comparison by Light Examples}
 \ndx{Mathematical Components} library. The naming eases locating existing
 theorems, to avoid searching the proofs database.
 
-\begin{center}
-\captionsetup{type=lstlisting}
-\begin{minipage}{\linewidth}
-\mathcompinputlisting[][firstline=2]{leftpad_ssrefl.v}
-\captionof{lstlisting}[Leftpad in SSReflect proof language]{
-   Leftpad in the \ndx{SSReflect} proof language of the \ndx{Mathematical
-   Components} library.}
-\label{lst:mathcomp-leftpad}
-\end{minipage}
-\end{center}
-
-\begin{center}
-\begin{minipage}{\linewidth}
-\captionsetup{type=lstlisting}
-\dafnyinputlisting[][]{leftpad.dfy}
-\captionof{lstlisting}[Leftpad formally verified in Dafny]
-{Formally verified leftpad in \ndx{Dafny}.}
-\label{lst:leftdfy}
-\end{minipage}
-\end{center}
-
 \subparagraph*{Leftpad in Dafny.}
 In \ndx{Dafny}, the \ndx{specifications} are \enquote{embedded} next to the
 implementation. To make the \autoref{lst:leftdfy} free of imports, the \pr|Max|

text/bg-icc.tex

@@ -42,7 +42,7 @@ \subsubsection{Computational Complexity, \emph{Implicitly}}
 \end{quotation}
 In other words, complexity classes\index{complexity classes} are described independently of notions of time or space related to a machine's definition.
 For example, polynomial time complexity\ccxi{p} has been thoroughly examined under these terms.
-The \ndx{Cobham–Edmonds's Thesis}~\cite{cobham1965,edmonds1965} relates polynomial time class with the class of feasible functions\footnote{
+The \ndx{Cobham-Edmonds's Thesis}~\cite{cobham1965,edmonds1965} relates polynomial time class with the class of feasible functions\footnote{
     The Cobham-Edmonds Thesis asserts that the time complexities in any two \enquote{reasonable and general} models of computation are polynomially related;
     that is, a problem has time complexity \(t\) in some reasonable and general model of computation
     if and only if it has time complexity poly(\(t\)) in the model of single-tape \ndx{Turing Machine}s~\cite[p. 33]{goldreich2008}.}.