{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:32:46Z","timestamp":1783611166683,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,5]],"date-time":"2020-10-05T00:00:00Z","timestamp":1601856000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100009077","name":"ITEA3","doi-asserted-by":"publisher","award":["16032"],"award-info":[{"award-number":["16032"]}],"id":[{"id":"10.13039\/501100009077","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,5]]},"DOI":"10.1145\/3382494.3410675","type":"proceedings-article","created":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T16:59:24Z","timestamp":1603472364000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["funcGNN"],"prefix":"10.1145","author":[{"given":"Aravind","family":"Nair","sequence":"first","affiliation":[{"name":"KTH Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Avijit","family":"Roy","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karl","family":"Meinke","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,10,23]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Learning to represent programs with graphs. arXiv preprint arXiv:1711.00740 (","author":"Allamanis Miltiadis","year":"2017","unstructured":"Miltiadis Allamanis , Marc Brockschmidt , and Mahmoud Khademi . 2017. Learning to represent programs with graphs. arXiv preprint arXiv:1711.00740 ( 2017 ). Miltiadis Allamanis, Marc Brockschmidt, and Mahmoud Khademi. 2017. Learning to represent programs with graphs. arXiv preprint arXiv:1711.00740 ( 2017)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290967"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/988241.988245"},{"key":"e_1_3_2_1_4_1","volume-title":"On the exact computation of the graph edit distance. Pattern Recognition Letters","author":"Blumenthal David B","year":"2018","unstructured":"David B Blumenthal and Johann Gamper . 2018. On the exact computation of the graph edit distance. Pattern Recognition Letters ( 2018 ). David B Blumenthal and Johann Gamper. 2018. On the exact computation of the graph edit distance. Pattern Recognition Letters (2018)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.10.001"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00060-3"},{"key":"e_1_3_2_1_7_1","volume-title":"A graph distance metric based on the maximal common subgraph. Pattern recognition letters 19, 3-4","author":"Bunke Horst","year":"1998","unstructured":"Horst Bunke and Kim Shearer . 1998. A graph distance metric based on the maximal common subgraph. Pattern recognition letters 19, 3-4 ( 1998 ), 255--259. Horst Bunke and Kim Shearer. 1998. A graph distance metric based on the maximal common subgraph. Pattern recognition letters 19, 3-4 (1998), 255--259."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom.2011.26"},{"key":"e_1_3_2_1_9_1","first-page":"73","article-title":"A Comparison of String Distance Metrics for Name-Matching Tasks","volume":"2003","author":"Cohen William W","year":"2003","unstructured":"William W Cohen , Pradeep Ravikumar , Stephen E Fienberg , 2003 . A Comparison of String Distance Metrics for Name-Matching Tasks .. In IIWeb , Vol. 2003. 73 -- 78 . William W Cohen, Pradeep Ravikumar, Stephen E Fienberg, et al. 2003. A Comparison of String Distance Metrics for Name-Matching Tasks.. In IIWeb, Vol. 2003. 73--78.","journal-title":"IIWeb"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1900008.1900142"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0360-1315(87)90042-X"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2009206.2009219"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978370"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.06.014"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.142681"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2005.1555942"},{"key":"e_1_3_2_1_17_1","unstructured":"Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Advances in neural information processing systems. 1024--1034.  Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Advances in neural information processing systems. 1024--1034."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46493-0_38"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1152154.1152174"},{"key":"e_1_3_2_1_20_1","volume-title":"Advanced Guide to Python 3 Programming","author":"Hunt John","unstructured":"John Hunt . 2019. Futures . In Advanced Guide to Python 3 Programming . Springer , 395--405. John Hunt. 2019. Futures. In Advanced Guide to Python 3 Programming. Springer, 395--405."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292577"},{"key":"e_1_3_2_1_22_1","volume-title":"Predicting metamorphic relations for testing scientific software: a machine learning approach using graph kernels. Software testing, verification and reliability 26, 3","author":"Kanewala Upulee","year":"2016","unstructured":"Upulee Kanewala , James M Bieman , and Asa Ben-Hur . 2016. Predicting metamorphic relations for testing scientific software: a machine learning approach using graph kernels. Software testing, verification and reliability 26, 3 ( 2016 ), 245--269. Upulee Kanewala, James M Bieman, and Asa Ben-Hur. 2016. Predicting metamorphic relations for testing scientific software: a machine learning approach using graph kernels. Software testing, verification and reliability 26, 3 (2016), 245--269."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/AMS.2007.31"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2568225.2568292"},{"key":"e_1_3_2_1_25_1","volume-title":"An introduction to metric spaces and fixed point theory","author":"Khamsi Mohamed A","unstructured":"Mohamed A Khamsi and William A Kirk . 2011. An introduction to metric spaces and fixed point theory . Vol. 53 . John Wiley & Sons . Mohamed A Khamsi and William A Kirk. 2011. An introduction to metric spaces and fixed point theory. Vol. 53. John Wiley & Sons."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2811411.2811549"},{"key":"e_1_3_2_1_27_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907","author":"Kipf Thomas","year":"2016","unstructured":"Thomas N Kipf and Max Welling . 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 ( 2016 ). Thomas NKipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCRE.2006.37"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSMR-WCRE.2014.6747160"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"e_1_3_2_1_31_1","volume-title":"Graph matching networks for learning the similarity of graph structured objects. arXiv preprint arXiv:1904.12787","author":"Li Yujia","year":"2019","unstructured":"Yujia Li , Chenjie Gu , Thomas Dullien , Oriol Vinyals , and Pushmeet Kohli . 2019. Graph matching networks for learning the similarity of graph structured objects. arXiv preprint arXiv:1904.12787 ( 2019 ). Yujia Li, Chenjie Gu, Thomas Dullien, Oriol Vinyals, and Pushmeet Kohli. 2019. Graph matching networks for learning the similarity of graph structured objects. arXiv preprint arXiv:1904.12787 (2019)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2000.889845"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243127.3243131"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340482.3342741"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939712"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/11815921_20"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72903-7_9"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/11815921_17"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-015-9421-5"},{"key":"e_1_3_2_1_40_1","volume-title":"2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 45--52","author":"Phan Anh Viet","year":"2017","unstructured":"Anh Viet Phan , Minh Le Nguyen , and Lam Thu Bui . 2017 . Convolutional neural networks over control flow graphs for software defect prediction . In 2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 45--52 . Anh Viet Phan, Minh Le Nguyen, and Lam Thu Bui. 2017. Convolutional neural networks over control flow graphs for software defect prediction. In 2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 45--52."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2005.1430555"},{"key":"e_1_3_2_1_42_1","volume-title":"Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision computing 27, 7","author":"Riesen Kaspar","year":"2009","unstructured":"Kaspar Riesen and Horst Bunke . 2009. Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision computing 27, 7 ( 2009 ), 950--959. Kaspar Riesen and Horst Bunke. 2009. Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision computing 27, 7 (2009), 950--959."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44415-3_7"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.682181"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"e_1_3_2_1_46_1","unstructured":"Richard Socher Danqi Chen Christopher D Manning and Andrew Ng. 2013. Reasoning with neural tensor networks for knowledge base completion. In Advances in neural information processing systems. 926--934.  Richard Socher Danqi Chen Christopher D Manning and Andrew Ng. 2013. Reasoning with neural tensor networks for knowledge base completion. In Advances in neural information processing systems. 926--934."},{"key":"e_1_3_2_1_47_1","volume-title":"Jimple: Simplifying Java bytecode for analyses and transformations.","author":"Vallee-Rai Raja","year":"1998","unstructured":"Raja Vallee-Rai and Laurie J Hendren . 1998 . Jimple: Simplifying Java bytecode for analyses and transformations. (1998). Raja Vallee-Rai and Laurie J Hendren. 1998. Jimple: Simplifying Java bytecode for analyses and transformations. (1998)."},{"key":"e_1_3_2_1_48_1","first-page":"131","article-title":"Fast computation of graph kernels","volume":"19","author":"Vishwanathan SVN","year":"2006","unstructured":"SVN Vishwanathan , Karsten M Borgwardt , Nicol N Schraudolph , 2006 . Fast computation of graph kernels . In NIPS , Vol. 19. 131 -- 138 . SVN Vishwanathan, Karsten M Borgwardt, Nicol N Schraudolph, et al. 2006. Fast computation of graph kernels. In NIPS, Vol. 19. 131--138.","journal-title":"NIPS"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2012.12.005"},{"key":"e_1_3_2_1_50_1","volume-title":"Dagstuhl Seminar Proceedings. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik.","author":"Walenstein Andrew","year":"2007","unstructured":"Andrew Walenstein , Mohammad El-Ramly , James R Cordy , William S Evans , Kiarash Mahdavi , Markus Pizka , Ganesan Ramalingam , and J\u00fcrgen Wolff von Gudenberg . 2007 . Similarity in programs . In Dagstuhl Seminar Proceedings. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik. Andrew Walenstein, Mohammad El-Ramly, James R Cordy, William S Evans, Kiarash Mahdavi, Markus Pizka, Ganesan Ramalingam, and J\u00fcrgen Wolff von Gudenberg. 2007. Similarity in programs. In Dagstuhl Seminar Proceedings. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_51_1","volume-title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu , Weihua Hu , Jure Leskovec , and Stefanie Jegelka . 2018. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 ( 2018 ). Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 (2018)."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134018"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687631"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE.2014.18"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236024.3236068"},{"key":"e_1_3_2_1_56_1","volume-title":"Conflict-aware optimal scheduling of prioritised code clone refactoring. IET software 7, 3","author":"Zibran Minhaz Fahim","year":"2013","unstructured":"Minhaz Fahim Zibran and Chanchal Kumar Roy . 2013. Conflict-aware optimal scheduling of prioritised code clone refactoring. IET software 7, 3 ( 2013 ), 167--186. Minhaz Fahim Zibran and Chanchal Kumar Roy. 2013. Conflict-aware optimal scheduling of prioritised code clone refactoring. IET software 7, 3 (2013), 167--186."}],"event":{"name":"ESEM '20: ACM \/ IEEE International Symposium on Empirical Software Engineering and Measurement","location":"Bari Italy","acronym":"ESEM '20","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS"]},"container-title":["Proceedings of the 14th ACM \/ IEEE International Symposium on Empirical Software Engineering and Measurement (ESEM)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3382494.3410675","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3382494.3410675","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:26Z","timestamp":1750199906000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3382494.3410675"}},"subtitle":["A Graph Neural Network Approach to Program Similarity"],"short-title":[],"issued":{"date-parts":[[2020,10,5]]},"references-count":56,"alternative-id":["10.1145\/3382494.3410675","10.1145\/3382494"],"URL":"https:\/\/doi.org\/10.1145\/3382494.3410675","relation":{},"subject":[],"published":{"date-parts":[[2020,10,5]]},"assertion":[{"value":"2020-10-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}