Hybrid learning: Interface generation through static, dynamic, and symbolic analysis

2013 International Symposium on Software Testing and Analysis, ISSTA 2013 - Proceedings

Volumn , Issue , 2013, Pages 268-279

  Howar, Falk ^a   Giannakopoulou, Dimitra ^b   Rakamarić, Zvonimir ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b NASA AMES RESEARCH CENTER   (United States)

^c University of Utah   (United States)

Author keywords

Concolic Execution; Dynamic Analysis; Interfaces; Learning; Software Components; Static Analysis

Indexed keywords

COMPONENT INTERFACES; CONCOLIC EXECUTION; CONCRETE COMPONENTS; INTERFACE GENERATION; LEARNING; PARTIAL ORDER REDUCTIONS; SOFTWARE COMPONENT; SOFTWARE MODEL CHECKING;

ALGORITHMS; AUTOMATA THEORY; DYNAMIC ANALYSIS; INTERFACES (MATERIALS); SOFTWARE TESTING; STATIC ANALYSIS;

INTERFACE STATES;

EID: 84881300723     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2483760.2483783     Document Type: Conference Paper

References (36)

1. F. Aarts, B. Jonsson, and J. Uijen. Generating models of infinite-state communication protocols using regular inference with abstraction. In International Conference on Testing Software and Systems (ICTSS), pages 188-204, 2010.
2. Circuit - simple J2ME game. http://gamesdev.wordpress.com/2008/11/03/ circuit-simple-j2me-game/.
3. R. Alur, P. Cerný, P. Madhusudan, and W. Nam. Synthesis of interface specifications for Java classes. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 98-109, 2005.
4. G. Ammons, R. Bodík, and J. R. Larus. Mining specifications. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 4-16, 2002.
5. S. Anand, C. S. Pǎšareanu, and W. Visser. Symbolic execution with abstract subsumption checking. In International conference on Model Checking Software (SPIN), pages 163-181, 2006. (Pubitemid 44019624)
6. D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75(2):87-106, 1987. (Pubitemid 18535066)
7. S. Burckhardt, C. Dern, M. Musuvathi, and R. Tan. Line-up: A complete and automatic linearizability checker. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 330-340, 2010.
8. S. Chaki and O. Strichman. Three optimizations for assume-guarantee reasoning with L*. Formal Methods in System Design (FMSD), 32(3):267-284, 2008.
9. Y.-F. Chen, E. M. Clarke, A. Farzan, M.-H. Tsai, Y.-K. Tsay, and B.-Y. Wang. Automated assume-guarantee reasoning through implicit learning. In International Conference on Computer Aided Verification (CAV), pages 511-526, 2010.
10. Y.-F. Chen, A. Farzan, E. M. Clarke, Y.-K. Tsay, and B.-Y. Wang. Learning minimal separating DFA's for compositional verification. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pages 31-45, 2009.
11. C. Y. Cho, D. Babić, P. Poosankam, K. Z. Chen, E. X. Wu, and D. Song. MACE: Model-inference-assisted concolic exploration for protocol and vulnerability discovery. In USENIX Security Symposium, 2011.
12. L. A. Clarke. A system to generate test data and symbolically execute programs. IEEE Transactions on Software Engineering, 2:215-222, 1976.
13. L. de Moura and N. Bjoørner. Z3: An efficient SMT solver. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pages 337-340, 2008.
14. M. Gheorghiu, D. Giannakopoulou, and C. S. Pasareanu. Refining interface alphabets for compositional verification. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pages 292-307, 2007.
15. D. Giannakopoulou and C. S. Pasareanu. Interface generation and compositional verification in JavaPathfinder. In International Conference on Fundamental Approaches to Software Engineering (FASE), pages 94-108, 2009.
16. D. Giannakopoulou, Z. Rakamarić, and V. Raman. Symbolic learning of component interfaces. In International Static Analysis Symposium (SAS), pages 248-264, 2012.
17. P. Godefroid, N. Klarlund, and K. Sen. DART: directed automated random testing. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 213-223, 2005.
18. Guava: Google core libraries. http://code.google.com/p/guava-libraries/.
19. A. Gupta, K. L. McMillan, and Z. Fu. Automated assumption generation for compositional verification. In International Conference on Computer Aided Verification (CAV), pages 420-432, 2007.
20. T. A. Henzinger, R. Jhala, and R. Majumdar. Permissive interfaces. In European Software Engineering Conference (ESEC) held jointly with ACM SIGSOFT International Symposium on Foundations of Software Engineering (FSE), pages 31-40, 2005.
21. F. Howar, B. Steffen, and M. Merten. Automata learning with automated alphabet abstraction refinement. In International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI), pages 263-277, 2011.
22. S. Joshi, S. K. Lahiri, and A. Lal. Underspecified harnesses and interleaved bugs. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 19-30, 2012.
23. JPF (Java Pathfinder). http://babelfish.arc.nasa.gov/trac/jpf.
24. J. C. King. Symbolic execution and program testing. Communications of the ACM, 19(7):385-394, 1976.
25. D. Lorenzoli, L. Mariani, and M. Pezzé. Automatic generation of software behavioral models. In International Conference on Software Engineering (ICSE), pages 501-510, 2008.
26. M. Merten, B. Steffen, F. Howar, and T. Margaria. Next generation LearnLib. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pages 220-223, 2011.
27. C. S. Pasareanu, D. Giannakopoulou, M. G. Bobaru, J. M. Cobleigh, and H. Barringer. Learning to divide and conquer: applying the L*algorithm to automate assume-guarantee reasoning. Formal Methods in System Design (FMSD), 32(3):175-205, 2008.
28. R. L. Rivest and R. E. Schapire. Inference of finite automata using homing sequences. Information and Computation, 103(2):299-347, 1993.
29. K. Sen, D. Marinov, and G. Agha. CUTE: A concolic unit testing engine for C. In European Software Engineering Conference (ESEC) held jointly with ACM SIGSOFT International Symposium on Foundations of Software Engineering (FSE), pages 263-272, 2005.
30. R. Singh, D. Giannakopoulou, and C. S. Pasareanu. Learning component interfaces with may and must abstractions. In International Conference on Computer Aided Verification (CAV), pages 527-542, 2010.
31. B. Steffen, F. Howar, and M. Merten. Introduction to active automata learning from a practical perspective. In Formal Methods for Eternal Networked Software Systems (SFM), pages 256-296, 2011.
32. O. Tkachuk. OCSEGen. http://code.google.com/p/envgen/.
33. O. Tkachuk. OCSEGen: Open components and systems environment generator. In ACM SIGPLAN International Workshop on the State Of the Art in Java Program Analysis (SOAP), 2013. To appear.
34. O. Tkachuk and M. B. Dwyer. Adapting side effects analysis for modular program model checking. In European Software Engineering Conference (ESEC) held jointly with ACM SIGSOFT International Symposium on Foundations of Software Engineering (FSE), pages 188-197, 2003.
35. J. Whaley, M. C. Martin, and M. S. Lam. Automatic extraction of object-oriented component interfaces. In International Symposium on Software Testing and Analysis (ISSTA), pages 218-228, 2002.
36. T. Xie, D. Marinov, W. Schulte, and D. Notkin. Symstra: a framework for generating object-oriented unit tests using symbolic execution. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pages 365-381, 2005.