Modern intelligent software systems are rapidly growing in complexity and scale, and many real usage scenarios might be impossible to reproduce and validate at design-time. As envisioned by the Models@run.time research community, the use of formal models at runtime are fundamental to address this challenge. In this paper, we explore the concept of ASM@run.time and put this definition into the context of the runtime enforcement technique to address the runtime assurance of software systems. This is a work-in-progress research line.
If you cannot see the document below, the PDF document is most likely not freely accessible. In this case, please try to access the document via this link.
% BibTex
@inproceedings{RiccobeneS20,
author = {Elvinia Riccobene and
Patrizia Scandurra},
editor = {Alexander Raschke and
Dominique M{\'{e}}ry and
Frank Houdek},
title = {Exploring the Concept of Abstract State Machines for System Runtime
Enforcement},
booktitle = {Rigorous State-Based Methods - 7th International Conference, {ABZ}
2020, Ulm, Germany, May 27-29, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12071},
pages = {244--247},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-48077-6\_18},
doi = {10.1007/978-3-030-48077-6\_18},
timestamp = {Mon, 15 Jun 2020 17:09:54 +0200},
biburl = {https://dblp.org/rec/conf/asm/RiccobeneS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}