Scripting Language for Java Source Code Recognition

Tomáš Bublík., Miroslav Virius. New language for searching Java code snippets. In: ITAT 2012. Proc. of the 12th national conference ITAT. diar, Sep 17-21 2012. Pavol Jozef Safrik University in Kosice. p. 35-40. Christophe-André M. Irniger. Graph Matching - Filtering Databases of Graphs Using Machine Learning Techniques. 2005, ISBN 1-58603-557-6. McKay, 1981, Practical graph isomorphism, In Congressus Numerantium, 30, 45 Ullmann, 1976, An algorithm for subgraph isomorphism, Journal ofthe Association for Computing Machinery, 31, 10.1145/321921.321925 Levi, 1972, A note on the derivation of maximal common subgraphs oftwo directed or undirected graphs, Calcolo, 341 McGregor, 1982, Backtrack search algorithms and the maximal commonsubgraph problem, Software-Practice and Experience, 23, 10.1002/spe.4380120103 G.A. Stephen. String Searching Algorithms. World Scientific, 1994. Bunke, 1998, A graph distance metric based on the maximalcommon subgraph, Pattern Recognition Letters, 255, 10.1016/S0167-8655(97)00179-7 M.-L. Fernandez, G. Valiente. A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recognition Letters, 2001, pages 753-758. W.D. Wallis, P. Shoubridge, M. Kraetz, D. Ray. Graph distances using graph union. Pattern Recognition Letters, May 2001, pages 701-704. Sanfeliu, 1983, A distance measure between attributed relationalgraphs for pattern recognition, IEEE Transactions on Systems, Man, and Cybernetics, 353, 10.1109/TSMC.1983.6313167 Tsai, 1979, Error-correcting isomorphisms of attributedrelational graphs for pattern recognition, IEEE Transactions on Systems, Man, and Cybernetics, 757, 10.1109/TSMC.1979.4310127 Eshera, 1984, A graph distance measure for image analysis, IEEE Transactions on Systems, Man, and Cybernetics, 398, 10.1109/TSMC.1984.6313232 E.K. Wong. Three-dimensional object recognition by attributed graphs. In H. Bunke and A. Sanfeliu, editors, Syntactic and Structural Pattern Recognition- Theory and Applications, World Scientific, 1990, pages 381-414. R. Wilson and E.R. Hancock. Levenshtein distance for graph spectral features. In J. Kittler, M. Petrou, and M. Nixon, editors, Proc. 17th Int. Conference on Pattern Recognition, volume 2, 2004, pages 489-492. A. Robles-Kelly and E.R. Hancock. Graph edit distance from spectral seriation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2005, pages 365-378. Caelli, 2004, Inexact graph matching using eigensubspace projection clustering, Int. Journal of Pattern Recognition and Artificial Intelligence, 329, 10.1142/S0218001404003186 Caelli, 2004, An eigenspace projection clustering method for inexact graph matching, IEEE Transactions on Pattern Analysis and Machine Intelligence, 515, 10.1109/TPAMI.2004.1265866 Ch. K. Roy, J.R. Cordy, and R. Koschke. 2009. Comparison and evaluation of code clone detection techniques and tools: A qualitative approach. Sci. Comput. Program. 74, 7 (May 2009), pp. 470-495. I. D. Baxter, A. Yahin, L. Moura, M. Sant’Anna, and L. Bier. 1998. Clone Detection Using Abstract Syntax Trees. In Proceedings of the International Conference on Software Maintenance (ICSM ‘98). IEEE Computer Society, Washington, DC, USA, pp. 368-377. R. Koschke, R. Falke, P. Frenzel. Clone Detection Using Abstract Syntax Suffix Trees, Reverse Engineering. 2006. WCRE ‘06. 13th Working Conference on, ISBN 0-7695-2719-1, 2006, pages 253-262. J. T. Yao and M. Zhang. 2004. A Fast Tree Pattern Matching Algorithm for XML Query. In Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence (WI ‘04). IEEE Computer Society, Washington, DC, USA, pp. 235-241. G. Valiente. Algorithms on Trees and Graphs. Springer, ISBN 3540435506, 2002, page 170. V. Wahler, D. Seipel, J.W. von Gudenberg, and G. Fischer. Clone detection in source code by frequent itemset techniques. In SCAM, 2004. R. Shamir, D. Tsur. Faster Subtree Isomorphism. In Journal of Algorithms, Volume 33 Issue 2, 1999, pages 267-280, doi:10.1006/jagm.1999.1044.