General Anticipatory Runtime Verification

@inproceedings {1446,
	title = {General Anticipatory Runtime Verification},
	booktitle = {36th International Conference on Computer Aided Verification (CAV)},
	year = {2024},
	month = {07/2024},
	publisher = {Springer Cham},
	organization = {Springer Cham},
	address = {Montreal, Canada},
	abstract = {<p>Runtime verification is a technique for monitoring a system{\textquoteright}s behavior against a formal specification. Monitors must produce verdicts that are sound with respect to the specification. Anticipation is the ability to immediately produce verdicts when the monitor can confidently predict the inevitability of the verdict. Stream runtime verification is a specialized form of runtime verification tailored to the monitoring and verification of data streams. In this paper we study anticipatory monitoring for stream runtime verification. More specifically, we present an algorithm with anticipation for monitoring of Lola specifications, which we then extend to exploit assumptions and tolerate uncertainties. As perfect anticipation is in general not computable, we use techniques from abstract interpretation, especially widening, to approximate anticipatory monitoring verdicts. Finally, we report on three empirical cases studies using a prototype implementation of a symbolic instantiation of our approach.</p>
},
	keywords = {Abstract Interpretation, Monitoring, Runtime verification, Symbolic Reasoning},
	doi = {10.1007/978-3-031-65630-9_7},
	url = {https://link.springer.com/chapter/10.1007/978-3-031-65630-9_7},
	author = {Raik Hipler and Hannes Kallwies and Martin Leucker and C{\'e}sar S{\'a}nchez}
}