Timed k-Tail: Automatic Inference of Timed Automata
Fabrizio Pastore, Daniela Micucci, Leonardo Mariani

TL;DR
Timed k-Tail is a novel technique for automatically inferring timed automata from program traces, capturing both functional and timing behaviors to improve system analysis and anomaly detection.
Contribution
It introduces Timed k-Tail, the first method to mine timed automata from traces, integrating timing information into specification mining.
Findings
Efficiently mines accurate timed automata models
Effectively identifies anomalous timing executions
Produces few false positives in anomaly detection
Abstract
Accurate and up-to-date models describing the be- havior of software systems are seldom available in practice. To address this issue, software engineers may use specification mining techniques, which can automatically derive models that capture the behavior of the system under analysis. So far, most specification mining techniques focused on the functional behavior of the systems, with specific emphasis on models that represent the ordering of operations, such as tempo- ral rules and finite state models. Although useful, these models are inherently partial. For instance, they miss the timing behavior, which is extremely relevant for many classes of systems and com- ponents, such as shared libraries and user-driven applications. Mining specifications that include both the functional and the timing aspects can improve the applicability of many testing and analysis solutions. This paper…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSoftware System Performance and Reliability · Software Engineering Research · Software Testing and Debugging Techniques
See pages 1-last of paper.pdf
