Published at: 63rd ACM/IEEE Design Automation Conference (DAC '26), Long Beach, CA

Authors

  • Melisande Zonta-Roudes — ETH Zurich
  • Nora Hinderling — ETH Zurich
  • Shweta Shinde — ETH Zurich

Abstract

Verification flows use Verification IPs to identify assertion violations in on-chip protocol implementations, but patching those violations still requires manual effort. A good patch must not only fix the violation but also preserve functionality without introducing new violations. We propose Stitch, based on the intuition that given an implementation, a violated assertion and a counterexample, an LLM can synthesize patches. To evaluate Stitch, we built a dataset of 100 violations across 11 implementations of 5 protocols (AXI, AHB, APB, Wishbone, TileLink). Our first experiment reports a 19% success rate across four LLMs (GPT-4, GPT-5, Gemini, Claude). By analyzing the failed cases, we devised three improvement strategies — patch localization, violation-specific context (cone of influence, counterexample), and iterative feedback from model-checker outputs — that raise Stitch’s success rate to 61%, with GPT-5 dominating at 56%. We validate Stitch’s patches through simulation and on real hardware, and compare Stitch to three state-of-the-art non-LLM tools and existing patches.

Contributions

Stitch
Stitch
Automated patching of on-chip protocol implementations
Implementations
Patched 11 implementations across 5 protocols
Dataset
Dataset of 100 violations of on-chip communication protocols