From a8bb7736e2e86963bd5761cc05079447abeeaba6 Mon Sep 17 00:00:00 2001
From: ericmarin <maarin.eric@gmail.com>
Date: Tue, 23 Jun 2026 15:26:01 +0200
Subject: using official template + fixing language errors

---
 main.tex | 68 ----------------------------------------------------------------
 1 file changed, 68 deletions(-)
 delete mode 100644 main.tex

(limited to 'main.tex')

diff --git a/main.tex b/main.tex
deleted file mode 100644
index 1fce155..0000000
--- a/main.tex
+++ /dev/null
@@ -1,68 +0,0 @@
-\documentclass[12pt,a4paper,twoside]{report}
-\usepackage[utf8]{inputenc}
-\usepackage[T1]{fontenc}
-\usepackage[english]{babel}
-\usepackage{graphicx}
-\usepackage{amsmath, amssymb, amsthm}
-\usepackage{cite}
-\usepackage[colorlinks=true, linkcolor=black, citecolor=black, urlcolor=black]{hyperref}
-\usepackage[linesnumbered,ruled,vlined]{algorithm2e}
-\usepackage[nameinlink]{cleveref}
-\usepackage{xspace}
-\usepackage[colorinlistoftodos]{todonotes}
-\usepackage[scaled=.83]{beramono} 
-\usepackage{lineno}
-\usepackage{tikz-inet}
-\usepackage{stmaryrd}
-\usepackage{float}
-\usepackage{tablefootnote}
-
-\usetikzlibrary{calc}
-\linenumbers
-\crefname{algocf}{alg.}{algs.}
-\Crefname{algocf}{Algorithm}{Algorithms}
-\crefformat{footnote}{#2\footnotemark[#1]#3}
-
-\input{macros}
-\input{cmds}
-
-\title{VEIN: VErification via Interaction Nets for Neural Networks}
-\author{Eric Marin}
-\date{\today}
-
-\begin{document}
-
-\maketitle
-
-\begin{abstract}
-	This thesis introduces \textbf{VEIN} (VErification via Interaction Nets), a framework for neural network
-	verification with a focus on neural network equivalence. It acts as a	formally verified
-	preprocessor that reduces neural networks to a normal form before they can be compared by a solver.
-	To enable this reduction, \textbf{VEIN} translates neural networks into Interaction Nets, a graph rewriting
-	computational model, and applies a set of graph rewriting rules to reduce the network into an
-	Abstract Syntax Tree. We present the complete framework and provide in detail: the translation
-	process, the graph rewriting rules and rigorous proofs of both soundness and termination for the
-	reduction process.
-\end{abstract}
-
-\tableofcontents
-
-% Introduction: Context -> Problem -> Solution -> Validation -> Outline
-\input{chapters/01-introduction}
-
-% Background
-\input{chapters/02-background}
-
-% Core
-\input{chapters/03-core}
-
-% Related Work
-\input{chapters/04-related-work}
-
-% Conclusion
-\input{chapters/05-conclusion}
-
-\bibliographystyle{plain}
-\bibliography{references}
-
-\end{document}
-- 
cgit v1.2.3

