Explore an innovative approach to seed scheduling for fuzzing presented in this 22-minute IEEE conference talk. Discover how researchers from Columbia University leverage graph centrality analysis to enhance fuzzing effectiveness. Learn about the K-Scheduler algorithm, its implementation, and its potential impact on improving software testing and vulnerability detection techniques.
K-Scheduler - Effective Seed Scheduling for Fuzzing with Graph Centrality Analysis
Overview
Syllabus
K-Scheduler: Effective Seed Scheduling for Fuzzing with Graph Centrality Analysis
Taught by
IEEE Symposium on Security and Privacy
Tags
Related Courses
-
BEACON - Directed Grey-Box Fuzzing with Provable Path Pruning
-
SelectFuzz - Efficient Directed Fuzzing with Selective Path Exploration
-
FuzzUSB - Hybrid Stateful Fuzzing of USB Gadget Stacks
-
Program-Adaptive Mutational Fuzzing
-
GraphSPD - Graph-Based Security Patch Detection with Enriched Code Semantics
-
VIDEZZO - Dependency-Aware Virtual Device Fuzzing
