Affiliation:
1. Imperial College London, UK
2. University of Sheffield, UK
3. University of Luxembourg, Luxembourg
Abstract
Models such as finite state automata are widely used to abstract the behavior of software systems by capturing the sequences of events observable during their execution. Nevertheless, models rarely exist in practice and, when they do, get easily outdated; moreover, manually building and maintaining models is costly and error-prone. As a result, a variety of model inference methods that automatically construct models from execution traces have been proposed to address these issues.
However, performing a systematic and reliable accuracy assessment of inferred models remains an open problem. Even when a reference model is given, most existing model accuracy assessment methods may return misleading and biased results. This is mainly due to their reliance on statistical estimators over a finite number of randomly generated traces, introducing avoidable uncertainty about the estimation and being sensitive to the parameters of the random trace generative process.
This paper addresses this problem by developing a systematic approach based on analytic combinatorics that minimizes bias and uncertainty in model accuracy assessment by replacing statistical estimation with deterministic accuracy measures. We experimentally demonstrate the consistency and applicability of our approach by assessing the accuracy of models inferred by state-of-the-art inference tools against reference models from established specification mining benchmarks.
Publisher
Association for Computing Machinery (ACM)
Reference47 articles.
1. Automata-Based Model Counting for String Constraints
2. Parameterized model counting for string and numeric constraints
3. Leveraging existing instrumentation to automatically infer invariant-constrained models
4. On the Synthesis of Finite-State Machines from Samples of Their Behavior
5. Manuel Bodirsky , Tobias Gärtner , Timo von Oertzen , and Jan Schwinghammer . 2004. Efficiently Computing the Density of Regular Languages . In LATIN 2004: Theoretical Informatics, Martín Farach-Colton (Ed.) . Springer Berlin Heidelberg , Berlin, Heidelberg , 262–270. Manuel Bodirsky, Tobias Gärtner, Timo von Oertzen, and Jan Schwinghammer. 2004. Efficiently Computing the Density of Regular Languages. In LATIN 2004: Theoretical Informatics, Martín Farach-Colton (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 262–270.