Abstract
This paper presents a technique for using execution traces to mine parametric temporal specifications in the form of quantified event automata (QEA) - previously introduced as an expressive and efficient formalism for runtime verification. We consider a pattern-based mining approach that uses a pattern library to generate and check potential properties over given traces, and then combines successful patterns. By using predefined models to measure the tool's precision and recall we demonstrate that our approach can effectively and efficiently extract specifications in realistic scenarios. © 2013 IEEE.
Original language | English |
---|---|
Title of host publication | 2013 28th IEEE/ACM International Conference on Automated Software Engineering, ASE 2013 - Proceedings|IEEE/ACM Int. Conf. Autom. Softw. Eng., ASE - Proc. |
Publisher | IEEE |
Pages | 658-663 |
Number of pages | 5 |
ISBN (Print) | 9781479902156 |
DOIs | |
Publication status | Published - 2013 |
Event | 2013 28th IEEE/ACM International Conference on Automated Software Engineering, ASE 2013 - Palo Alto, CA Duration: 1 Jul 2013 → … |
Conference
Conference | 2013 28th IEEE/ACM International Conference on Automated Software Engineering, ASE 2013 |
---|---|
City | Palo Alto, CA |
Period | 1/07/13 → … |
Keywords
- Runtime Verification, Pattern-based Specification Mining, First-order specifications