This artifact provides the means to validate and reproduce the results of the associated paper "Abstract Response-Time Analysis: A Formal Foundation for the Busy-Window Principle". In this artifact we demonstrate how to compile the source code and automatically check the proofs of each theorem. We also provide references to all key results claimed to be proven in the paper (including Abstract RTA and all eight instantiations), so that readers may confirm that no proofs have been omitted.
@Article{bozhko_et_al:DARTS.6.1.3, author = {Bozhko, Sergey and Brandenburg, Bj\"{o}rn B.}, title = {{Abstract Response-Time Analysis: A Formal Foundation for the Busy-Window Principle (Artifact)}}, pages = {3:1--3:2}, journal = {Dagstuhl Artifacts Series}, ISSN = {2509-8195}, year = {2020}, volume = {6}, number = {1}, editor = {Bozhko, Sergey and Brandenburg, Bj\"{o}rn B.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DARTS.6.1.3}, URN = {urn:nbn:de:0030-drops-123930}, doi = {10.4230/DARTS.6.1.3}, annote = {Keywords: hard real-time systems, response-time analysis, uniprocessor, busy window, fixed priority, EDF, verification, Coq, Prosa, preemptive, non-preemptive, limited-preemptive} }
5f10805963fcb235c83f7a7f0be07a52
(Get MD5 Sum)
Feedback for Dagstuhl Publishing