aspireai.
PUBLIC EDITION

Typed Template Fuzzing let an LLM write the test templates once, then found 97 previously unknown bugs without further LLM calls

AspireAI community · arXiv (cs.SE) — University of Manchester
LLM-based fuzzers can generate semantically valid inputs, but every test case costs an LLM query and gives up the throughput that makes traditional fuzzing fast. Typed Template Fuzzing flips that: an LLM runs once in a preprocessing step to write templates that encode the semantics of seed files, and those templates then produce semantically-aware mutations with no parser, no type-checker and no further LLM calls. The team ran a five-month campaign with their tool, Typos, finding 97 previously undiscovered bugs while producing valid inputs 94.7% of the time across SMT-LIB2, C, C++, Go, Rust, SystemVerilog, Scala, Java, PyTorch and Qiskit. The honest limitation is that the mutation grammar is only as good as the templates the model wrote, so quality still depends on that single preprocessing pass.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.