Inferring state-based behavior models

Proceedings - International Conference on Software Engineering

Volumn , Issue , 2006, Pages 25-31

  Lorenzoli, Davide ^a   Mariani, Leonardo ^a   Pezzè, Mauro ^a  

^a UNIVERSITY OF MILANO BICOCCA   (Italy)

Author keywords

behavioral models; dynamic analysis; finite state machines; inference algorithms; verification

Indexed keywords

BEHAVIORAL MODEL; BEHAVIORAL MODELS; FINITE STATE MACHINES; INFERENCE ALGORITHM; INFERENCE ALGORITHMS;

ALGORITHMS; COMPUTER SOFTWARE MAINTENANCE; COMPUTER SOFTWARE SELECTION AND EVALUATION; CONTOUR FOLLOWERS; FINITE AUTOMATA; INFERENCE ENGINES; PROGRAM DEBUGGING; SOFTWARE ENGINEERING; TRANSLATION (LANGUAGES);

DYNAMIC ANALYSIS;

EID: 77953575876     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1138912.1138919     Document Type: Conference Paper

References (17)

1. Amazon. Amazon web services. www.amazon.com/gp/aws/landing, 2006.
2. G. Ammons, R. Bodík, and J. R. Larus. Mining specifications. In proceedings of the 29th Symposium on Principles of Programming Languages, pages 4-16. ACM Press, 2002.
3. A. Biermann and J. Feldman. On the synthesis of finite state machines from samples of their behavior. IEEE Transactions on Computer, 21:592-597, June 1972.
4. J. Cook and A. Wolf. Discovering models of software processes from event-based data. ACM Transactions on Software Engineering and Methodology, 7(3):215-249, 1998. (Pubitemid 128658170)
5. P. Dupont. Incremental regular inference. In L. Miclet and C. Higuera, editors, proceedings of the 3rd International Colloquium on Grammatical Inference, volume 1147 of LNCS, pages 222-237. Springer-Verlag, 1996.
6. M. D. Ernst, J. Cockrell, W. G. Griswold, and D. Notkin. Dynamically discovering likely program invariants to support program evolution. IEEE Transactions on Software Engineering, 27(2):99-123, February 2001.
7. S. Fujiwara, G. von Bochmann, F. Khendek, M. Amalou, and A. Ghedamsi. Test selection based on finite state models. IEEE Transactions on Software Engineering, 17(6):591-603, 1991.
8. E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software. Computing Series. Addison-Wesley Professional, 1995.
9. A. Hamou-Lhadj and T. C. Lethbridge. An efficient algorithm for detecting patterns in traces of procedure calls. In proceedings of the ICSE Workshop on Dynamic Analysis (WODA), Portland, Oregon, May 2003. ACM Press.
10. M. Harder, J. Mellen, and M. D. Ernst. Improving test suites via operational abstraction. In in Proceedings of the 25th International Conference on Software Engineering, pages 60-71, Portland, Oregon, May 6-8, 2003.
11. L. Mariani and M. Pezzè. Behavior capture and test: Automated analysis of component integration. In proceedings of the 10th IEEE International Conference on Engineering of Complex Computer Systems, 2005.
12. R. Parekh and V. Honavar. An incremental interactive algorithm for regular grammar inference. In L. Miclet and C. Higuera, editors, proceedings of the 3rd International Colloquium on Grammatical Inference, volume 1147 of LNCS, pages 238-250. Springer-Verlag, 1996.
13. S. Porat and J. Feldman. Learning automata from ordered examples. Machine Learning, 7:109-138, 1991.
14. S. P. Reiss and M. Renieris. Encoding program executions. In proceedings of the 23rd International Conference on Software Engineering, pages 221-230. IEEE Computer Society, 2001.
15. L. Wendehals. Improving design pattern instance recognition by dynamic analysis. In proceedings of the ICSE Workshop on Dynamic Analysis (WODA), Portland, USA, May 2003. ACM Press.
16. T. Xie and D. Notkin. Exploiting synergy between testing and inferred partial specifications. In proceedings of the ICSE Workshop on Dynamic Analysis (WODA), Portland, Oregon, May 2003. ACM Press.
17. T. Xie and D. Notkin. Tool-assisted unit-test generation and selection based on operational abstractions. Automated Software Engineering Journal, 2006 (to appear).