Mining Timed Regular Specifications from System Traces

被引:22
|
作者
Narayan, Apurva [1 ]
Cutulenco, Greta [1 ]
Joshi, Yogi [1 ]
Fischmeister, Sebastian [1 ]
机构
[1] Univ Waterloo, Dept Elect & Comp Engn, 200 Univ Ave W, Waterloo, ON N2L 3G1, Canada
关键词
Timed regular expressions; timed automata; specification mining; real-time systems;
D O I
10.1145/3147660
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Temporal properties define the order of occurrence and timing constraints on event occurrence. Such specifications are important for safety-critical real-time systems. We propose a framework for automatically mining temporal properties that are in the form of timed regular expressions (TREs) from system traces. Using an abstract structure of the property, the framework constructs a finite state machine to serve as an acceptor. We analytically derive speedup for the fragment and confirm the speedup using empirical validation with synthetic traces. The framework is evaluated on industrial-strength safety-critical real-time applications using traces with more than 1 million entries.
引用
收藏
页数:21
相关论文
共 50 条
  • [1] TREM: A Tool for Mining Timed Regular Specifications from System Traces
    Schmidt, Lukas
    Narayan, Apurva
    Fischmeister, Sebastian
    PROCEEDINGS OF THE 2017 32ND IEEE/ACM INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING (ASE'17), 2017, : 901 - 906
  • [2] Mining Time for Timed Regular Specifications
    Narayan, Apurva
    Fischmeister, Sebastian
    2019 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC), 2019, : 63 - 69
  • [3] QMine: A Framework for Mining Quantitative Regular Expressions from System Traces
    Mahato, Pradeep K.
    Narayan, Apurva
    COMPANION OF THE 2020 IEEE 20TH INTERNATIONAL CONFERENCE ON SOFTWARE QUALITY, RELIABILITY, AND SECURITY (QRS-C 2020), 2020, : 370 - 377
  • [4] Mining Specifications in Diversified Formats From Execution Traces
    Lo, David
    2008 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE MAINTENANCE, 2008, : 420 - 423
  • [5] Automatic Mining of Specifications from Invocation Traces and Method Invariants
    Krka, Ivo
    Brun, Yuriy
    Medvidovic, Nenad
    22ND ACM SIGSOFT INTERNATIONAL SYMPOSIUM ON THE FOUNDATIONS OF SOFTWARE ENGINEERING (FSE 2014), 2014, : 178 - 189
  • [6] Calculating WCET estimates from timed traces
    Zolda, Michael
    Kirner, Raimund
    REAL-TIME SYSTEMS, 2016, 52 (01) : 38 - 87
  • [7] Learning Timed Automata from Interaction Traces
    Vain, J.
    Kanter, G.
    Anier, A.
    IFAC PAPERSONLINE, 2019, 52 (19): : 205 - 210
  • [8] Calculating WCET estimates from timed traces
    Michael Zolda
    Raimund Kirner
    Real-Time Systems, 2016, 52 : 38 - 87
  • [9] TRACES ARISING FROM REGULAR INCLUSIONS
    Crytser, Danny
    Nagy, Gabriel
    JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2017, 103 (02) : 190 - 230
  • [10] From durational specifications to TLA designs of timed automata
    Chen, YF
    Liu, ZM
    FORMAL METHODS AND SOFTWARE ENGINEERING, PROCEEDINGS, 2004, 3308 : 464 - 482