summaryrefslogtreecommitdiff
path: root/tex/thesis/thesis.bbl
diff options
context:
space:
mode:
Diffstat (limited to 'tex/thesis/thesis.bbl')
-rw-r--r--tex/thesis/thesis.bbl22
1 files changed, 0 insertions, 22 deletions
diff --git a/tex/thesis/thesis.bbl b/tex/thesis/thesis.bbl
deleted file mode 100644
index 66241d6..0000000
--- a/tex/thesis/thesis.bbl
+++ /dev/null
@@ -1,22 +0,0 @@
-\begin{thebibliography}{2}
-\providecommand{\natexlab}[1]{#1}
-\providecommand{\url}[1]{\texttt{#1}}
-\providecommand{\urlprefix}{URL }
-\providecommand{\href}[2]{#2}
-
-\bibitem[{Cousot and Cousot(1977)}]{CousotCousot77-1}
-P{.} Cousot and R{.} Cousot. 1977.
-\newblock Abstract interpretation: a unified lattice model for static analysis
- of programs by construction or approximation of fixpoints.
-\newblock In \emph{Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT
- Symposium on Principles of Programming Languages}, pages 238--252. ACM Press,
- New York, NY, Los Angeles, California.
-
-\bibitem[{Gawlitza and Seidl(2007)}]{Gawlitza:2007:PFC:1762174.1762203}
-Thomas Gawlitza and Helmut Seidl. 2007.
-\newblock \href{http://dl.acm.org/citation.cfm?id=1762174.1762203}{Precise
- fixpoint computation through strategy iteration}.
-\newblock In \emph{Proceedings of the 16th European conference on Programming},
- ESOP'07, pages 300--315. Springer-Verlag, Berlin, Heidelberg.
-
-\end{thebibliography}