{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:45:06Z","timestamp":1755999906511,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492655"},{"type":"electronic","value":"9783031492662"}],"license":[{"start":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T00:00:00Z","timestamp":1701475200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T00:00:00Z","timestamp":1701475200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49266-2_16","type":"book-chapter","created":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T12:03:14Z","timestamp":1701432194000},"page":"227-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Using AI-Based Code Completion for\u00a0Domain-Specific Languages"],"prefix":"10.1007","author":[{"given":"Christina","family":"Piereder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00fcnter","family":"Fleck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Verena","family":"Geist","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Moser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Pichler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,2]]},"reference":[{"key":"16_CR1","unstructured":"Bahdanau, D., Cho, K., Bengio, Y.: Neural machine translation by jointly learning to align and translate. arXiv, Computation and Language 1409 (2014)"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Bruch, M., Monperrus, M., Mezini, M.: Learning from examples to improve code completion systems. In: Proceedings of the 7th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on The Foundations of Software Engineering, ESEC\/FSE 2009, pp. 213\u2013222. Association for Computing Machinery, New York (2009). https:\/\/doi.org\/10.1145\/1595696.1595728","DOI":"10.1145\/1595696.1595728"},{"key":"16_CR3","unstructured":"Chung, J., Gulcehre, C., Cho, K., Bengio, Y.: Empirical evaluation of gated recurrent neural networks on sequence modeling. In: NIPS 2014 Workshop on Deep Learning (2014)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-02654-1_11","volume-title":"Software Language Engineering","author":"S Erdweg","year":"2013","unstructured":"Erdweg, S., et al.: The state of the art in language workbenches. In: Erwig, M., Paige, R.F., Van Wyk, E. (eds.) SLE 2013. LNCS, vol. 8225, pp. 197\u2013217. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-02654-1_11"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Franks, C., Tu, Z., Devanbu, P., Hellendoorn, V.: Cacheca: a cache language model based code suggestion tool. In: Proceedings of the 37th International Conference on Software Engineering, ICSE 2015, vol. 2, pp. 705\u2013708. IEEE Press (2015). https:\/\/dl.acm.org\/doi\/10.5555\/2819009.2819143","DOI":"10.1109\/ICSE.2015.228"},{"key":"16_CR6","unstructured":"Goodfellow, I.J., et al.: Generative adversarial nets. In: NIPS 2014, pp. 2672\u20132680. MIT Press, Cambridge (2014)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Hou, D., Pletcher, D.: Towards a better code completion system by API grouping, filtering, and popularity-based ranking. In: Proceedings of the 2nd International Workshop on Recommendation Systems for Software Engineering, RSSE 2010, pp. 26\u201330. Association for Computing Machinery, New York (2010)","DOI":"10.1145\/1808920.1808926"},{"key":"16_CR8","unstructured":"Husain, H., Wu, H.H., Gazit, T., Allamanis, M., Brockschmidt, M.: CodeSearchNet challenge: evaluating the state of semantic code search. arXiv preprint arXiv:1909.09436 (2019)"},{"key":"16_CR9","unstructured":"Jurafsky, D., Martin, J.H.: N-gram language models. In: Speech and Language Processing. Prentice-Hall Inc., Upper Saddle River (2009). https:\/\/web.stanford.edu\/jurafsky\/slp3\/3.pdf. Accessed 08 Oct 2023"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Li, J., Wang, Y., King, I., Lyu, M.R.: Code completion with neural attention and pointer networks. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018, pp. 4159\u20134165. AAAI Press (2018). https:\/\/dl.acm.org\/doi\/10.5555\/3304222.3304348","DOI":"10.24963\/ijcai.2018\/578"},{"key":"16_CR11","unstructured":"Liaw, R., Liang, E., Nishihara, R., Moritz, P., Gonzalez, J.E., Stoica, I.: Tune: a research platform for distributed model selection and training. arXiv preprint arXiv:1807.05118 (2018)"},{"issue":"4","key":"16_CR12","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1145\/1118890.1118892","volume":"37","author":"M Mernik","year":"2005","unstructured":"Mernik, M., Heering, J., Sloane, A.M.: When and how to develop domain-specific languages. ACM Comput. Surv. 37(4), 316\u2013344 (2005). https:\/\/doi.org\/10.1145\/1118890.1118892","journal-title":"ACM Comput. Surv."},{"key":"16_CR13","unstructured":"Moritz, P., et al.: Ray: a distributed framework for emerging AI applications. In: Proceedings of the 13th USENIX Conference on Operating Systems Design and Implementation, OSDI 2018, pp. 561\u2013577. USENIX Association, USA (2018). https:\/\/dl.acm.org\/doi\/10.5555\/3291168.3291210"},{"key":"16_CR14","unstructured":"Oriol Vinyals, M.F., Jaitly, N.: Pointer networks. In: Proceedings of the 28th International Conference on Neural Information Processing Systems, NIPS 2015, pp. 2692\u20132700. MIT Press, Cambridge (2015)"},{"key":"16_CR15","unstructured":"Pfeiffer, M., Pichler, J.: A comparison of tool support for textual domain-specific languages. In: Proceedings of the 8th OOPSLA Workshop on Domain-Specific Modeling, pp. 1\u20137. Citeseer (2008)"},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Pletcher, D.M., Hou, D.: BCC: enhancing code completion for better API usability. In: 2009 IEEE International Conference on Software Maintenance, pp. 393\u2013394. IEEE (2009). https:\/\/doi.org\/10.1109\/ICSM.2009.5306289","DOI":"10.1109\/ICSM.2009.5306289"},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"Raychev, V., Vechev, M., Yahav, E.: Code completion with statistical language models. In: ACM SIGPLAN Notices, PLDI 2014, vol. 49, pp. 419\u2013428. Association for Computing Machinery, New York (2014). https:\/\/doi.org\/10.1145\/2666356.2594321","DOI":"10.1145\/2666356.2594321"},{"key":"16_CR18","doi-asserted-by":"publisher","unstructured":"Robbes, R., Lanza, M.: How program history can improve code completion. In: 2008 23rd IEEE\/ACM International Conference on Automated Software Engineering, ASE 2008, pp. 317\u2013326. IEEE Computer Society, USA (2008). https:\/\/doi.org\/10.1109\/ASE.2008.42","DOI":"10.1109\/ASE.2008.42"},{"key":"16_CR19","doi-asserted-by":"publisher","unstructured":"Svyatkovskiy, A., Zhao, Y., Fu, S., Sundaresan, N.: Pythia: AI-assisted code completion system. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD 2019, pp. 2727\u20132735. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3292500.3330699","DOI":"10.1145\/3292500.3330699"},{"key":"16_CR20","doi-asserted-by":"publisher","unstructured":"Ziegler, A., et al.: Productivity assessment of neural code completion. In: Proceedings of the 6th ACM SIGPLAN International Symposium on Machine Programming, MAPS 2022, pp. 21\u201329. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3520312.3534864","DOI":"10.1145\/3520312.3534864"}],"container-title":["Lecture Notes in Computer Science","Product-Focused Software Process Improvement"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49266-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T12:06:13Z","timestamp":1701432373000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49266-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,2]]},"ISBN":["9783031492655","9783031492662"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49266-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,2]]},"assertion":[{"value":"2 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PROFES","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Product-Focused Software Process Improvement","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dornbirn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"profes2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/profes-2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","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":"27","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":"13","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":"33% - 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":"2.8","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}