Clover fixes 96.8% of bugs on an RTL-repair benchmark using stochastic tree-of-thoughts and neural-symbolic agents, outperforming traditional and LLM baselines by 94% and 63% respectively with 87.5% pass@1.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
years
2026 4verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
WarpL uses mutation to find and isolate suboptimal instruction sequences causing performance issues in WebAssembly runtimes by comparing machine code of original and non-problematic mutant programs.
Pecker reconstructs causal chains in sequential hardware designs via temporal backtracking with Estimated Minimal Propagation Cycles and trace pruning, localizing 51%/80%/85% of bugs in top-1/3/5 ranks on benchmarks.
CIDER improves throughput of memory-disaggregated KV stores by up to 6.6x on YCSB by replacing optimistic synchronization with pessimistic synchronization, global write-combining, and a contention-aware scheme.
citing papers explorer
-
Clover: A Neural-Symbolic Agentic Harness with Stochastic Tree-of-Thoughts for Verified RTL Repair
Clover fixes 96.8% of bugs on an RTL-repair benchmark using stochastic tree-of-thoughts and neural-symbolic agents, outperforming traditional and LLM baselines by 94% and 63% respectively with 87.5% pass@1.
-
Debugging Performance Issues in WebAssembly Runtimes via Mutation-based Inference
WarpL uses mutation to find and isolate suboptimal instruction sequences causing performance issues in WebAssembly runtimes by comparing machine code of original and non-problematic mutant programs.
-
Pecker: Bug Localization Framework for Sequential Designs via Causal Chain Reconstruction
Pecker reconstructs causal chains in sequential hardware designs via temporal backtracking with Estimated Minimal Propagation Cycles and trace pruning, localizing 51%/80%/85% of bugs in top-1/3/5 ranks on benchmarks.
-
CIDER: Boosting Memory-Disaggregated Key-Value Stores with Pessimistic Synchronization
CIDER improves throughput of memory-disaggregated KV stores by up to 6.6x on YCSB by replacing optimistic synchronization with pessimistic synchronization, global write-combining, and a contention-aware scheme.