Nice work! Any hint on how to deal efficiently with non-contextual rules that may make inputs invalid? And on how often such non-contextual rules are common in real-world input languages (compiler fuzzing excluded)?
And here comes our “world’s fastest fuzzier”, just announced at #FacebookTAV minutes ago. F1 compiles a grammar into a super-optimized producer; if you need megabytes of valid inputs per second, F1 is there for you. Kudos to @_rahulgopinath!https://twitter.com/_rahulgopinath/status/1197172631344164864 …
-
-
-
One way to deal with these would be to enrich grammars with constraints and generator functions: https://www.fuzzingbook.org/html/GeneratorGrammarFuzzer.html … If one compiled these as F1 does, you could get context-sensitive features still at high speed. Future work!
- Još 1 odgovor
Novi razgovor -
Čini se da učitavanje traje već neko vrijeme.
Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.