Computing the structural difference between state-based models

Proceedings - Working Conference on Reverse Engineering, WCRE

Volumn , Issue , 2009, Pages 177-186

  Bogdanov, Kirill ^a   Walkinshaw, Neil ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BEHAVIOUR MODELS; COMPLEX MODEL; PRECISION AND RECALL; SOFTWARE DEVELOPMENT; STATE-BASED MODELS; STATES AND TRANSITIONS; STRUCTURAL DIFFERENCES; TWO-STATE;

COMPUTER SOFTWARE; CONTOUR FOLLOWERS; REENGINEERING;

REVERSE ENGINEERING;

EID: 73449101821     PISSN: 10951350     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WCRE.2009.17     Document Type: Conference Paper

References (24)

1. N. Walkinshaw, K. Bogdanov, M. Holcombe, and S. Salahuddin, "Improving dynamic software analysis by applying grammar inference principles," Journal of Software Maintenance and Evolution: Research and Practice, 2008.
2. N. Walkinshaw, K. Bogdanov, and K. Johnson, "Evaluation and comparison of inferred regular grammars," in Proceedings of the International Colloquium on Grammar Inference (ICGI'08), St. Malo, France, 2008.
3. C. J. V. Rijsbergen, Information Retrieval. Newton, MA, USA: Butterworth-Heinemann, 1979.
4. E. Börger, "Abstract state machines and high-level system design and analysis," Theoretical Computer Science, vol. 336, no. 2-3, pp. 205-207, 2005. [Online]. Available: http://dx.doi.org/10.1016/j.tcs. 2004.11.006
5. K. Cheng and A. Krishnakumar, "Automatic functional test generation using the extended finite state machine model," in 30th ACM/IEEE Design Automation Conference, 1993, pp. 86-91.
6. S. Uchitel, J. Kramer, and J. Magee, "Behaviour model elaboration using partial labelled transition systems," in ESEC/SIGSOFT FSE. ACM, 2003, pp. 19-27. [Online]. Available: http://doi.acm.org/10.1145/940071. 940076
7. V. Levenshtein, "Binary codes capable of correcting deletions, insertions and reversals." Soviet Physics Doklady., vol. 10, no. 8, pp. 707-710, Feb. 1966, doklady Akademii Nauk SSSR, V163 No4 845-848 1965.
8. M. Sorrows and S. Hirtle, "The nature of landmarks for real and electronic spaces," in Spatial information theory - Cognitive and computational foundations of geographic information science. Berlin: Springer, 1999, pp. 37-50.
9. T. Davis, "Algorithm 832: Umfpack v4.3 - an unsymmetric-pattern multifrontal method," ACM Trans. Math. Softw., vol. 30, no. 2, pp. 196-199, 2004.
10. R. Whaley and A. Petitet, "Minimizing development and maintenance costs in supporting persistently optimized BLAS," Software: Practice and Experience, vol. 35, no. 2, pp. 101-121, February 2005.
11. S. Nejati, M. Sabetzadeh, M. Chechik, S. M. Easterbrook, and P. Zave, "Matching and merging of statecharts specifications," in ICSE. IEEE Computer Society, 2007, pp. 54-64. [Online]. Available: http://doi.ieeecomputersociety.org/10.1109/ICSE.2007.50
12. N. Walkinshaw, K. Bogdanov, M. Holcombe, and S. Salahuddin, "Reverse engineering state machines by interactive grammar inference," in WCRE'07, 2007.
13. N. Walkinshaw and K. Bogdanov, "Inferring finite-state models with temporal constraints," in Proceedings of the 23rd International Conference on Automated Software Engineering (ASE'08), 2008.
14. D. Lo and S. Khoo, "QUARK: Empirical assessment of automaton-based specification miners," in Proceedings of the Working Conference on Reverse Engineering (WCRE'06). IEEE Computer Society, 2006, pp. 51-60.
15. J. Cook and A. Wolf, "Discovering models of software processes from event-based data," ACM Transactions on Software Engineering and Methodology, vol. 7, no. 3, pp. 215-249, 1998.
16. K. Lang, B. Pearlmutter, and R. Price, "Results of the Abbadingo One DFA learning competition and a new evidence-driven state merging algorithm," in Proceedings of the International Colloquium on Grammar Inference (ICGI'98), vol. 1433, 1998, pp. 1-12.
17. A. Biermann and J. Feldman, "On the synthesis of finite-state machines from samples of their behavior," IEEE Transactions on Computers, vol. 21, pp. 592-597, 1972.
18. S. Melnik, H. Garcia-Molina, and E. Rahm, "Similarity flooding: A versatile graph matching algorithm and its application to schema matching," in 18th International Conference on Data Engineering (ICDE 2002), 2002. [Online]. Available: http://ilpubs.stanford.edu:8090/730/
19. J. Quante and R. Koschke, "Dynamic protocol recovery," in Proceedings of the International Working Conference on Reverse Engineering (WCRE'07), 2007, pp. 219-228. [Online]. Available: http://doi. ieeecomputersociety.org/10.1109/WCRE.2007.24
20. J. Hopcroft, R. Motwani, and J. Ullman, Introduction to Automata Theory, Languages, and Computation, Third Edition. Addison-Wesley, 2007.
21. S. Needleman and C. Wunsch, "A general method applicable to the search of similarities in the amino acid sequence of two proteins," Journal of Molecular Biology, vol. 48, pp. 443-453, 1970.
22. J. Raymond, E. Gardiner, and P. Willett, "RASCAL: Calculation of graph similarity using maximum common edge subgraphs," The Computer Journal, vol. 45, no. 6, pp. 631-644, 2002.
23. H. Bunke, "On A relation between graph edit distance and maximum common subgraph," Pattern Recognition Letters, vol. 18, no. 8, pp. 689-694, Aug. 1997.
24. C. Kermorvant and P. Dupont, "Stochastic grammatical inference with multinomial tests," in Grammatical Inference: Algorithms and Applications, ser. Lecture Notes in Artificial Intelligence, vol. 2484. Springer-Verlag, 2002, pp. 149-160.