Metraipolis › archive › dc_fd0b313785ff
PROVE-RT: Generating Mechanized Theorem Prover Scripts for Real-Time Systems using LLMs — arXiv:2608.12762
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.12762
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T04:17:21.742Z
- SHA-256 of the archived text
b6ec4d075e953b2995a62492dd15cac11335924a1a4f9f4cbe9b1708cf752b0f- Stable URL of this page
https://metraipolis.com/documento/dc_fd0b313785ff
How to cite
PROVE-RT: Generating Mechanized Theorem Prover Scripts for Real-Time Systems using LLMs — arXiv:2608.12762 — arXiv (en), https://arxiv.org/abs/2608.12762 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fd0b313785ff (Metraipolis archive dc_fd0b313785ff, sha256 b6ec4d075e953b2995a62492dd15cac11335924a1a4f9f4cbe9b1708cf752b0f)
BibTeX
@misc{dcfd0b313785ff,
title = {PROVE-RT: Generating Mechanized Theorem Prover Scripts for Real-Time Systems using LLMs — arXiv:2608.12762},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.12762},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fd0b313785ff; sha256 b6ec4d075e953b2995a62492dd15cac11335924a1a4f9f4cbe9b1708cf752b0f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.12762. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Schedulability analysis is essential for certifying real-time systems, but existing tests are often developed through pen-and-paper proofs that are difficult to scale, validate, and maintain. Mechanized verification in PROSA/ROCQ offers a rigorous alternative, yet manually constructing such proofs requires substantial domain expertise and proof-engineering effort. Recent successes of large language models (LLMs) across a wide range of tasks make them promising candidates for generating PROSA/ROCQ scripts for mechanized theorem provers. However, state-of-the-art LLMs often lack the PROSA-specific knowledge required to correctly use its modeling abstractions and proof patterns. This paper introduces PROVE-RT, an LLM-assisted framework for generating PROSA/ROCQ scripts to mechanize schedulability analyses in real-time systems literature. PROVE-RT guides generation through dependency-aware informal sketches, retrieval from processed PROSA documentation, staged skeleton generation, and proof completion. We construct a mechanization-oriented corpus from 1, 191 real-time systems papers, containing 13, 134 informal sketches with dependency information. On a curated evaluation set, direct prompting of state-of-the-art LLMs fails to reliably generate valid PROSA mechanizations, whereas PROVE-RT achieves a success rate of 44.7%. These results show that retrieval-guided and staged LLM assistance can improve automated mechanization of schedulability analysis in PROSA/ROCQ. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-14 in cs.AI). Categorie arXiv: Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2608.12762 — 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-19T04:13:06.547Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).