Search-based refactoring based on unfolding of graph transformation systems

Electronic Communications of the EASST

Volumn 38, Issue , 2011, Pages

  Qayum, Fawad ^a   Heckel, Reiko ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

Ant Colony optimisation meta heuristic; Search based refactoring; Unfolding of graph transformation systems

Indexed keywords

EID: 84908644528     PISSN: None     EISSN: 18632122     Source Type: Journal    
DOI: 10.14279/tuj.eceasst.38.577.610     Document Type: Conference Paper

References (16)

1. P. Baldan, A. Corradini, B. König. A Static Analysis Technique for Graph Transformation Systems. In Proc. of CONCUR '01. Pp. 381-395. Springer-Verlag, 2001. LNCS 2154
2. P. Baldan, A. Corradini, U. Montanari. Unfolding and Event Structure Semantics for Graph Grammars. In FoSSaCS '99: Held as Part of the European Joint Conf: on the Theory and Practice of Software, ETAPS'99. Pp. 73-89. Springer-Verlag, London, UK, 1999
3. U. Chirico. A Java Framework for Ant Colony Systems
4. F. L. Dotti, B. König, O. M. dos Santos, L. Ribeiro. A case study: Verifying a mutual exclusion protocol with process creation using graph transformation systems. Technical report, 2004
5. M. Dorigo, S. Member, L. M. Gambardella. Ant Colony System: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1997. Review of "Ant Colony Optimization" by M.Dorigo, T.Stützle, MIT Press, Cambridge, MA, 2004. Artif. Intell. 165(2):261-264, 2005. Reviewer-Christian Blum. doi:http://dx.doi.org/10.1016/j.artint.2005.03.003
6. M. Fowler. Refactoring: Improving The Design of Existing Code. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1999
7. L. M. Gambardella, M. Dorigo. An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem. INFORMS J. on Computing 12(3):237-255, 2000. doi:http://dx.doi.org/10.1287/ijoc.12.3.237.12636
8. M. Harman, U. Ph, B. F. Jones. Search-Based Software Engineering. Infor-mation and Software Technology 43:833-839, 2001
9. B. König, V. Kozioura. Counterexample-guided Abstraction Refinement for the Analysis of Graph Transformation Systems. In Proc. of TACAS '06. Pp. 197-211. Springer, 2006. LNCS 3920
10. B. König, V. Kozioura. Augur 2-A New Version of a Tool for the Analysis of Graph Transformation Systems. In Proc. of GT-VMT '06 (Workshop on Graph Transformation and Visual Modeling Techniques). ENTCS 211, pp. 201-210. Elsevier, 2008
11. T. Mens, G. Taentzer, O. Runge. Analysing Refactoring Dependencies Using Graph Transformation. Software and Systems Modeling (SoSyM), pp. 269-285, September 2007
12. M. O'Keeffe, M. O. Cinnéide. Search-based refactoring: an empirical study. J. Softw. Maint. Evol. 20(5):345-364, 2008. doi:http://dx.doi.org/10.1002/smr.v20:5
13. O. C. M. O'Keeffe M. A stochastic Approach To Automated Design Improvement. In Proc. of the 2nd Inter: Conf: on the Principles and Practice of Programming in Java. Pp. 56-62. Comp.Sc Press, Trinity College Dublin: Ireland, ACM SIGAPP, 2002
14. O. Seng, J. Stammel, D. Burkhart. Search-based determination of refactorings for improving the class structure of object-oriented systems. In GECCO 2006. Pp. 1909-1916. ACM, New York, NY, USA, 2006. doi:http://doi.acm.org/10.1145/1143997.1144315
15. H. Ehrig, M. Pfender, H. Schneider. Graph grammars: an algebraic approach. In 14th Annual IEEE Symposium on Switching and Automata Theory. Pp. 167-180. IEEE, 1973
16. G. Taentzer. Towards Common Exchange Formats for Graphs and Graph Transformation Systems. Electr. Notes Theor. Comput. Sci. 44(4), 2001