Affiliation:
1. University of Maryland, College Park
Abstract
This paper proposes the use of static analysis to improve the generation of invariants from test data extracted from Simulink models. Previous work has shown the utility of such automatically generated invariants as a means for updating and completing system specifications; they also are useful as a means of understanding model behavior. This work shows how the scalability and accuracy of the data mining process can be dramatically improved by using information from data/control flow analysis to reduce the search space of the invariant mining and to eliminate false positives. Comparative evaluations of the process show that the improvements significantly reduce execution time and memory consumption, thereby supporting the analysis of more complex models, while also improving the accuracy of the generated invariants.
Funder
National Science Foundation
Publisher
Association for Computing Machinery (ACM)
Subject
Hardware and Architecture,Software
Reference22 articles.
1. Mining association rules between sets of items in large databases
2. Fabrizio Angiulli Giovambattista Ianni and Luigi Palopoli. 2001. On the complexity of mining association rules. In SEBD. 177--184. Fabrizio Angiulli Giovambattista Ianni and Luigi Palopoli. 2001. On the complexity of mining association rules. In SEBD. 177--184.
3. Mining temporal invariants from partially ordered logs
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Counterexample-guided inductive repair of reactive contracts;Proceedings of the IEEE/ACM 10th International Conference on Formal Methods in Software Engineering;2022-05-18
2. Counterexample Guided Inductive Repair of Reactive Contracts;2021 36th IEEE/ACM International Conference on Automated Software Engineering (ASE);2021-11
3. Automated Specification Extraction and Analysis with Specstractor;Software Engineering and Formal Methods;2018