--- a/ChengsongTanPhdThesis/example.bib Fri Sep 30 01:47:33 2022 +0100
+++ b/ChengsongTanPhdThesis/example.bib Sat Oct 01 12:06:46 2022 +0100
@@ -6,6 +6,29 @@
%% Saved with string encoding Unicode (UTF-8)
+
+
+
+%% back-references--------------------
+@incollection{AHO1990255,
+title = {CHAPTER 5 - Algorithms for Finding Patterns in Strings},
+editor = {JAN {VAN LEEUWEN}},
+booktitle = {Algorithms and Complexity},
+publisher = {Elsevier},
+address = {Amsterdam},
+pages = {255-300},
+year = {1990},
+series = {Handbook of Theoretical Computer Science},
+isbn = {978-0-444-88071-0},
+doi = {https://doi.org/10.1016/B978-0-444-88071-0.50010-2},
+url = {https://www.sciencedirect.com/science/article/pii/B9780444880710500102},
+author = {Alfred V. AHO},
+abstract = {Publisher Summary
+This chapter discusses the algorithms for solving string-matching problems that have proven useful for text-editing and text-processing applications. String pattern matching is an important problem that occurs in many areas of science and information processing. In computing, it occurs naturally as part of data processing, text editing, term rewriting, lexical analysis, and information retrieval. Many text editors and programming languages have facilities for matching strings. In biology, string-matching problems arise in the analysis of nucleic acids and protein sequences, and in the investigation of molecular phylogeny. String matching is also one of the central and most widely studied problems in theoretical computer science. The simplest form of the problem is to locate an occurrence of a keyword as a substring in a sequence of characters, which is called the input string. For example, the input string queueing contains the keyword ueuei as a substring. Even for this problem, several innovative, theoretically interesting algorithms have been devised that run significantly faster than the obvious brute-force method.}
+}
+
+%% back-references--------------------
+
@article{fowler2003,
title={An interpretation of the POSIX regex standard},
author={Fowler, Glenn},
@@ -206,6 +229,18 @@
year = {2021},
bdsk-url-1 = {https://github.com/doyensec/regexploit}}
+@software{pcre,
+ author = {Philip Hazel},
+ date-added = {1997-01-01 00:00:00 +0000},
+ date-modified = {2021-06-14 00:00:00 +0000},
+ keywords = {Perl Compatible Regular Expressions},
+ month = {June},
+ title = {PCRE},
+ url = {https://www.pcre.org/original/doc/html/},
+ year = {2021},
+ bdsk-url-1 = {https://www.pcre.org/original/doc/html/}
+}
+
@misc{KuklewiczHaskell,
author = {Kuklewicz},
keywords = {Buggy C POSIX Lexing Libraries},