Identification of design motifs with pattern matching algorithms

Information and Software Technology

Volumn 52, Issue 2, 2010, Pages 152-168

  Kaczor, Olivier ^a   Guéhéneuc, Yann Gaël ^a   Hamel, Sylvie ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Automata simulation; Bit vector; Design motifs; Design patterns; Experimental validation; Identification of occurrences

Indexed keywords

APPROXIMATE STRING MATCHING; DESIGN MOTIFS; DESIGN PATTERNS; DESIGN PROBLEMS; EFFICIENT ALGORITHM; EXPERIMENTAL VALIDATIONS; LARGE SYSTEM; MEDIUM SIZE; PATTERN MATCHING ALGORITHMS; SOFTWARE MAINTENANCE; VECTOR DESIGN; VECTOR PROCESSING;

ALGORITHMS; PATTERN MATCHING; RESEARCH; ROBOTS; TRANSLATION (LANGUAGES); VECTORS;

DESIGN;

EID: 70450223696     PISSN: 09505849     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.infsof.2009.08.006     Document Type: Article

References (44)

1. J. Koskinen, Software maintenance costs, web site (September 2004). .
2. Lientz B.P., and Swanson E.B. Problems in application software maintenance. Communications of the ACM 24 11 (1981) 763-769.
3. Biggerstaff T.J., Mitbander B.G., and Webster D.E. The concept assignment problem in program understanding. In: Basili V.R., DeMillo R.A., and Katayama T. (Eds). Proceedings of the 15th International Conference on Software Engineering (1993), IEEE Computer Society Press/ACM Press 482-498.
4. Gamma E., Helm R., Johnson R., and Vlissides J. Design Patterns - Elements of Reusable Object-Oriented Software. first ed. (1994), Addison-Wesley
5. Wuyts R. Declarative reasoning about the structure of object-oriented systems. In: Gil J. (Ed). Proceedings of the 26th Conference on the Technology of Object-Oriented Languages and Systems (1998), IEEE Computer Society Press 112-124.
6. Quilici A., Yang Q., and Woods S. Applying plan recognition algorithms to program understanding. Journal of Automated Software Engineering 5 3 (1997) 347-372.
7. Antoniol G., Fiutem R., and Cristoforetti L. Design pattern recovery in object-oriented software. In: Tilley S., and Visaggio G. (Eds). Proceedings of the Sixth International Workshop on Program Comprehension (1998), IEEE Computer Society Press 153-160.
8. Guéhéneuc Y.-G., Sahraoui H., and Zaidi F. Fingerprinting design patterns. In: Stroulia E., and de Lucia A. (Eds). Proceedings of the 11th Working Conference on Reverse Engineering (2004), IEEE Computer Society Press 172-181.
9. Nikolaos Tsantalis G.S., Chatzigeorgiou A., and Halkidis S.T. Design pattern detection using similarity scoring. Transactions on Software Engineering 32 (2006) 896-909
10. Gusfield D. Algorithms on Strings, Trees and Sequences (1997), Cambridge University Press, Cambridge, UK
11. Levenshtein V.I. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics - Doklady 10 8 (1966) 707-710
12. Smith T., and Waterman M. Identification of common molecular subsequences. Journal of Molecular Biology 147 (1981) 195-197
13. Needlman S., and Wunsch C. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology 48 (1970) 443-453
14. Ukkonen E. Finding approximate patterns in strings. Journal of Algorithms 6 (1985) 132-137
15. J. Holub, Simulation of NFA in approximate string and sequence matching, in: Proceedings of the Prague Stringology Club Workshop '97, 1997, pp. 39-46.
16. Bergeron A., and Hamel S. Vector algorithms for approximate string matching. International Journal of Foundation of Computer Science 13 1 (2002) 53-66.
17. Myers G. A fast bit-vector algorithm for approximate string matching based on dynamic programming. Journal of the ACM 46 3 (1999) 395-415.
18. Baeza-Yates R.A., and Gonnet G.H. A new approach to text searching. Communications of the ACM 35 10 (1992) 74-82
19. Holub J., and Melichar B. Implementation of nondeterministic finite automata for approximate pattern matching. In: Champarnaud J.-M., Maurel D., and Ziadi D. (Eds). Proceedings of the Third International Workshop on Implementing Automata (1998), Springer-Verlag 92-99
20. Beyer D., Noack A., and Lewerentz C. Simple and efficient relational querying of software structures. In: Stroulia E., and van Deursen A. (Eds). Proceedings of the 10th Working Conference on Reverse Engineering (2003), IEEE Computer Society Press 216-225.
21. Kaczor O., Guéhéneuc Y.-G., and Hamel S. Efficient identification of design patterns with bit-vector algorithm. In: di Lucca G.A., and Gold N. (Eds). Proceedings of the 10th Conference on Software Maintenance and Reengineering (2006), IEEE Computer Society Press 173-182.
22. Krämer C., and Prechelt L. Design recovery by automated search for structural design patterns in object-oriented software. In: Wills L.M., and Baxter I. (Eds). Proceedings of the Third Working Conference on Reverse Engineering (1996), IEEE Computer Society Press 208-215.
23. Ciupke O. Automatic detection of design problems in object-oriented reengineering. In: Firesmith D. (Ed). Proceeding of 30th Conference on Technology of Object-Oriented Languages and Systems (1999), IEEE Computer Society Press 18-32.
24. Keller R.K., Schauer R., Robitaille S., and Pagé P. Pattern-based reverse-engineering of design components. In: Garlan D., and Kramer J. (Eds). Proceedings of the 21st International Conference on Software Engineering (1999), ACM Press 226-235.
25. Jahnke J.H., Schäfer W., and Zündorf A. Generic fuzzy reasoning nets as a basis for reverse engineering relational database applications. In: Jazayeri M. (Ed). Proceedings of the Sixth European Software Engineering Conference (1997), ACM Press 193-210.
26. Guéhéneuc Y.-G., and Jussien N. Using explanations for design-patterns identification. In: Bessière C. (Ed). Proceedings of the 1st IJCAI Workshop on Modeling and Solving Problems with Constraints (2001), AAAI Press 57-64.
27. Eppstein D. Subgraph isomorphism in planar graphs and related problems. In: Clarkson K. (Ed). Proceedings of the Sixth Annual Symposium on Discrete Algorithms (1995), ACM Press 632-640.
28. N. Jussien, e-Constraints: Explanation-based constraint programming, in: B. O'Sullivan, E. Freuder (Eds.), First CP workshop on User-Interaction in Constraint Satisfaction, 2001. .
29. Guéhéneuc Y.-G., and Antoniol G. DeMIMA: A multi-layered framework for design pattern identification. Transactions on Software Engineering 34 5 (2008) 667-684.
30. Kampffmeyer H., and Zschaler S. Finding the pattern you need: The design pattern intent ontology. In: Engels G., Opdyke B., Schmidt D.C., and Weil F. (Eds). Proceedings of the 10th International Conference on Model Driven Engineering Languages and Systems (2007), Springer 211-225.
31. Guéhéneuc Y.-G., and Albin-Amiot H. Recovering binary class relationships: putting icing on the UML cake. In: Schmidt D.C. (Ed). Proceedings of the 19th Conference on Object-Oriented Programming, Systems, Languages, and Applications (2004), ACM Press 301-314. http://www-etud.iro.umontreal.ca/ptidej/Publications/Documents/OOPSLA04.doc.pdf
32. Mens K., Wuyts R., and D'Hondt T. Declaratively codifying software architectures using virtualsoftware classifications. In: Firesmith D. (Ed). Proceedings of the 30th international conference on Technology of Object-Oriented Languages and Systems (1999), IEEE Computer Society Press 33-45.
33. Dantzig G.B. Linear Programming and Extensions (1963), Princeton University Press
34. H.A. Eiselt, M. Gendreau, G. Laporte, Arc routing problems. Part I: The Chinese Postman problem, Tech. Rep. CRT-960, Centre de Recherche sur les Transports (March 1994).
35. Gluskov V.M.G. The abstract theory of automata. Russian Mathematical Surveys 16 (1961) 1-53
36. Thompson K. Regular expression search algorithm. Communications of the ACM 11 (1968) 419-422
37. Hopcroft J.E., and Ullman J.D. Introduction to Automata Theory, Languages, and Computation (1979), Addison-Wesley
38. Guéhéneuc Y.-G. Ptidej: Promoting patterns with patterns. In: Fayad M.E. (Ed). Proceedings of the First ECOOP workshop on Building a System using Patterns (2005), Springer-Verlag.
39. Thimbleby H.W. The directed chinese postman problem. Journal of Software - Practice and Experience 33 11 (2003) 1081-1096.
40. K. Scheglov, J.-M.P. Shackelford, Eclipse profiler (September 2004). .
41. Agerbo E., and Cornils A. How to preserve the benefits of design patterns. In: Chambers C. (Ed). Proceedings of the 13th Conference on Object-Oriented Programming, Systems, Languages, and Applications (1998), ACM Press 134-143.
42. Wendehals L. Improving design pattern instance recognition by dynamic analysis. In: Cook J.E., and Ernst M.D. (Eds). Proceedings of the First ICSE Workshop on Dynamic Analysis (2003), IEEE Computer Society Press.
43. Bieman J., Straw G., Wang H., Munger P.W., and Alexander R.T. Design patterns and change proneness: an examination of five evolving systems. In: Berry M., and Harrison W. (Eds). Proceedings of the Ninth International Software Metrics Symposium (2003), IEEE Computer Society Press 40-49.
44. Brown W.J., Malveau R.C., Brown W.H., McCormick H.W., Hays III W., and Mowbray T.J. Anti Patterns: Refactoring Software, Architectures, and Projects in Crisis. first ed. (1998), John Wiley and Sons.