Skip to main content
Search

Yu Zhang

1 related articles

Subscribe to updates
  1. arXiv

    Concurrency bugs without brute-force scheduling: an agent reads semantics, finds 38 more bugs in the same budget

    Concurrency bugs surface only under specific thread interleavings, and a scheduler cannot tell which scheduling points matter. Reins turns an agent's reasoning about concurrency semantics into constraints on event orders and variable states for a controlled scheduler, then uses execution results to revise the hypothesis. On three public benchmarks it detects more bugs than existing controlled scheduling techniques within the same time budget, 38 more than the best baseline on the largest benchmark, and finds six previously unknown concurrency bugs in two real-world projects, three confirmed by developers.

You’re all caught up