Leveraging existing instrumentation to automatically infer invariant-constrained models

SIGSOFT/FSE 2011 - Proceedings of the 19th ACM SIGSOFT Symposium on Foundations of Software Engineering

Volumn , Issue , 2011, Pages 267-277

  Beschastnikh, Ivan ^a   Brun, Yuriy ^a   Schneider, Sigurd ^b   Sloan, Michael ^a   Ernst, Michael D ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

Log analysis; Model inference; Synoptic; Temporal invariant mining

Indexed keywords

DISTRIBUTED SYSTEMS; EXECUTION LOGS; GAINING INSIGHTS; LOG ANALYSIS; MANUAL INSPECTION; MODEL EFFICIENCY; MODEL INFERENCE; REAL-WORLD SYSTEM; REGULAR EXPRESSIONS; SYNOPTIC; SYNOPTIC PROCESS; SYSTEM BEHAVIORS; SYSTEM MODELS; TEMPORAL INVARIANTS; UNIQUE FEATURES; USER EXPERIENCE; USER INPUT;

FORMAL METHODS; MODELS; NETWORK SECURITY;

PROGRAM DEBUGGING;

EID: 80053201758     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2025113.2025151     Document Type: Conference Paper

References (49)

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 Proc. of FSE, 2007.
2. D. Alrajeh, J. Kramer, A. Russo, and S. Uchitel. Learning Operational Requirements from Goal Models. In Proc. of ICSE, 2009.
3. D. Angluin. Finding Patterns Common to a Set of Strings. Journal of Computer and System Sciences, 21(1):46 - 62, 1980.
4. I. Beschastnikh, J. Abrahamson, Y. Brun, and M. D. Ernst. Synoptic: Studying Logged Behavior with Inferred Models. In Proc. of FSE, 2011.
5. A. W. Biermann and J. A. Feldman. On the Synthesis of Finite-State Machines from Samples of Their Behavior. IEEE Trans. Comput., 21(6):592- 597, 1972.
6. L. Blum and M. Blum. Toward a Mathematical Theory of Inductive Inference. Information and Control, 28(2):125 - 155, 1975.
7. E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexampleguided Abstraction Refinement. In Computer Aided Verification, pages 154-169. Springer, 2000.
8. C. Damas et al. Generating Annotated Behavior Models from End-User Scenarios. IEEE TSE, 31(12), 2005.
9. C. Damas, B. Lambeau, and A. van Lamsweerde. Scenarios, Goals, and State Machines: a Win-Win Partnership for Model Synthesis. In Proc. of FSE, 2006.
10. W. Damm and D. Harel. LSCs: Breathing Life into Message Sequence Charts. Form. Meth. Syst. Des., 19(1), 2001.
11. G. de Caso, V. Braberman, D. Garbervetsky, and S. Uchitel. Validation of Contracts Using Enabledness Preserving Finite State Abstractions. In Proc. of ICSE, 2009.
12. M. B. Dwyer, G. S. Avrunin, and J. C. Corbett. Patterns in Property Specifications for Finite-State Verification. In Proc. of ICSE, 1999.
13. T. Elomaa. Partition-Refining Algorithms for Learning Finite State Automata. In Proc. of ISMIS, 2002.
14. K. Fisler and M. Y. Vardi. Bisimulation Minimization and Symbolic Model Checking. Formal Methods in System Design, 21(1):39-78, 2002. (Pubitemid 34811794)
15. D. Giannakopoulou and J. Magee. Fluent Model Checking for Event- Based Systems. In Proc. of FSE, 2003.
16. E. M. Gold. Language Identification in the Limit. Information and Control, 10(5):447-474, 1967.
17. Welcome to Apache Hadoop!, http://hadoop.apache.org/Accessed March 9, 2011.
18. D. Harel, H. Kugler, and A. Pnueli. Synthesis Revisited: Generating Statechart Models from Scenario-Based Requirements. Form. Meth. in Soft. and Sys. Modeling, 3393, 2005.
19. IPv4 Specification, Record Route optionhttp://www.ietf.org/rfc/rfc791. txt.Pg.20, 21 Accessed March 9, 2011.
20. IPv4 Specification, Timestamp option. http://www.ietf.org/rfc/rfc791.txt. Pg.22, 23. Accessed March 9, 2011.
21. ITU. Message Sequence Charts, 2000.
22. G. Jiang, H. Chen, C. Ungureanu, and K. Yoshihira. Multi-resolution Abnormal Trace Detection Using Varied-length N-grams and Automata. In Proc. of ICAC, 2005.
23. E. Katz-Bassett, H. V. Madhyastha, V. K. Adhikari, C. Scott, J. Sherry, P. van Wesep, T. Anderson, and A. Krishnamurthy. Reverse Traceroute. In Proc. of NSDI, 2010.
24. I. Krka, Y. Brun, G. Edwards, and N. Medvidovic. Synthesizing Partial Component-Level Behavior Models from System Specifications. In Proc. of FSE, 2009.
25. I. Krka, Y. Brun, D. Popescu, J. Garcia, and N. Medvidovic. Using Dynamic Execution Traces and Program Invariants to Enhance Behavioral Model Inference. In Proc. of ICSE, 2010.
26. K. Li and P. Hudak. Memory Coherence in Shared Virtual Memory Systems. ACM Trans. Comput. Syst., 7:321-359, November 1989. (Pubitemid 20637608)
27. D. Lo and S.-C. Khoo. QUARK: Empirical Assessment of Automatonbased Specification Miners. In Proc. of WCRE, 2006.
28. D. Lo and S.-C. Khoo. SMArTIC: Towards Building an Accurate, Robust and Scalable Specification Miner. In Proc. of FSE, 2006.
29. D. Lo, L. e. Mariani, and M. Pezzè. Automatic Steering of Behavioral Model Inference. In Proc. of FSE, 2009.
30. D. Lorenzoli, L. Mariani, and M. Pezzè. Automatic Generation of Software Behavioral Models. In Proc. of ICSE, 2008.
31. J.-G. Lou, Q. Fu, Y. Wang, and J. Li. Mining Dependency in Distributed Systems through Unstructured Logs Analysis. SIGOPS Oper. Syst. Rev., 44:91-96, March 2010.
32. J. G. Lou, Q. Fu, S. Yang, Y. Xu, and J. Li. Mining Invariants from Console Logs for System Problem Detection. In Proc. of ATC, 2010.
33. L. Mariani and M. Pezzè. Dynamic Detection of COTS Component Incompatibility. IEEE Software, 24(5):76-85, September/October 2007. (Pubitemid 47455998)
34. R. Paige and R. E. Tarjan. Three Partition Refinement Algorithms. SIAM J. Comput., 16(6):973-989, 1987.
35. L. Pitt and M. K. Warmuth. The Minimum Consistent DFA Problem Cannot be Approximated Within any Polynomial. J. ACM, 40(1):95-142, 1993.
36. PlanetLab | An open platform for developing, deploying, and accessing planetary-scale services, https://www.planet-lab.org Accessed March 9, 2011.
37. S. P. Reiss and M. Renieris. Encoding Program Executions. In Proc. of ICSE, 2001.
38. D. Sangiorgi. On the Origins of Bisimulation and Coinduction. ACM Trans. Program. Lang. Syst., 31(4):1-41, 2009.
39. S. Schneider, I. Beschastnikh, S. Chernyak, M. D. Ernst, and Y. Brun. Synoptic: Summarizing System Logs with Refinement. In Proc. of SLAML, 2010.
40. J. Tan, X. Pan, S. Kavulya, R. G, and P. Narasimhan. SALSA: Analyzing Logs as StAte Machines. In Proc. of WASL, 2008.
41. J. Tan, X. Pan, S. Kavulya, R. G, and P. Narasimhan. Mochi: Visual Log-Analysis Based Tools for Debugging Hadoop. In Proc. of WASL, 2009.
42. S. Uchitel, J. Kramer, and J. Magee. Behaviour Model Elaboration Using Partial Labelled Transition Systems. In Proc. of FSE, 2003.
43. S. Uchitel, J. Kramer, and J. Magee. Incremental Elaboration of Scenario- Based Specifications and Behavior Models Using Implied Scenarios. ACM TOSEM, 13(1), 2004.
44. J. Whittle and J. Schumann. Generating Statechart Designs From Scenarios. In Proc. of ICSE, 2000.
45. W. Xu, L. Huang, A. Fox, D. Patterson, and M. Jordan. Experience Mining Google's Production Console Logs. In Proc. of SLAML, 2010.
46. W. Xu, L. Huang, A. Fox, D. Patterson, and M. I. Jordan. Detecting Large-Scale System Problems by Mining Console Logs. In Proc. of SOSP, 2009.
47. J. Yang and D. Evans. Automatically Inferring Temporal Properties for Program Evolution. In Proc. of ISSRE, 2004.
48. J. Yang and D. Evans. Dynamically Inferring Temporal Properties. In Proc. of PASTE, 2004.
49. D. Yuan, H. Mai, W. Xiong, L. Tan, Y. Zhou, and S. Pasupathy. Sherlog: Error Diagnosis by Connecting Clues from Run-Time Logs. In Proc. of ASPLOS, 2010.