Metraipolis › archive › dc_7b4966f2d105

ProsaBuddy: Assisting Mechanized Real-Time Schedulability Analysis with LLM-based Agents — arXiv:2610.03796

Source
arXiv
Original
https://arxiv.org/abs/2610.03796
License (as archived)
CC0-1.0
Archived
2026-10-06T05:25:49.377Z
SHA-256 of the archived text
5e775de53629a7798be1dce22004045ff6cfd1ba7845e8e7eaf751264420792e
Stable URL of this page
https://metraipolis.com/documento/dc_7b4966f2d105

How to cite

ProsaBuddy: Assisting Mechanized Real-Time Schedulability Analysis with LLM-based Agents — arXiv:2610.03796 — arXiv, https://arxiv.org/abs/2610.03796 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7b4966f2d105 (Metraipolis archive dc_7b4966f2d105, sha256 5e775de53629a7798be1dce22004045ff6cfd1ba7845e8e7eaf751264420792e)
BibTeX
@misc{dc7b4966f2d105,
  title = {ProsaBuddy: Assisting Mechanized Real-Time Schedulability Analysis with LLM-based Agents — arXiv:2610.03796},
  howpublished = {arXiv},
  url = {https://arxiv.org/abs/2610.03796},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7b4966f2d105; sha256 5e775de53629a7798be1dce22004045ff6cfd1ba7845e8e7eaf751264420792e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.03796. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Rigorous schedulability analysis is essential for the design of hard real-time systems, yet errors in pen-and-paper proofs threaten the safety of critical applications. The Prosa initiative addresses this by offering a foundation for building machine-checkable schedulability analysis proofs in the Rocq proof assistant. However, the substantial time and expertise required to construct such proofs remain a major barrier for wider adoption of Prosa. This work presents ProsaBuddy, an LLM?based agent system designed to lower the effort needed to develop mechanized real-time schedulability proofs. ProsaBuddy employs a ReAct loop with retrieval over the Prosa codebase, access to Rocq tools and optional human-written hints. It uses a subgoal?delegation architecture, decomposing a lemma into subgoals and dispatches them to subagents for proof. We evaluate ProsaBuddy on a mini benchmark drawn from real-time scheduling literature. Experiment results show that ProsaBuddy significantly outper?forms state-of-the-art LLM-based Rocq automated proving agent systems and a general coding agent OpenCode

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Logic in Computer Science (cs.LO) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2610.03796 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T05:24:05.742Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).