--- a/PhdThesisRealOne/LaTeXTemplates_masters-doctoral-thesis_v2/example.bib	Wed Mar 23 10:09:32 2022 +0000
+++ b/PhdThesisRealOne/LaTeXTemplates_masters-doctoral-thesis_v2/example.bib	Thu Mar 24 20:52:34 2022 +0000
@@ -6,7 +6,13 @@
 
 %% Saved with string encoding Unicode (UTF-8) 
 
-
+@article{Rathnayake2014StaticAF,
+  title={Static Analysis for Regular Expression Exponential Runtime via Substructural Logics},
+  author={Asiri Rathnayake and Hayo Thielecke},
+  journal={ArXiv,
+  year={2014},
+  volume={abs/1405.7058}
+}
 
 @inproceedings{RibeiroAgda2017,
 	abstract = {We describe the formalization of a regular expression (RE) parsing algorithm that produces a bit representation of its parse tree in the dependently typed language Agda. The algorithm computes bit-codes using Brzozowski derivatives and we prove that produced codes are equivalent to parse trees ensuring soundness and completeness w.r.t an inductive RE semantics. We include the certified algorithm in a tool developed by us, named verigrep, for regular expression based search in the style of the well known GNU grep. Practical experiments conducted with this tool are reported.},