updates to L32, L33 to reflect content covered.

Lectures/L32_WhiteBoxTesting/WhiteBoxTesting.tex

@@ -404,132 +404,6 @@ application or version of the application
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 
-\begin{frame}
-\frametitle{White-box Coverage Testing}
-
-\begin{itemize}
-\item (In)adequacy criteria - if significant parts of the program structure are
-  not tested, testing is inadequate
-\item Control flow coverage criteria
-\begin{itemize}
-\item Statement coverage
-\item Edge coverage
-\item Condition coverage
-\item Path coverage
-\end{itemize}
-\end{itemize}
-
-\end{frame}
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-
-\begin{frame}
-\frametitle{Statement-Coverage Criterion}
-
-\begin{itemize}
-\item Select a test set $T$ such that every elementary statement in $P$ is
-  executed at least once by some $d$ in $T$
-\item An input datum executes many statements - try to minimize the number of
-  test cases still preserving the desired coverage
-\end{itemize}
-
-\end{frame}
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-
-\begin{frame}
-\frametitle{Example}
-
-\includegraphics[scale=0.5]{../Figures/ExampleStatementCoverageOnlyCode.png}
-
-\end{frame}
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-
-\begin{frame}
-\frametitle{Example}
-
-\includegraphics[scale=0.5]{../Figures/ExampleStatementCoverage.png}
-
-\end{frame}
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-
-\begin{frame}
-\frametitle{Weakness of the Criterion}
-
-\includegraphics[scale=0.6]{../Figures/WeaknessStatementCoverageOnlyCode.png}
-
-\end{frame}
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-
-\begin{frame}
-\frametitle{Weakness of the Criterion}
-
-\includegraphics[scale=0.6]{../Figures/WeaknessStatementCoverage.png}
-
-\end{frame}
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-
-\begin{frame}
-\frametitle{Edge-Coverage Criterion}
-
-\begin{itemize}
-\item Select a test set $T$ such that every edge (branch) of the control flow is
-  exercised at least once by some $d$ in $T$
-\item This requires formalizing the concept of the control graph and how to
-  construct it
-\begin{itemize}
-\item Edges represent statements
-\item Nodes at the ends of an edge represent entry into the statement and exit
-\end{itemize}
-\end{itemize}
-
-\end{frame}
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-
-\begin{frame}
-\frametitle{Control Graph Construction Rules}
-
-\includegraphics[scale=0.4]{../Figures/ControlGraphRules.png}
-
-\end{frame}
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-
-\begin{frame}
-\frametitle{Simplification}
-
-A sequence of edges can be collapsed into just one edge\\
-~\newline
-
-\includegraphics[scale=0.5]{../Figures/Simplification.png}
-
-\end{frame}
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-
-\begin{frame}
-\frametitle{Example: Euclid's Algorithm}
-
-\includegraphics[scale=0.5]{../Figures/EuclidsAlgorithm.png}
-
-\end{frame}
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-
-\begin{frame}
-\frametitle{Weakness}
-
-\includegraphics[scale=0.4]{../Figures/WeaknessEdgeCoverage.png}\\
-\uncover<2->{\structure{Do not discover the error ($<$ instead of $\leq$)}}
-
-\end{frame}
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 
 \end{document}
 

Lectures/L33_WhiteBoxTestingContinued/WhiteBoxTestingContinued.tex

@@ -62,7 +62,7 @@
 
 \end{frame}
 
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 
 \begin{frame}
 \frametitle{Administrative Details}
@@ -86,7 +86,102 @@
 
 \end{frame}
 
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+\begin{frame}
+\frametitle{Theoretical Foundations Of Testing: Definitions}
+\begin{itemize}
+\item P (program), D (input domain), R (output domain)
+\bi
+\item P: D $\rightarrow$ R (may be partial)
+\ei
+\item Correctness defined by OR $\subseteq$ D $\times$ R
+\bi
+\item P(d) correct if $\langle$ d, P(d) $\rangle \in$ OR
+\item P correct if all P(d) are correct
+\ei
+\item Failure
+\bi
+\item P(d) is not correct
+\item May be undefined (error state) or may be the wrong result
+\ei
+\item Error (Defect)
+\bi
+\item Anything that may cause a failure
+\bi
+\item Typing mistake
+\item Programmer forgot to test ``x=0''
+\ei
+\ei
+\item Fault
+\bi
+\item Incorrect intermediate state entered by program
+\ei
+\end{itemize}
+\end{frame}
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+\begin{frame}
+\frametitle{Definitions Questions}
+\begin{itemize}
+\item \structure{A test case t is an element of D or R?}
+\item \structure{A test set T is a finite subset of D or R?}
+\item \structure{How would we define whether a test is successful?}
+\item \structure{How would we define whether a test set is successful?}
+\end{itemize}
+\end{frame}
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+\begin{frame}
+\frametitle{Definitions Continued}
+\begin{itemize}
+\item Test case t: An element of D
+\item Test set T: A finite subset of D
+\item Test is successful if P(t) is correct
+\item Test set successful if P correct for all t in T
+\end{itemize}
+\end{frame}
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+\begin{frame}
+\frametitle{Theoretical Foundations of Testing}
+
+\begin{itemize}
+\item Desire a test set $T$ that is a finite subset of $D$ that will uncover all errors
+\item Determining and ideal $T$ leads to several
+  \href{https://en.wikipedia.org/wiki/Undecidable_problem}{undecideable
+    problems}
+\item No algorithm exists:
+\bi
+\item To state if a test set will uncover all possible errors
+\item To derive a test set that would prove program correctness
+\item To determine whether suitable input exists to guarantee execution of a
+  given statement in a given program
+\item etc.
+\ei
+\end{itemize}
+
+\end{frame}
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+\begin{frame}
+\frametitle{Empirical Testing}
+
+\begin{itemize}
+\item Need to introduce empirical testing principles and heuristics as a
+  compromise between the impossible and the inadequate
+\item Find a strategy to select \structure{significant} test cases
+\item Significant means the test cases have a high potential of uncovering the
+  presence of errors
+\end{itemize}
+
+\end{frame}
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 
 \begin{frame}
 \frametitle{Complete-Coverage Principle}