{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T15:29:25Z","timestamp":1750346965023,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,4,15]],"date-time":"2024-04-15T00:00:00Z","timestamp":1713139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,4,15]]},"DOI":"10.1145\/3643916.3644406","type":"proceedings-article","created":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T12:40:20Z","timestamp":1718282420000},"page":"258-269","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["SolaSim: Clone Detection for Solana Smart Contracts via Program Representation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-7689-5698","authenticated-orcid":false,"given":"Che","family":"Wang","sequence":"first","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4137-619X","authenticated-orcid":false,"given":"Yue","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Taiyuan University of Technology, Taiyuan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6760-5552","authenticated-orcid":false,"given":"Jianbo","family":"Gao","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5537-2483","authenticated-orcid":false,"given":"Ke","family":"Wang","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8140-9208","authenticated-orcid":false,"given":"Jiashuo","family":"Zhang","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6144-4815","authenticated-orcid":false,"given":"Zhi","family":"Guan","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5785-2912","authenticated-orcid":false,"given":"Zhong","family":"Chen","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Anchor. 2022. The Anchor Framwork. https:\/\/www.anchor-lang.com\/"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEEOT.2016.7754750"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2007.70725"},{"key":"e_1_3_2_1_4_1","unstructured":"Cargo. 2022. Cargo Package. https:\/\/github.com\/rust-lang\/cargo"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SANER50967.2021.00050"},{"key":"e_1_3_2_1_6_1","unstructured":"CoinmarketCap. 2023. Solana's Ranking. https:\/\/coinmarketcap.com\/."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560552"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377811.3380364"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978370"},{"key":"e_1_3_2_1_10_1","unstructured":"Solana Foundation. 2022. Solana Project Trends. https:\/\/solanaproject.com\/#\/."},{"key":"e_1_3_2_1_11_1","unstructured":"Solana Foundation. 2022. Solana Standard Library. https:\/\/spl.solana.com\/"},{"key":"e_1_3_2_1_12_1","unstructured":"Solana Foundation. 2023. Solana Transaction per Seconds. https:\/\/analytics.solscan.io\/"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368088.1368132"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSME.2019.00067"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2020.2971482"},{"key":"e_1_3_2_1_16_1","unstructured":"GithubCode. 2023. Open source code and data of SolaSim. https:\/\/github.com\/Academic23\/SolaSim_CloneDetection"},{"key":"e_1_3_2_1_17_1","unstructured":"google. 2022. What is accuracy. https:\/\/developers.google.com\/machine-learning\/crash-course\/classification\/accuracy"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062455.1062491"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Zhe Hui Hoo Jane Candlish and Dawn Teare. 2017. What is an ROC curve? 357--359 pages.","DOI":"10.1136\/emermed-2017-206735"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2007.30"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1287624.1287634"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2022.3207428"},{"key":"e_1_3_2_1_23_1","volume-title":"The Hungarian method for the assignment problem. Naval research logistics quarterly 2, 1--2","author":"Kuhn Harold W","year":"1955","unstructured":"Harold W Kuhn. 1955. The Hungarian method for the assignment problem. Naval research logistics quarterly 2, 1--2 (1955), 83--97."},{"key":"e_1_3_2_1_24_1","unstructured":"Confident Level. 2022. Measuring Confidence Level of test dataset size. https:\/\/www.surveysystem.com\/sscalc.htm"},{"key":"e_1_3_2_1_25_1","volume-title":"IDEAL 2013, Hefei, China, October 20--23, 2013. Proceedings 14","author":"Li Baoli","year":"2013","unstructured":"Baoli Li and Liping Han. 2013. Distance weighted cosine similarity measure for text classification. In Intelligent Data Engineering and Automated Learning-IDEAL 2013: 14th International Conference, IDEAL 2013, Hefei, China, October 20--23, 2013. Proceedings 14. Springer, 611--618."},{"key":"e_1_3_2_1_26_1","first-page":"289","article-title":"CP-Miner: A tool for finding copy-paste and related bugs in operating system code","volume":"4","author":"Li Zhenmin","year":"2004","unstructured":"Zhenmin Li, Shan Lu, Suvda Myagmar, and Yuanyuan Zhou. 2004. CP-Miner: A tool for finding copy-paste and related bugs in operating system code.. In OSdi, Vol. 4. 289--302.","journal-title":"OSdi"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2819980"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236024.3264596"},{"key":"e_1_3_2_1_29_1","unstructured":"MatePlex. 2022. The MatePlex Project. https:\/\/solana.com\/ecosystem\/metaplex"},{"key":"e_1_3_2_1_30_1","unstructured":"NetworkX. 2022. NetworkX Package. https:\/\/github.com\/networkx\/networkx"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2017.11.039"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021271615909"},{"key":"e_1_3_2_1_33_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."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/APSEC.2017.80"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.12.071"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2015.2448531"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2017.14"},{"key":"e_1_3_2_1_38_1","volume-title":"BlockScope: Detecting and Investigating Propagated Vulnerabilities in Forked Blockchain Projects. arXiv preprint arXiv:2208.00205","author":"Yi Xiao","year":"2022","unstructured":"Xiao Yi, Yuzhou Fang, Daoyuan Wu, and Lingxiao Jiang. 2022. BlockScope: Detecting and Investigating Propagated Vulnerabilities in Forked Blockchain Projects. arXiv preprint arXiv:2208.00205 (2022)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00284"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2019.00086"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236024.3236068"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3524610.3529161"}],"event":{"name":"ICPC '24: 32nd IEEE\/ACM International Conference on Program Comprehension","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS"],"location":"Lisbon Portugal","acronym":"ICPC '24"},"container-title":["Proceedings of the 32nd IEEE\/ACM International Conference on Program Comprehension"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3643916.3644406","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3643916.3644406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:57:35Z","timestamp":1750291055000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3643916.3644406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,15]]},"references-count":42,"alternative-id":["10.1145\/3643916.3644406","10.1145\/3643916"],"URL":"https:\/\/doi.org\/10.1145\/3643916.3644406","relation":{},"subject":[],"published":{"date-parts":[[2024,4,15]]},"assertion":[{"value":"2024-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}