Binary Search-Based Minimization

Concept

Binary search-based minimization is a test-case reduction technique employed by the RISC-V CPU bug-finding tool RISCSmith. When RISCSmith detects a behavioral divergence between a target CPU and a golden reference model, it logs the executed instructions and applies this algorithm to isolate the shortest instruction sequence that consistently reproduces the bug.

First seen 7/1/2026

Last seen 7/1/2026

Evidence 1 chunks

Wiki v1

WIKI

Binary Search-Based Minimization

Overview

Binary search-based minimization is a test-case reduction strategy used by the RISCSmith tool to compress the size of a divergent instruction sequence down to the smallest program that still reliably reproduces a detected bug in a RISC-V CPU ^[1].

READ FULL ARTICLE →

NEIGHBORHOOD

No graph connections found for this entity yet. It may appear in future ingestion runs.

explore full graph →

RELATIONSHIPS

1 connections

RISCSmith ← implements 100% 1e

RISCSmith applies a binary search-based minimization algorithm to isolate the shortest instruction sequence that triggers a bug.

LINKED ENTITIES

1 links

RISCSmith IMPLEMENTS Extracted graph relationship

CITATIONS

2 sources

2 citations — click to collapse

[1] RISCSmith logs executed instructions from the target CPU, deterministically reproduces a divergence, and applies a binary search-based minimization algorithm to isolate the shortest instruction sequence that consistently triggers the bug. RISCSmith: Finding RISC-V CPU Bugs via Rich Instruction ...

[2] RISCSmith compares contexts across multiple implementations or against a golden reference model to detect divergences in exception behavior, register state, or memory contents. RISCSmith: Finding RISC-V CPU Bugs via Rich Instruction ...