{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T04:16:36Z","timestamp":1771647396675,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031372308","type":"print"},{"value":"9783031372315","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-37231-5_9","type":"book-chapter","created":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T08:02:46Z","timestamp":1689667366000},"page":"187-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Towards Extracting Reusable and\u00a0Maintainable Code Snippets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6117-8222","authenticated-orcid":false,"given":"Thomas","family":"Karanikiotis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0235-6046","authenticated-orcid":false,"given":"Andreas L.","family":"Symeonidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,19]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Aggarwal, K., Hindle, A., Stroulia, E.: Co-evolution of project documentation and popularity within github. In: Proceedings of the 11th Working Conference on Mining Software Repositories. MSR 2014, New York, NY, USA, pp. 360\u2013363. Association for Computing Machinery (2014). https:\/\/doi.org\/10.1145\/2597073.2597120","DOI":"10.1145\/2597073.2597120"},{"issue":"7","key":"9_CR2","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1109\/TSE.2018.2832048","volume":"44","author":"M Allamanis","year":"2018","unstructured":"Allamanis, M., Barr, E.T., Bird, C., Devanbu, P., Marron, M., Sutton, C.: Mining semantic loop idioms. IEEE Trans. Software Eng. 44(7), 651\u2013668 (2018). https:\/\/doi.org\/10.1109\/TSE.2018.2832048","journal-title":"IEEE Trans. Software Eng."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Allamanis, M., Sutton, C.: Mining idioms from source code. CoRR abs\/1404.0417 (2014). http:\/\/arxiv.org\/abs\/1404.0417","DOI":"10.1145\/2635868.2635901"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Augsten, N., B\u00f6hlen, M., Gamper, J.: The PQ-gram distance between ordered labeled trees 35(1) (2008). https:\/\/doi.org\/10.1145\/1670243.1670247","DOI":"10.1145\/1670243.1670247"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Augsten, N., B\u00f6hlen, M., Gamper, J.: Approximate matching of hierarchical data using PQ-grams - slides 1, 301\u2013312 (2005). https:\/\/doi.org\/10.5167\/uzh-56101","DOI":"10.5167\/uzh-56101"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Baltes, S., Dumani, L., Treude, C., Diehl, S.: Sotorrent: Reconstructing and analyzing the evolution of stack overflow posts. CoRR abs\/1803.07311 (2018). http:\/\/arxiv.org\/abs\/1803.07311","DOI":"10.1145\/3196398.3196430"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Borges, H., Hora, A., Valente, M.T.: Understanding the factors that impact the popularity of github repositories. In: 2016 IEEE International Conference on Software Maintenance and Evolution (ICSME), pp. 334\u2013344 (2016). https:\/\/doi.org\/10.1109\/ICSME.2016.31","DOI":"10.1109\/ICSME.2016.31"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Dimaridou, V., Kyprianidis, A.C., Papamichail, M., Diamantopoulos, T., Symeonidis, A.: Towards modeling the user-perceived quality of source code using static analysis metrics, pp. 73\u201384, July 2017. https:\/\/doi.org\/10.5220\/0006420000730084","DOI":"10.5220\/0006420000730084"},{"key":"9_CR9","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-93641-3_1","volume-title":"Software Technologies","author":"V Dimaridou","year":"2018","unstructured":"Dimaridou, V., Kyprianidis, A.-C., Papamichail, M., Diamantopoulos, T., Symeonidis, A.: Assessing the user-perceived quality of source code components using static analysis metrics. In: Cabello, E., Cardoso, J., Maciaszek, L.A., van Sinderen, M. (eds.) ICSOFT 2017. CCIS, vol. 868, pp. 3\u201327. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93641-3_1"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Fowkes, J., Sutton, C.: Parameter-free probabilistic API mining across github. In: Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering. FSE 2016, New York, NY, USA, pp. 254\u2013265. Association for Computing Machinery (2016). https:\/\/doi.org\/10.1145\/2950290.2950319","DOI":"10.1145\/2950290.2950319"},{"key":"9_CR11","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-319-07013-1_23","volume-title":"Proceedings of the Ninth International Conference on Dependability and Complex Systems DepCoS-RELCOMEX. June 30 \u2013 July 4, 2014, Brun\u00f3w, Poland","author":"B Hnatkowska","year":"2014","unstructured":"Hnatkowska, B., Jaszczak, A.: Impact of selected java idioms on source code maintainability \u2013 empirical study. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds.) Proceedings of the Ninth International Conference on Dependability and Complex Systems DepCoS-RELCOMEX. June 30 \u2013 July 4, 2014, Brun\u00f3w, Poland. AISC, vol. 286, pp. 243\u2013254. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07013-1_23"},{"issue":"06","key":"9_CR12","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1142\/S021819402150025X","volume":"31","author":"X Ji","year":"2021","unstructured":"Ji, X., Liu, L., Zhu, J.: Code clone detection with hierarchical attentive graph embedding. Int. J. Software Eng. Knowl. Eng. 31(06), 837\u2013861 (2021). https:\/\/doi.org\/10.1142\/S021819402150025X","journal-title":"Int. J. Software Eng. Knowl. Eng."},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-68530-8_8","volume-title":"Algorithms \u2014 ESA\u2019 98","author":"PN Klein","year":"1998","unstructured":"Klein, P.N.: Computing the edit-distance between unrooted ordered trees. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 91\u2013102. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-68530-8_8"},{"issue":"4","key":"9_CR14","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1109\/TSE.1976.233837","volume":"SE\u20132","author":"T McCabe","year":"1976","unstructured":"McCabe, T.: A complexity measure. IEEE Trans. Software Eng. SE\u20132(4), 308\u2013320 (1976). https:\/\/doi.org\/10.1109\/TSE.1976.233837","journal-title":"IEEE Trans. Software Eng."},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Papamichail, M., Diamantopoulos, T., Symeonidis, A.: User-perceived source code quality estimation based on static analysis metrics. In: 2016 IEEE International Conference on Software Quality, Reliability and Security (QRS), pp. 100\u2013107 (2016). https:\/\/doi.org\/10.1109\/QRS.2016.22","DOI":"10.1109\/QRS.2016.22"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Papoudakis, A., Karanikiotis, T., Symeonidis, A.: A mechanism for automatically extracting reusable and maintainable code idioms from software repositories. In: Proceedings of the 17th International Conference on Software Technologies - Volume 1: ICSOFT, pp. 79\u201390. INSTICC, SciTePress (2022). https:\/\/doi.org\/10.5220\/0011279300003266","DOI":"10.5220\/0011279300003266"},{"key":"9_CR17","unstructured":"Sivaraman, A., Abreu, R., Scott, A., Akomolede, T., Chandra, S.: Mining idioms in the wild. CoRR abs\/2107.06402 (2021). https:\/\/arxiv.org\/abs\/2107.06402"},{"issue":"3","key":"9_CR18","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"KC Tai","year":"1979","unstructured":"Tai, K.C.: The tree-to-tree correction problem. J. ACM 26(3), 422\u2013433 (1979). https:\/\/doi.org\/10.1145\/322139.322143","journal-title":"J. ACM"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"2414","DOI":"10.1587\/transinf.2019MPP0002","volume":"E102.D","author":"H Tanaka","year":"2019","unstructured":"Tanaka, H., Matsumoto, S., Kusumoto, S.: A study on the current status of functional idioms in Java. IEICE Trans. Inf. Syst. E102.D, 2414\u20132422 (2019). https:\/\/doi.org\/10.1587\/transinf.2019MPP0002","journal-title":"IEICE Trans. Inf. Syst."},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Wang, J., Dang, Y., Zhang, H., Chen, K., Xie, T., Zhang, D.: Mining succinct and high-coverage api usage patterns from source code. In: 2013 10th Working Conference on Mining Software Repositories (MSR), pp. 319\u2013328 (2013). https:\/\/doi.org\/10.1109\/MSR.2013.6624045","DOI":"10.1109\/MSR.2013.6624045"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Weber, S., Luo, J.: What makes an open source code popular on git hub? In: 2014 IEEE International Conference on Data Mining Workshop, pp. 851\u2013855 (2014). https:\/\/doi.org\/10.1109\/ICDMW.2014.55","DOI":"10.1109\/ICDMW.2014.55"},{"key":"9_CR22","doi-asserted-by":"publisher","unstructured":"Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18(6), 1245\u20131262 (1989). https:\/\/doi.org\/10.1137\/0218082","DOI":"10.1137\/0218082"},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Zhang, Y., Wang, T.: CCEYES: an effective tool for code clone detection on large-scale open source repositories. In: 2021 IEEE International Conference on Information Communication and Software Engineering (ICICSE), pp. 61\u201370 (2021). https:\/\/doi.org\/10.1109\/ICICSE52190.2021.9404141","DOI":"10.1109\/ICICSE52190.2021.9404141"}],"container-title":["Communications in Computer and Information Science","Software Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37231-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T08:07:31Z","timestamp":1689667651000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37231-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031372308","9783031372315"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37231-5_9","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSOFT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Software Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icsoft2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icsoft.scitevents.org\/?y=2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"PRIMORIS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"102","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}