2018/08/31 by Lukas Convent, Sebastian Hungerecker, Convent, Lukas +9 · 2 citations
Computer Science · #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification #Programming Languages (cs.PL) #Real-Time Systems Scheduling #Software Testing and Debugging Techniques
paper · pdf · doi:10.48550/arxiv.1808.10717
openalex publication_date 2018/08/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Runtime verification is concerned with monitoring program traces. In particular, stream runtime verification (SRV) takes the program trace as input streams and incrementally derives output streams. SRV can check logical properties and compute temporal metrics and statistics from the trace. We present TeSSLa, a temporal stream-based specification language for SRV. TeSSLa supports timestamped events natively and is hence suitable for streams that are both sparse and fine-grained, which often occur in practice. We prove results on TeSSLa's expressiveness and compare different TeSSLa fragments to (timed) automata, thereby inheriting various decidability results. Finally, we present a monitor implementation and prove its correctness.