Improving dynamic software analysis by applying grammar inference principles

Journal of Software Maintenance and Evolution

Volumn 20, Issue 4, 2008, Pages 269-290

  Walkinshaw, Neil ^a   Bogdanov, Kirill ^a   Holcombe, Mike ^a   Salahuddin, Sarah ^a  

^a Department of Computer Science ^*  (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

SOFTWARE ENGINEERING;

ANALYSIS PROBLEMS; FAMILY OF MACHINES; GRAMMAR INFERENCE; IMPROVING DYNAMICS; PROGRAM EXECUTION; RANDOM STATE; SOFTWARE SYSTEMS; UNDERLYING SYSTEMS;

LEARNING SYSTEMS;

EID: 49749096848     PISSN: 1532060X     EISSN: 15320618     Source Type: Journal    
DOI: 10.1002/smr.373     Document Type: Conference Paper

References (34)

1. Ernst M. Static and dynamic analysis: Synergy and duality. Proceedings of the International Workshop on Dynamic Analysis (WODA'03), 2003.
2. Lee D, Yannakakis M. Principles and methods of testing finite state machines-A survey. Proceedings of the IEEE 1996; 84:1090-1126.
3. Angluin D, Smith CH. Inductive inference: Theory and methods. Computing Surveys 1983; 15(3):237-269.
4. Parekh R, Honavar V. Grammar inference, automata induction and language acquisition. The Handbook of Natural Language Processing. Marcel Dekker: New York NY, 2000; 727-764.
5. Gold E. Language identification in the limit. Information and Control 1967; 10:447-474.
6. Chomsky N. Three models for the description of language. IRE Transactions on Information Theory 1956; 2(3): 113-124.
7. Nerode; A. Linear automata transformations. Proceedings of the American Mathematical Society 1958; 9:541-544.
8. Gold E. Complexity of automaton identification from given data. Information and Control 1978; 37:302-320.
9. Kearns M, Valiant L. Cryptographic limitations on learning boolean formulae and finite automata. Journal of the ACM 1994; 41:433-444.
10. Trakhtenbrot B, Barzdin Y. Finite Automata, Behavior and Synthesis. North Holland: Amsterdam, 1973.
11. Lang K. Random DFA's can be approximately learned from sparse uniform examples. COLT, 1992; 45-52.
12. Oncina J, Garcia P. Inferring regular languages in polynomial update time. Pattern Recognition and Image Analysis 1992; 1:49-61.
13. Garcia P, Cano A, Ruiz J. A comparative study of two algorithms for automata identification. Proceedings of the International Colloquium on Grammar Inference (ICGI'00) (Lecture Notes in Computer Science). Springer: Berlin, 2000.
14. Oncina J, Garcia P, Vidal E. Learning subsequential transducers for pattern recognition interpretation tasks. IEEE Transactions on Pattern Analysis and Machine Intelligence 1993; 15(5):448-458.
15. Dupont P, Lambeau B, Damas C, van Lamsweerde A. The QSM algorithm and its application to software behavior model induction. Applied Artificial Intelligence 2008; 22:77-115.
16. Dupont P. Incremental regular inference. Proceedings of the International Colloquium on Grammar Inference (ICGI'96), 1996.
17. Damas C, Lambeau B, Dupont P, van Lamsweerde A. Generating annotated behavior models from end-user scenarios. IEEE Transactions on Software Engineering 2005; 31(12):1056-1073.
18. Lang K, Pearlmutter B, Price R. Results of the Abbadingo One DFA learning competition and a new evidence-driven state-merging algorithm. Proceedings of the International Colloquium on Grammar Inference (ICGI'98), vol. 1433, 1998; 1-12.
19. De la Higuera CD, Vidal O. Identification of DFA: Data-dependent vs data-independent algorithms. ICGI: International Colloquium on Grammatical Inference and Applications, 1996.
20. Angluin D. Learning regular sets from queries and counterexamples. Information and Computation 1987; 75:87-106.
21. Biermann A, Feldman J. On the synthesis of finite-state machines from samples of their behavior. IEEE Transactions on Computers 1972; 21:592-597.
22. Ammons G, Bodfk R, Larus J. Mining specifications. POPL'02, 2002; 4-16.
23. Cook JE, Wolf AL. Discovering models of software processes from event-based data. ACM Transactions on Software Engineering and Methodology 1998; 7(3):215-249.
24. Lo D, Khoo S. QUARK: Empirical assessment of automaton-based specification miners. WCRE. IEEE Computer Society: Silver Spring MD, 2006; 51-60.
25. Lo D, Khoo S. SMArTIC: Towards building an accurate, robust and scalable specification miner. SIGSOFT FSE, 2006; 265-275.
26. Lorenzoli D, Mariáni L, Pezze M. Inferring state-based behavior models. Proceedings of the International Workshop on Dynamic Analysis (WODA'06), 2006.
27. Reiss S, Renieris M. Encoding program executions. ICSE. IEEE Computer Society: Silver Spring MD, 2001; 221-230.
28. Li K, Groz R, Shahbaz M. Integration testing of distributed components based on learning parameterized I/O models. Proceedings of FORTE'06 (Lecture Notes in Computer Science, vol. 4229). Springer: Berlin, 2006; 436-450.
29. Hungar H, Niese O, Steffen B. Domain-specific optimization in automata learning. International Conference on Computer Aided Verification (CAV'03), 2003.
30. Walkinshaw N, Bogdanov K, Ali S, Holcombe M. Automated discovery of state transitions and their functions in source code. Software Testing, Verification and Reliability 2008; 18(2):99-121.
31. Hopcroft J, Ullman J. Introduction to Automata Theory, Languages and Computation. Addison-Wesley: Reading MA, 1979.
32. Rijsbergen CJV. Information Retrieval. Butterworth-Heinemann: Newton MA, U.S.A., 1979.
33. Bongard J, Lipson H. Active coevolutionary learning of deterministic finite automata. Journal of Machine Learning Research 2005; 6:1651-1678.
34. Walkinshaw N, Bogdanov K, Holcombe M, Salahuddin S. Reverse engineering state machines by interactive grammar inference. WCRE'07, 2007.