A Randomized Scheduler with Probabilistic Guarantees of Finding Bugs

Lobsters Hottest 05/09/26, 04:27 AM Papers

Summary

This Microsoft Research paper introduces a randomized scheduling technique designed to provide probabilistic guarantees for uncovering bugs in software systems. Published for the ASPLOS conference, it focuses on systematic fault detection through algorithmic randomness.

<p><a href="https://lobste.rs/s/zlcctc/randomized_scheduler_with">Comments</a></p>

Original Article

View Cached Full Text

Cached at: 05/09/26, 04:36 AM

https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/asplos277-pct.pdf > **Technical Note:** The provided text contains raw, compressed PDF stream data and internal object definitions (`/Filter /FlateDecode`, `endstream`, `endobj`) rather than readable Chinese article content. No translation can be performed.

Similar Articles

@dair_ai: If you design production agent systems, this matters. Most devs accidentally let their framework defaults make critical…

X AI KOLs Following

This paper introduces the concept of the stochastic-deterministic boundary (SDB) for production LLM agents and provides a methodology for selecting architectural patterns to improve reliability and performance.

How did software get so reliable without proof? (1996)

Lobsters Hottest

This 1996 paper explores the reasons behind the increasing reliability of software despite the lack of formal proofs, discussing informal methods and engineering practices.

Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling

arXiv cs.AI

This paper proposes a gated hyper-heuristic for job shop scheduling that uses regret-normalized rollout labels and contextual KNN uncertainty estimates to reduce label generation costs and avoid switching away from strong default rules unless the predicted improvement is credible. Experiments show the gated selector achieves low mean relative percentage deviation while significantly reducing computational cost.

Enforcing Constraints in Generative Sampling via Adaptive Correction Scheduling

arXiv cs.LG

This research paper introduces adaptive correction scheduling for enforcing hard constraints in generative sampling, demonstrating that it improves the cost-accuracy frontier compared to terminal or stepwise projection methods.

On the Reliability of Computer Use Agents

Hugging Face Daily Papers

A preprint analyzing why computer-use agents succeed once but fail on repeated executions, attributing unreliability to execution stochasticity, task ambiguity, and behavioral variability, and advocating repeated evaluation and stable strategies.