Breadth-First Search
ConceptBreadth-first search (BFS) is a classical graph traversal algorithm that expands nodes level by level from a source. It is widely used as a building block in security and verification tools, including hardware fuzzing frameworks and symbolic execution engines.
First seen 8/5/2026
Last seen 8/5/2026
Evidence 1 chunks
Wiki v1
WIKI
Overview
Breadth-first search (BFS) is a classical graph traversal algorithm that explores a graph level by level, starting from a source node and visiting all neighbors before moving deeper. It is used as a subroutine in many domains, including program analysis, hardware verification, and security testing.
Use in Hardware Fuzzing (WhisperFuzz)
NEIGHBORHOOD
No graph connections found for this entity yet. It may appear in future ingestion runs.
explore full graph →RELATIONSHIPS
1 connectionsWhisperFuzz's Diagnozer uses breadth-first search to trace combinational signals to sequential elements.
LINKED ENTITIES
1 linksCITATIONS
3 sources3 citations — click to collapse
[1] WhisperFuzz's Diagnozer uses a breadth-first search over the Micro-Event Graph to trace dependencies from combinational signals to sequential elements. WhisperFuzz: White-Box Fuzzing for Detecting and Locating Timing Vulnerabilities in Processors
[2] An algorithm for searching specified bridges in the protection graph of the Take-Grant model is based on a classical breadth-first search. Algorithm for searching bridges of specified types in the protection graph for Take-Grant protection model
[3] Pinaka, a symbolic execution engine on top of CProver/Symex, supports breadth-first search as a state-exploration strategy alongside depth-first search. Pinaka: Symbolic Execution meets Incremental Solving (Competition Contribution)