News Archive
- June 2025: New paper by Bedarkar et al. on RefinedProsa, a new end-to-end methodology for connecting Prosa with software verification — check it out.
- December 2023: New paper by Bozhko et al. on defining probabilistic worst-case execution time (pWCET) — check it out.
- June 2023: New paper by Fradet et al. on certifying CAN analysis results — check it out.
- November 2022: First public release of POET — check out the repository.
- November 2022: Prosa 0.5 released, with support for POET — read the release notes.
- October 2022: New paper by Bedarkar et al. on a case study in verified response-time analysis — check it out (PDF).
- July 2022: Maida et al. win an Outstanding Paper Award at ECRTS’22 for their paper introducing foundational response-time analysis as a means to obtain explainable and trustworthy evidence of timeliness — check it out (PDF).
- July 2022: New paper by Roux et al. on a formal link between response-time analysis and network calculus — check it out (PDF).
- July 2022: Fifth and final physical RT-PROOFS meeting @ ECRTS’22 in Modena, Italy.
- December 2021: New work-in-progress paper by Maida et al. on the automatic generation of proof-carrying response-time bounds — check it out (PDF).
- August 2021: New paper by Guo et al. on certified schedulability analysis in RT-CertiKOS — check it out (PDF).
- July 2020: Bozhko and Brandenburg win an Outstanding Paper Award at ECRTS’20 for their paper on abstract response-time analysis in Prosa — check it out (PDF).
- December 2019: Prosa 0.4 released, a completely refactored version of Prosa.
- October 2019: Fourth RT-PROOFS meeting @ Inria in Paris, France.
- July 2019: New paper by Guo et al. on a connection between CertiKOS and Prosa — check it out (PDF).
- June 2019: Up-to-date coqdoc documentation for the master branch and work-in-progress branches is now available at https://prosa.mpi-sws.org/branches.
- April 2019: New paper by Fradet et al. on CertiCAN, a tool for certified CAN analysis — check it out (PDF).
- April 2019: Third RT-PROOFS meeting @ TUBS in Braunschweig, Germany.
- December 2018: New paper by Fradet et al. on a generic proof of typical worst-case analysis at RTSS’18 — check it out (PDF).
- October 2018: New paper by Fradet et al. on generalized digraph models at RTNS’18 — check it out (PDF).
- September 2018: Second RT-PROOFS meeting @ MPI-SWS in Kaiserslautern, Germany.
- July 2018: Prosa 0.3 released, including a formalization of sustainability theory and self-suspending tasks.
- July 2018: New work-in-progress paper by Riffard et al. on support for synchronization protocols in Prosa — check it out (PDF)!
- July 2018: Cerqueira et al. win an Outstanding Paper Award at ECRTS’18 for their paper on strong and weak sustainability, with proofs checked in Prosa — check it out (PDF)!
- January 2018: First RT-PROOFS meeting @ ONERA in Toulouse, France.
- December 2017: New work-in-progress paper by Xiaojie Guo et al. on certified schedulability analysis tools — check it out (PDF)!
- October 2017: The French-German RT-PROOFS project, which leverages and seeks to improve Prosa, is funded by ANR and DFG for three years (≈660k EUR).
- July 2016: Cerqueira et al. win the ECRTS’16 Best Paper Award for their paper introducing Prosa.
- June 2016: Prosa 0.2 released, with support for arbitrary processor affinities (APA).
- May 2016: Prosa 0.1 released.
