alwin.berger/FRET-LibAFL
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
FRET-LibAFL/fuzzers/baby/baby_fuzzer_minimizing
History
Andrea Fioraldi ce63b76558
Update to v0.15.3 (#3259) 
Co-authored-by: Dominik Maier <domenukk@gmail.com>
Co-authored-by: Dongjia "toka" Zhang <tokazerkje@outlook.com>
2025-05-23 22:50:23 +02:00
..
src
ScheduledMutator Fix with_max_stack_pow (#3148)
2025-04-12 20:35:31 +02:00
.gitignore
Restructure the fuzzers folder (#2409)
2024-07-19 18:24:24 +02:00
Cargo.lock
UPDATE LOCKFILE (#3267)
2025-05-23 16:35:30 +02:00
Cargo.toml
Update to v0.15.3 (#3259)
2025-05-23 22:50:23 +02:00
README.md
Restructure the fuzzers folder (#2409)
2024-07-19 18:24:24 +02:00

README.md

Baby fuzzer

This is a minimalistic example about how to create a libafl based fuzzer which leverages minimisation.

The fuzzer steps until a crash occurs, minimising each corpus entry as it is discovered. Then, once a solution is found, it attempts to minimise that as well.

The tested program is a simple Rust function without any instrumentation. For real fuzzing, you will want to add some sort to add coverage or other feedback.