AI & ML
DynamiQ: Unlocking the Potential of Dynamic Task Allocation in Parallel Fuzzing
arXiv cs.SE0 views
arXiv:2510.04469v3 Announce Type: replace Abstract: We present DynamiQ, a full-fledged and optimized successor to AFLTeam that supports dynamic and adaptive parallel fuzzing. Unlike most existing approaches that treat individual seeds as tasks, DynamiQ leverages structural information from the program's call graph to define tasks and continuously refines task allocation using runtime feedback. This design significantly reduces redundant exploration and enhances fuzzing efficiency at scale. Built on top of the state-of-the-art LibAFL framework, DynamiQ incorporates several practical optimizations in both task allocation and task-aware fuzzing. We evaluate DynamiQ on eighteen targets from Magma and FuzzBench with a total budget of over 40 CPU years. It achieves the highest mean branch coverage on fourteen targets, with average relative gains ranging from 8.37% to 19.53% over five baseline fuzzers. Across our experiments, DynamiQ identifies nine previously unknown bugs.
Source:https://arxiv.org/abs/2510.04469PreviousAdaptive Skill Granularity for Coding Agents: Runtime Routing and Macro-to-Micro RecoveryNextLIDL: LLM Integration Defect Localization via Knowledge Graph-Enhanced Multi-Agent Analysis
Related posts
Hybrid retrieval with reciprocal rank fusion: notes from a RAG prototype
0dev.to
It is in co-creating, together. As humans do.
0dev.to
C64 Basic Dungeon Crawler: Stairs, Levels and Levelling Up (Part 11)
0Hacker News
Anthropic's internal AI use, at retail prices, now exceeds its employee pay
0Hacker News
Launch HN: Momentic (YC W24) – Agents that catch bugs by using your app
0Hacker News

Behavioral Design Unpacked: Nudges, Funnels & Persuasion | UX Unpacked #3
0dev.to UX