Unifying FSM-inference algorithms through declarative specification

Proceedings - International Conference on Software Engineering

Volumn , Issue , 2013, Pages 252-261

  Beschastnikh, Ivan ^a   Brun, Yuriy ^b   Abrahamson, Jenny ^a   Ernst, Michael D ^a   Krishnamurthy, Arvind ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

^b University of Massachusetts Amherst   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DEVELOPMENT PRACTICES; EVALUATION RESULTS; LOG ANALYSIS; LOGGING SYSTEM; MODEL INFERENCE;

ALGORITHMS; SOFTWARE ENGINEERING; WELL LOGGING;

INFERENCE ENGINES;

EID: 84886388235     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSE.2013.6606571     Document Type: Conference Paper

References (31)

1. M. Acharya, T. Xie, J. Pei, and J. Xu. Mining API Patterns as Partial Orders from Source Code: From Usage Scenarios to Specifications. In ESEC/FSE, 2007.
2. D. Angluin. Finding Patterns Common to a Set of Strings. Journal of Computer and System Sciences, 21(1):46-62, 1980.
3. C. M. Antunes and A. L. Oliveira. Temporal Data Mining: An Overview. In KDD 2001 Workshop on Temporal Data Mining, 2001.
4. A. Bertolino, P. Inverardi, P. Pelliccione, and M. Tivoli. Automatic Synthesis of Behavior Protocols for Composable Web-Services. In ESEC/FSE, pages 141-150, 2009.
5. I. Beschastnikh, Y. Brun, J. Abrahamson, M. D. Ernst, and A. Krishnamurthy. Unifying FSM-Inference Algorithms through Declarative Specification. Technical Report UW-CSE-13-03-01, 2013.
6. I. Beschastnikh, Y. Brun, S. Schneider, and M. D. Ernst. Leveraging Existing Instrumentation to Automatically Infer Invariant-Constrained Models. In ESEC/FSE, pages 267-277, 2011.
7. A. W. Biermann and J. A. Feldman. On the Synthesis of Finite-State Machines from Samples of Their Behavior. IEEE TC, 21(6):592-597, 1972.
8. B. Bollig, J.-P. Katoen, C. Kern, and M. Leucker. Learning Communicating Automata from MSCs. IEEE TSE, 36(3):390-408, 2010.
9. R. C. Carrasco and J. Oncina. Learning Stochastic Regular Grammars by Means of a State Merging Method. In ICGI, 1994.
10. E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexampleguided Abstraction Refinement. In Computer Aided Verification, pages 154-169, 2000.
11. J. E. Cook and A. L. Wolf. Discovering Models of Software Processes from Event-Based Data. ACM ToSEM, 7(3):215-249, 1998.
12. M. D. Ernst, J. Cockrell, W. G. Griswold, and D. Notkin. Dynamically Discovering Likely Program Invariants to Support Program Evolution. In ICSE, pages 213-224, 1999.
13. M. Gabel and Z. Su. Testing Mined Specifications. In FSE, 2012.
14. E. M. Gold. Language Identification in the Limit. Information and Control, 10(5):447-474, 1967.
15. S. Hangal and M. Lam. Tracking Down Software Bugs Using Automatic Anomaly Detection. In ICSE, 2002.
16. J. Hatcliff and M. Dwyer. Using the Bandera Tool Set to Model-Check Properties of Concurrent Java Software. In CONCUR, 2001.
17. J. E. Hopcroft. An nlogn Algorithm for Minimizing States in a Finite Automaton. Technical report, Stanford Univ., 1971.
18. S. Kumar, S.-C. Khoo, A. Roychoudhury, and D. Lo. Inferring Class Level Specifications for Distributed Systems. In ICSE, 2012.
19. D. Lo and S.-C. Khoo. QUARK: Empirical Assessment of Automatonbased Specification Miners. In WCRE, 2006.
20. D. Lo and S.-C. Khoo. SMArTIC: Towards Building an Accurate, Robust and Scalable Specification Miner. In FSE, 2006.
21. D. Lo and S. Maoz. Scenario-Based and Value-Based Specification Mining: Better Together. In ASE, pages 387-396, 2010.
22. D. Lo, L. Mariani, and M. Pezzè. Automatic Steering of Behavioral Model Inference. In ESEC/FSE, 2009.
23. D. Lorenzoli, L. Mariani, and M. Pezzè. Automatic Generation of Software Behavioral Models. In ICSE, 2008.
24. L. Mariani and M. Pezzè. Dynamic Detection of COTS Component Incompatibility. IEEE Software, 24(5):76-85, 2007.
25. M. Pradel, P. Bichsel, and T. R. Gross. A Framework for the Evaluation of Specification Miners Based on Finite State Machines. In ICSM, 2010.
26. A. V. Raman and J. D. Patrick. The sk-strings Method for Inferring PFSA. In AIGILA, 1997.
27. S. P. Reiss and M. Renieris. Encoding Program Executions. In ICSE, 2001.
28. N. Walkinshaw and K. Bogdanov. Inferring Finite-State Models with Temporal Constraints. In ASE, pages 248-257, 2008.
29. W. Xu, L. Huang, A. Fox, D. Patterson, and M. Jordan. Experience Mining Google's Production Console Logs. In SLAML, 2010.
30. J. Yang, D. Evans, D. Bhardwaj, T. Bhat, and M. Das. Perracotta: Mining Temporal API Rules from Imperfect Traces. In ICSE, 2006.
31. T. Ziadi, M. da Silva, L. Hillah, and M. Ziane. A Fully Dynamic Approach to the Reverse Engineering of UML Sequence Diagrams. In ICECCS, pages 107-116, 2011.