{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T07:51:30Z","timestamp":1773820290790,"version":"3.50.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319351216","type":"print"},{"value":"9783319351223","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-35122-3_21","type":"book-chapter","created":{"date-parts":[[2016,5,9]],"date-time":"2016-05-09T12:40:26Z","timestamp":1462797626000},"page":"315-330","source":"Crossref","is-referenced-by-count":12,"title":["Detecting Similar Programs via The Weisfeiler-Leman Graph Kernel"],"prefix":"10.1007","author":[{"given":"Wenchao","family":"Li","sequence":"first","affiliation":[]},{"given":"Hassen","family":"Saidi","sequence":"additional","affiliation":[]},{"given":"Huascar","family":"Sanchez","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Sch\u00e4f","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Schweitzer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,10]]},"reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1137\/0209047","volume":"9","author":"L Babai","year":"1980","unstructured":"Babai, L., Erd\u0151s, P., Selkow, S.M.: Random graph isomorphism. SIAM J. Comput. 9(3), 628\u2013635 (1980)","journal-title":"SIAM J. Comput."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Baker, B.S.: On finding duplication and near-duplication in large software systems. In: 2nd Working Conference on Reverse Engineering, WCRE 1995, Toronto, Canada, 14\u201316 July 2005, pp. 86\u201395 (1995)","DOI":"10.1109\/WCRE.1995.514697"},{"key":"21_CR3","series-title":"Springer Briefs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-2909-7","volume-title":"Software Similarity and Classification","author":"S Cesare","year":"2012","unstructured":"Cesare, S., Xiang, Y.: Software Similarity and Classification. Springer Briefs in Computer Science. Springer, London (2012)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Darga, P.T., Liffiton, M.H., Sakallah, K.A., Markov, I.L.: Exploiting structure in symmetry detection for CNF. In: Malik, S., Fix, L., Kahng, A.B. (eds.), Proceedings of the 41th Design Automation Conference, DAC, San Diego, CA, USA, 7\u201311 June 2004, pp. 530\u2013534. ACM (2004)","DOI":"10.1145\/996566.996712"},{"key":"21_CR5","unstructured":"Evans, W.S.: Program compression. In: Koschke, R., Merlo, E., Walenstein, A. (eds.) Duplication, Redundancy, and Similarity in Software, 23\u201326 July 2006, vol. 06301 of Dagstuhl Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany (2006)"},{"issue":"3","key":"21_CR6","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1145\/24039.24041","volume":"9","author":"J Ferrante","year":"1987","unstructured":"Ferrante, J., Ottenstein, K.J., Warren, J.D.: The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst. 9(3), 319\u2013349 (1987)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"21_CR7","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1109\/TSE.2005.28","volume":"31","author":"MW Godfrey","year":"2005","unstructured":"Godfrey, M.W., Zou, L.: Using origin analysis to detect merging and splitting of source code entities. IEEE Trans. Softw. Eng. 31(2), 166\u2013181 (2005)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"5","key":"21_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/2371656.2371662","volume":"59","author":"M Grohe","year":"2012","unstructured":"Grohe, M.: Fixed-point definability and polynomial time on graphs with excluded minors. J. ACM 59(5), 27 (2012)","journal-title":"J. ACM"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Horv\u00e1th, T., G\u00e4rtner, T., Wrobel, S.: Cyclic pattern kernels for predictive graph mining. In: Kim, W., Kohavi, R., Gehrke, J., DuMouchel, W. (eds.) Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, Washington, USA, 22\u201325 August 2004, pp. 158\u2013167. ACM (2004)","DOI":"10.1145\/1014052.1014072"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Jiang, L., Misherghi, G., Su, Z., Glondu, S.: Deckard: scalable and accurate tree-based detection of code clones. In: Proceedings of the 29th International Conference on Software Engineering, ICSE 2007, pp. 96\u2013105. IEEE Computer Society Washington, DC, USA (2007)","DOI":"10.1109\/ICSE.2007.30"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Junttila, T.A., Kaski, P.: Engineering an efficient canonical labeling tool for large and sparse graphs. In: Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX, New Orleans, Louisiana, USA, 6 January 2007. SIAM (2007)","DOI":"10.1137\/1.9781611972870.13"},{"key":"21_CR12","doi-asserted-by":"publisher","unstructured":"Ke, Y., Stolee, K.T., Le Goues, C., Brun, Y.: Repairing programs with semantic code search. In: Proceedings of the 30th IEEE\/ACM International Conference on Automated Software Engineering (ASE), pp. 295\u2013306, Lincoln, NE, USA, November 2015. doi: 10.1109\/ASE.2015.60 , http:\/\/people.cs.umass.edu\/brun\/pubs\/pubs\/Ke15ase.pdf","DOI":"10.1109\/ASE.2015.60"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-47764-0_3","volume-title":"Static Analysis","author":"R Komondoor","year":"2001","unstructured":"Komondoor, R., Horwitz, S.: Using slicing to identify duplication in source code. In: Cousot, P. (ed.) SAS 2001. LNCS, vol. 2126, pp. 40\u201356. Springer, Heidelberg (2001)"},{"issue":"2","key":"21_CR14","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1080\/08993400412331363843","volume":"14","author":"T Lancaster","year":"2004","unstructured":"Lancaster, T., Culwin, F.: A comparison of source code plagiarism detection engines. Comput. Sci. Edu. 14(2), 101\u2013112 (2004)","journal-title":"Comput. Sci. Edu."},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Leit\u00e3o, A.M.: Detection of redundant code using R2D2. In: 3rd IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2003), Amsterdam, The Netherlands, 26\u201327 September 2003, pp. 183\u2013192 (2003)","DOI":"10.1109\/SCAM.2003.1238044"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Lestringant, P., Guih\u00e9ry, F., Fouque, P.-A.: Automated identification of cryptographic primitives in binary code with data flow graph isomorphism. In: Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security, ASIA CCS 2015, pp. 203\u2013214. ACM, New York (2015)","DOI":"10.1145\/2714576.2714639"},{"issue":"1","key":"21_CR17","doi-asserted-by":"publisher","first-page":"10:1","DOI":"10.1145\/2824251","volume":"25","author":"A Mahmoud","year":"2015","unstructured":"Mahmoud, A., Bradshaw, G.: Estimating semantic relatedness in source code. ACM Trans. Softw. Eng. Methodol. 25(1), 10:1\u201310:35 (2015)","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"21_CR18","unstructured":"McKay, B.D., Piperno, A.: Nauty and traces user guide. https:\/\/cs.anu.edu.au\/people\/Brendan.McKay\/nauty\/nug25.pdf"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Pikhurko, O., Verbitsky, O.: Logical complexity of graphs: a survey. CoRR, abs\/1003.4865 (2010)","DOI":"10.1090\/conm\/558\/11050"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Pradhan, P., Dwivedi, A.K., Rath, S.K.: Detection of design pattern using graph isomorphism and normalized cross correlation. In: Parashar, M., Ramesh, T., Zola, J., Narendra, N.C., Kothapalli, K., Amudha, J., Bangalore, P., Gupta, D., Pathak, A., Chaudhary, S., Dinesha, K.V., Prasad, S.K. (eds.) Eighth International Conference on Contemporary Computing, IC3, Noida, India, 20\u201322 August 2015, pp. 208\u2013213. IEEE Computer Society (2015)","DOI":"10.1109\/IC3.2015.7346680"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Qiu, J., Su, X., Ma, P.: Library functions identification in binary code by using graph isomorphism testings. In: Gu\u00e9h\u00e9neuc, Y., Adams, B., Serebrenik, A. (eds.) 22nd IEEE International Conference on Software Analysis, Evolution, and Reengineering, SANER, Montreal, QC, Canada, 2\u20136 March 2015, pp. 261\u2013270. IEEE (2015)","DOI":"10.1109\/SANER.2015.7081836"},{"issue":"2","key":"21_CR22","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1109\/TSE.2015.2470241","volume":"42","author":"J Qiu","year":"2015","unstructured":"Qiu, J., Su, X., Ma, P.: Using reduced execution flow graph to identify library functions in binary code. IEEE Trans. Softw. Eng. 42(2), 187\u2013202 (2015)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Raychev, V., Vechev, M., Krause, A.: Predicting program properties from \u201cbig code\u201d. In: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, pp. 111\u2013124. ACM, New York (2015)","DOI":"10.1145\/2775051.2677009"},{"issue":"7","key":"21_CR24","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.scico.2009.02.007","volume":"74","author":"CK Roy","year":"2009","unstructured":"Roy, C.K., Cordy, J.R., Koschke, R.: Comparison and evaluation of code clone detection techniques and tools: a qualitative approach. Sci. Comput. Program. 74(7), 470\u2013495 (2009)","journal-title":"Sci. Comput. Program."},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Sajnani, H., Saini, V., Svajlenko, J., Roy, C.K., Lopes, C.V.: SourcererCC: scaling code clone detection to big code. CoRR, abs\/1512.06448 (2015)","DOI":"10.1145\/2884781.2884877"},{"key":"21_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-23719-5_32","volume-title":"Algorithms \u2013 ESA 2011","author":"P Schweitzer","year":"2011","unstructured":"Schweitzer, P.: Isomorphism of (mis)labeled graphs. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 370\u2013381. Springer, Heidelberg (2011)"},{"key":"21_CR27","first-page":"2539","volume":"12","author":"N Shervashidze","year":"2011","unstructured":"Shervashidze, N., Schweitzer, P., van Leeuwen, E.J., Mehlhorn, K., Borgwardt, K.M.: Weisfeiler-lehman graph kernels. J. Mach. Learn. Res. 12, 2539\u20132561 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"21_CR28","unstructured":"Shervashidze, N., Vishwanathan, S.V.N., Petri, T., Mehlhorn, K., Borgwardt, K.M.: Efficient graphlet kernels for large graph comparison. In: Dyk, D.A.V., Welling, M. (eds.) Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics, AISTATS, Clearwater Beach, Florida, USA, 16\u201318 April 2009, vol. 5 of JMLR Proceedings, pp. 488\u2013495. JMLR.org (2009)"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"Sidiroglou-Douskos, S., Lahtinen, E., Long, F., Rinard, M.: Automatic error elimination by horizontal code transfer across multiple applications. In: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI, pp. 43\u201354. ACM, New York (2015)","DOI":"10.1145\/2813885.2737988"},{"issue":"3","key":"21_CR30","doi-asserted-by":"publisher","first-page":"26:1","DOI":"10.1145\/2581377","volume":"23","author":"KT Stolee","year":"2014","unstructured":"Stolee, K.T., Elbaum, S., Dobos, D.: Solving the search for source code. ACM Trans. Softw. Eng. Methodol. 23(3), 26:1\u201326:45 (2014)","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"21_CR31","unstructured":"Vall\u00e9e-Rai, R., Co, P., Gagnon, E., Hendren, L., Lam, P., Sundaresan, V.: Soot - a java bytecode optimization framework. In: Proceedings of the Conference of the Centre for Advanced Studies on Collaborative Research, CASCON 1999, p. 13. IBM Press (1999)"}],"container-title":["Lecture Notes in Computer Science","Software Reuse: Bridging with Social-Awareness"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-35122-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T02:08:49Z","timestamp":1748916529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-35122-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319351216","9783319351223"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-35122-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}