Re:Fuzzing is magic – Or how I found a panic in Rust's regex...
by burntsushi on Sunday April 02, 2017 @09:27AM
(#14017087)
I know about them. That's why I added my criteria of Turing completeness. But perhaps I am wrong. Has anyone written a production grade regex engine in say, Coq or Agda? Can they prevent all possible invalid states? Can they support searching text of arbitrary length?
[ Parent
| on HN ]
Re:Fuzzing is magic – Or how I found a panic in Rust's regex...
by eru on Sunday April 02, 2017 @04:25PM
(#14018867)
Arbitrary length shouldn't be a problem. Agda and co are not restricted to programs of finite runtime.
Not sure about production grade, but Google has plenty of results for "Agda regular expressions".