From b71c60cb875d99436295f0bfa457f403f7bc6480 Mon Sep 17 00:00:00 2001
From: sjcjoosten <sjcjoosten+github@gmail.com>
Date: Sun, 12 Nov 2023 08:44:48 -0600
Subject: [PATCH] Retitled chapter for SJC

---
 2022Migration/articleMigrationFACS.tex | 11 ++++++-----
 1 file changed, 6 insertions(+), 5 deletions(-)

diff --git a/2022Migration/articleMigrationFACS.tex b/2022Migration/articleMigrationFACS.tex
index 14cae5c..b5c8914 100644
--- a/2022Migration/articleMigrationFACS.tex
+++ b/2022Migration/articleMigrationFACS.tex
@@ -508,7 +508,7 @@ \subsection{Constraints}
 \begin{equation}
    \begin{array}[t]{l}
       \viol{u}{\pair{\triples\cup\{\triple{a}{\declare{n}{A}{B}}{b}\mid\pair{a}{b}\in\viol{u}{\dataset}\}}{\instance\cup\instance'}}=\emptyset\\
-      \text{\bf where}\ \instance'=\{ \pair{a}{A}\mid\pair{a}{b}\in\viol{u}{\dataset}\}\cup\{ \pair{b}{B}\mid\pair{a}{b}\in\viol{u}{\dataset}\}
+      \text{\bf with}\ \instance'=\{ \pair{a}{A}\mid\pair{a}{b}\in\viol{u}{\dataset}\}\cup\{ \pair{b}{B}\mid\pair{a}{b}\in\viol{u}{\dataset}\}
    \end{array}
 \label{eqn:transaction}
 \end{equation}
@@ -665,7 +665,7 @@ \subsection{Algorithm for generating a migration script}
    \begin{align}
       \rules_\text{block}={}&\{v\ 
       \begin{array}[t]{l}
-         \text{\bf where}\\
+         \text{\bf with}\\
          \sign{v}=\sign{u}\\
          \viol{v}{\dataset}=\viol{\overrightarrow{u}}{\dataset}\cap{\tt fixed}_u
       \end{array}\\
@@ -682,7 +682,7 @@ \subsection{Algorithm for generating a migration script}
    \begin{align}
       \busConstraints_\text{fix}={}&\{v\ 
       \begin{array}[t]{l}
-         \text{\bf where}\\
+         \text{\bf with}\\
          \sign{v}=\sign{u}\\
          \viol{v}{\dataset}=\viol{\overrightarrow{u}}{\dataset}-{\tt fixed}_u
       \end{array}\\
@@ -712,7 +712,8 @@ \subsection{Algorithm for generating a migration script}
 \end{equation}
    After this, the migration engineer can remove the migration system and the old system.
 
-\subsection{Proof Obligations}
+\subsection{System properties}
+% TODO: SJC
 \label{sct:Proof}
    A theorem prover, Isabelle/HOL, is used to establish the correctness of the presented algorithm.
    This section discusses the proof obligations. The proof is available online.
@@ -776,7 +777,7 @@ \subsection{Proof Obligations}
       \forall u\in\rules_{\schema'}-\rules_{\schema}.~\viol{\overrightarrow{u}}{\dataset}={\tt fixed}_u\ \Rightarrow\ (\text{isIS}\pair{\dataset}{\schema_\migrsys}\Leftrightarrow\text{isIS}\pair{\dataset}{\schema'})
    \end{equation}
 \end{enumerate}
-\section{Validation}
+\paragraph{Validation}
    As the system responds to events, it changes its data set, while the schema remains the same.
    In this paper, it suffices to define an event as a pair of systems for which the schema stays constant.
    Events are categorized by the part of the data set that changes.