{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T04:49:49Z","timestamp":1783399789288,"version":"3.54.6"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T00:00:00Z","timestamp":1601078400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61832009, 61620106007, and 61751210"],"award-info":[{"award-number":["61832009, 61620106007, and 61751210"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Australian Research Council\u2019s Discovery","award":["DE200100021"],"award-info":[{"award-number":["DE200100021"]}]},{"name":"National Key R8D Program","award":["2018YFB1003904"],"award-info":[{"award-number":["2018YFB1003904"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Softw. Eng. Methodol."],"published-print":{"date-parts":[[2020,10,31]]},"abstract":"<jats:p>Learning representation for source code is a foundation of many program analysis tasks. In recent years, neural networks have already shown success in this area, but most existing models did not make full use of the unique structural information of programs. Although abstract syntax tree (AST)-based neural models can handle the tree structure in the source code, they cannot capture the richness of different types of substructure in programs. In this article, we propose a modular tree network that dynamically composes different neural network units into tree structures based on the input AST. Different from previous tree-structural neural network models, a modular tree network can capture the semantic differences between types of AST substructures. We evaluate our model on two tasks: program classification and code clone detection. Our model achieves the best performance compared with state-of-the-art approaches in both tasks, showing the advantage of leveraging more elaborate structure information of the source code.<\/jats:p>","DOI":"10.1145\/3409331","type":"journal-article","created":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T10:58:57Z","timestamp":1601117937000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Modular Tree Network for Source Code Representation Learning"],"prefix":"10.1145","volume":"29","author":[{"given":"Wenhan","family":"Wang","sequence":"first","affiliation":[{"name":"Peking University, Beijing, P.R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ge","family":"Li","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, P.R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sijie","family":"Shen","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, P.R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6302-3256","authenticated-orcid":false,"given":"Xin","family":"Xia","sequence":"additional","affiliation":[{"name":"Monash University, Melbourne, Victoria, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhi","family":"Jin","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, P.R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,9,26]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212695"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the International Conference on Learning Representations (ICLR\u201918)","author":"Allamanis Miltiadis","year":"2018"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the International Conference on Machine Learning. 2091--2100","author":"Allamanis Miltiadis","year":"2016"},{"key":"e_1_2_1_4_1","unstructured":"Uri Alon Omer Levy and Eran Yahav. 2018. Code2seq: Generating sequences from structured representations of code. arXiv:1808.01400  Uri Alon Omer Levy and Eran Yahav. 2018. Code2seq: Generating sequences from structured representations of code. arXiv:1808.01400"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290353"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the International Conference on Learning Representations (ICLR\u201918)","author":"Arabshahi Forough","year":"2018"},{"key":"e_1_2_1_7_1","volume-title":"Alice Shoshana Jakobovits, and Torsten Hoefler","author":"Ben-Nun Tal","year":"2018"},{"key":"e_1_2_1_8_1","unstructured":"Avishkar Bhoopchand Tim Rockt\u00e4schel Earl Barr and Sebastian Riedel. 2016. Learning Python code suggestion with a sparse pointer network. arXiv:1611.08307  Avishkar Bhoopchand Tim Rockt\u00e4schel Earl Barr and Sebastian Riedel. 2016. Learning Python code suggestion with a sparse pointer network. arXiv:1611.08307"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 7th International Conference on Learning Representations (ICLR\u201919)","author":"Brockschmidt Marc","year":"2019"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P14-2009"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2012.6227135"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2006.18.7.1527"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/265"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI\u201916)","author":"Huo Xuan","year":"2016"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P16-1195"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2007.30"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1181"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the International Conference on Learning Representations (ICLR\u201915)","volume":"5","author":"Diederik"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI\u201918)","author":"Li Jian"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the International Conference on Learning Representations (ICLR\u201916)","author":"Li Yujia","year":"2016"},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence.","author":"Liang Yuding","year":"2018"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/566"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 30th AAAI Conference on Artificial Intelligence","volume":"2","author":"Mou Lili","year":"2016"},{"key":"e_1_2_1_25_1","unstructured":"Graham Neubig Yoav Goldberg and Chris Dyer. 2017. On-the-fly operation batching in dynamic computation graphs. In Advances in Neural Information Processing Systems. 3971--3981.  Graham Neubig Yoav Goldberg and Chris Dyer. 2017. On-the-fly operation batching in dynamic computation graphs. In Advances in Neural Information Processing Systems. 3971--3981."},{"key":"e_1_2_1_26_1","volume-title":"Cordy","author":"Roy Chanchal Kumar","year":"2007"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 2016 IEEE\/ACM 38th International Conference on Software Engineering (ICSE\u201916)","author":"Sajnani Hitesh"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 455--465","author":"Socher Richard"},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the 28th International Conference on Machine Learning (ICML\u201911)","author":"Socher Richard"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSME.2014.77"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). 1556--1566","author":"Tai Kai Sheng"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884804"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/3304889.3305055"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/423"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2970276.2970326"},{"key":"e_1_2_1_36_1","volume-title":"Wilcox","author":"Wilcoxon Frank","year":"1964"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/QRS.2015.14"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2631434"}],"container-title":["ACM Transactions on Software Engineering and Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409331","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409331","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:33Z","timestamp":1750197693000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409331"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,26]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,10,31]]}},"alternative-id":["10.1145\/3409331"],"URL":"https:\/\/doi.org\/10.1145\/3409331","relation":{},"ISSN":["1049-331X","1557-7392"],"issn-type":[{"value":"1049-331X","type":"print"},{"value":"1557-7392","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,26]]},"assertion":[{"value":"2020-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-09-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}