Online and Offline Stream Runtime Verification of Synchronous Systems

被引:24
作者
Sanchez, Cesar [1 ]
机构
[1] IMDEA Software Inst, Madrid, Spain
来源
RUNTIME VERIFICATION (RV 2018) | 2018年 / 11237卷
基金
欧盟地平线“2020”;
关键词
Runtime verification; Formal verification; Formal methods; Stream runtime verification synchronous systems; Dynamic analysis; Monitoring; TIME; LANGUAGE;
D O I
10.1007/978-3-030-03769-7_9
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We revisit Stream Runtime Verification for synchronous systems. Stream Runtime Verification (SRV) is a declarative formalism to express monitors using streams, which aims to be a simple and expressive specification language. The goal of SRV is to allow engineers to describe both correctness/failure assertions and interesting statistical measures for system profiling and coverage analysis. The monitors generated are useful for testing, under actual deployment, and to analyze logs. The main observation that enables SRV is that the steps in the algorithms to monitor temporal logics (which generate Boolean verdicts) can be generalized to compute statistics of the trace if a different data domain is used. Hence, the fundamental idea of SRV is to separate the temporal dependencies in the monitoring algorithm from the concrete operations to be performed at each step. In this paper we revisit the pioneer SRV specification language LOLA and present in detail the online and offline monitoring algorithms. The algorithm for online monitoring Lola specifications uses a partial evaluation strategy, by incrementally constructing output streams from input streams, maintaining a storage of partially evaluated expressions. We identify syntactically a class of specifications for which the online algorithm is trace length independent, that is, the memory requirement does not depend on the length of the input streams. Then, we extend the principles of the online algorithm to create an efficient offline monitoring algorithm for large traces, which consist on scheduling trace length independent passes on a dumped log.
引用
收藏
页码:138 / 163
页数:26
相关论文
共 28 条
  • [1] Timed regular expressions
    Asarin, E
    Caspi, P
    Maler, O
    [J]. JOURNAL OF THE ACM, 2002, 49 (02) : 172 - 206
  • [2] Barringer H, 2004, LECT NOTES COMPUT SC, V2937, P44
  • [3] Barringer Howard, 2012, FM 2012: Formal Methods. Proceedings of the 18th International Symposium, P68, DOI 10.1007/978-3-642-32759-9_9
  • [4] Bartocci Ezio, 2018, Lecture Notes in Computer Science, V10457, DOI DOI 10.1007/978-3-319-75632-5
  • [5] Bauer A, 2007, LECT NOTES COMPUT SC, V4839, P126
  • [6] Bauer A, 2006, LECT NOTES COMPUT SC, V4337, P260
  • [7] Bauer A, 2013, LECT NOTES COMPUT SC, V8174, P59, DOI 10.1007/978-3-642-40787-1_4
  • [8] Runtime Verification for LTL and TLTL
    Bauer, Andreas
    Leucker, Martin
    Schallhart, Christian
    [J]. ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY, 2011, 20 (04)
  • [9] Berry G, 2000, FOUNDAT COMPUT, P425
  • [10] Foundations of boolean stream runtime verification
    Bozzelli, Laura
    Sánchez, CéSar
    [J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8734 : 64 - 79