7 %% Saved with string encoding Unicode (UTF-8) |
7 %% Saved with string encoding Unicode (UTF-8) |
8 |
8 |
9 @article{Rathnayake2014StaticAF, |
9 @article{Rathnayake2014StaticAF, |
10 title={Static Analysis for Regular Expression Exponential Runtime via Substructural Logics}, |
10 title={Static Analysis for Regular Expression Exponential Runtime via Substructural Logics}, |
11 author={Asiri Rathnayake and Hayo Thielecke}, |
11 author={Asiri Rathnayake and Hayo Thielecke}, |
12 journal={ArXiv, |
12 journal={ArXiv}, |
13 year={2014}, |
13 year={2014}, |
14 volume={abs/1405.7058} |
14 volume={abs/1405.7058} |
|
15 } |
|
16 |
|
17 @inproceedings{Weideman2017Static, |
|
18 title={Static analysis of regular expressions}, |
|
19 author={Nicolaas Weideman}, |
|
20 year={2017} |
15 } |
21 } |
16 |
22 |
17 @inproceedings{RibeiroAgda2017, |
23 @inproceedings{RibeiroAgda2017, |
18 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.}, |
24 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.}, |
19 address = {New York, NY, USA}, |
25 address = {New York, NY, USA}, |
107 @software{regexploit2021, |
113 @software{regexploit2021, |
108 author = {Ben Caller, Luca Carettoni}, |
114 author = {Ben Caller, Luca Carettoni}, |
109 date-added = {2020-11-24 00:00:00 +0000}, |
115 date-added = {2020-11-24 00:00:00 +0000}, |
110 date-modified = {2021-05-07 00:00:00 +0000}, |
116 date-modified = {2021-05-07 00:00:00 +0000}, |
111 keywords = {ReDos static analyser}, |
117 keywords = {ReDos static analyser}, |
112 month = {May} |
118 month = {May}, |
113 title = {regexploit} |
119 title = {regexploit}, |
114 url = {https://github.com/doyensec/regexploit} |
120 url = {https://github.com/doyensec/regexploit}, |
115 year = {2021} |
121 year = {2021} |
116 } |
122 } |
117 |
123 |
118 @misc{KuklewiczHaskell, |
124 @misc{KuklewiczHaskell, |
119 title = {Regex Posix}, |
125 title = {Regex Posix}, |
120 author = {Kuklewicz}, |
126 author = {Kuklewicz}, |
121 keywords = {Buggy C POSIX Lexing Libraries}, |
127 keywords = {Buggy C POSIX Lexing Libraries}, |
122 url = {https://wiki.haskell.org/Regex_Posix}, |
128 url = {https://wiki.haskell.org/Regex_Posix}, |
123 year = {2017} |
129 year = {2017} |
124 } |
130 } |
125 |
131 @misc{regex101, |
|
132 title = {regex101}, |
|
133 author = {Firas Dib}, |
|
134 year = {2011}, |
|
135 url = {https://regex101.com/}, |
|
136 keywords = {regex tester debugger} |
|
137 } |
126 |
138 |
127 @techreport{grathwohl2014crash, |
139 @techreport{grathwohl2014crash, |
128 title={A Crash-Course in Regular Expression Parsing and Regular Expressions as Types}, |
140 title={A Crash-Course in Regular Expression Parsing and Regular Expressions as Types}, |
129 author={Grathwohl, Niels Bj{\o}rn Bugge and Henglein, Fritz and Rasmussen, Ulrik Terp}, |
141 author={Grathwohl, Niels Bj{\o}rn Bugge and Henglein, Fritz and Rasmussen, Ulrik Terp}, |
130 year={2014}, |
142 year={2014}, |