Fuzzing is magic – Or how I found a panic in Rust's regex library

Re:Fuzzing is magic – Or how I found a panic in Rust's regex... by eru on Sunday April 02, 2017 @08:55AM (#14016975)

There are Turing-incomplete languages doing that kind of thing. Look up Coq and Idris etc. No runtime overhead necessary.

(Turing incompleteness is not too much of a restriction for them in practice.)

[ Parent | on HN ]

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".

[ Parent | on HN ]