fuzzcheck-rs
wg-allocators
fuzzcheck-rs | wg-allocators | |
---|---|---|
10 | 19 | |
441 | 216 | |
0.2% | 1.9% | |
3.8 | 0.0 | |
23 days ago | about 4 years ago | |
Rust | ||
MIT License | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
fuzzcheck-rs
- Fuzzcheck-rs: Structure-aware, in-process, coverage-guided fuzzing engine for Ru
-
The sad state of property-based testing libraries
Agreed. A while back I played around with fuzzcheck [1], which let's you write coverage-guided, structure-aware property tests, but the generation is smarter than just slamming a fuzzer's `&[u8]` input into `Arbitrary`. It also supports shrinking, which is nice. Don't know that I would recommend it though. It seemed difficult to write your own `Mutator`s. It also looks somewhat unmaintained nowadays, but I think the direction is worth exploring.
[1]: https://github.com/loiclec/fuzzcheck-rs/
-
Fuzzcheck (a structure-aware Rust fuzzer)
Fuzzcheck is a structure-aware fuzzer for rust. "Fuzzing" means feeding large amounts of data into a program and checking for crashes (Fuzzcheck also checks to make sure that all the properties your program should uphold – e.g. a sorting algorithm applied to a list of n items should always return a list of n items – are upheld). Fuzzcheck is an "evolutionary" fuzzer – this means that it generates a set of random inputs, sees what percentage of the program is executed for each input, and keeps inputs which have high levels of percentage of program executed. It then "mutates" these inputs – whereas fuzzers such as AFL/Hongfuzz/etc mutate raw bytes in place (e.g. they swap bytes at different positions, or insert a random byte at a given position to generate inputs similar to the chosen "high coverage" inputs), Fuzzcheck works directly on the Rust types (so it might swap the order of two items in a vec, or randomly insert a new item). It's a really powerful tool for finding lots of bugs.
-
fuzzcheck 0.9 release - run coverage-guided fuzz tests alongside your regular unit tests + code coverage visualiser + new online guide and improved documentation
If you want help with Win support (issues/8) maybe post it here to get it added to TWIR.
-
What's everyone working on this week (43/2021)?
I am working on a code coverage viewer for my fuzzer (fuzzcheck). I described what I've done so far in this issue and I am hoping to release the first version within two weeks.
-
What's everyone working on this week (31/2021)?
The implications for my fuzzer, fuzzcheck, are huge! Compiling fuzz tests is a lot easier. There should be no more need to create a separate fuzz folder, fuzz tests can be regular #[test] functions, private implementation details can be fuzz-tested as well, rust-analyser works as expected, documentation can be easily generated, etc. I can also attach a human-readable coverage report to every test case :)
-
What's everyone working on this week (30/2021)?
Since I graduated, I have had a lot more time to work on fuzzcheck. I am trying to flesh it out, test it, and document it for a new release. It has always felt a bit rushed/experimental and now I am hoping to make it into something solid. I have also played with an egui interface for it, to visualise the tested code coverage, understand how the fuzzer’s decisions are made, and also to interactively tweak the fuzzer’s behaviour. It's a lot of work but it's slowly all coming together! :)
-
What's your favourite under-rated Rust crate and why?
fuzzcheck-rs is really cool. It combines property-testing with fuzzing, getting the nice, structured nature of the former, and the coverage-driven search of the latter, but it works by mutating the structure directly instead of going through a bit string. So if you have a binary tree, going from A(B, C) to A(C, B) can be a single mutation away if that makes sense in your use case, instead of being arbitrarily far away in the bitstring approach.
- Fuzzcheck: Structure and coverage guided fuzzing for Rust
wg-allocators
-
MiniJinja: Learnings from Building a Template Engine in Rust
Yeah that makes sense. Maybe arenas will be viable once the working group makes progress on allocators. https://github.com/rust-lang/wg-allocators
-
Anouncing `stabby` 1.0!
Tracking issue for Storages, and a TLDR on what it is
- What backwards-incompatible changes would you make in a hypothetical Rust 2.0?
-
Custom allocators in Rust
I must have gotten confused, since from your brief discussion with CAD97 it seemed like there was a way for the concepts to live separately and that Storage could complicate things in comparison. But if implementing Allocator in terms of Storage is basically equivalent and Storage is flexible enough that I could write one to pass memory out to unsafe code, that works just as well.
-
Zig and Rust
https://rust-lang.github.io/rfcs/1974-global-allocators.html was the original RFC.
My vague understanding is that there's a working group https://github.com/rust-lang/wg-allocators
The further I get from working on Rust day to day, the less I know about these things, so that's all I've got for you.
-
Rust went from side project to world’s fastest growing language
If you self-reference using pointers and guarantee the struct will never move, you don't even need unsafe. If you self-reference using offsets from the struct's base pointer, you need a splash of unsafe but your struct can be freely moved without invalidating its self-referential "pointers".
Per-struct allocators are a work in progress (see https://github.com/rust-lang/wg-allocators/issues/48).
Not sure what "non thread local addresses" means, but in my experience Rust is pretty good at sending data between threads (without moving it).
- Rust is coming to the Linux kernel
-
FunDSP 0.1.0, an audio processing and synthesis library
Besides that allocation is not really a problem for no_std. It's resolved by using alloc crate directly, so anything usable with custom allocators is supported. Example in dasp sources - https://github.com/RustAudio/dasp/blob/master/dasp_slice/src/boxed.rs#L14-L19 . Also worth looking at this issue to check what is usable already - https://github.com/rust-lang/wg-allocators/issues/7
-
Andrew Kelley claims Zig is faster than Rust in perfomance
But that's on track for rust as well: https://github.com/rust-lang/wg-allocators/issues/7
-
Which important features from C/C++ are missing in Rust
Here: https://github.com/rust-lang/rfcs/pull/1398. there is also a working group for this: https://github.com/rust-lang/wg-allocators.
What are some alternatives?
uivonim - Fork of the Veonim Neovim GUI
serde-plain - A serde serializer that serializes a subset of types into plain strings
rs_pbrt - Rust crate to implement a counterpart to the PBRT book's (3rd edition) C++ code. See also https://www.rs-pbrt.org/about ...
rules_rust - Rust rules for Bazel
sonyflake-rs - 🃏 A distributed unique ID generator inspired by Twitter's Snowflake.
enum-map