{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:46:58Z","timestamp":1750308418733,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T00:00:00Z","timestamp":1650240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2026869"],"award-info":[{"award-number":["2026869"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,4,18]]},"DOI":"10.1145\/3476883.3520205","type":"proceedings-article","created":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T02:11:49Z","timestamp":1651716709000},"page":"224-228","source":"Crossref","is-referenced-by-count":1,"title":["What questions do developers ask about Julia?"],"prefix":"10.1145","author":[{"given":"Dibyendu Brinto","family":"Bose","sequence":"first","affiliation":[{"name":"Reve System, Dhaka, Bangladesh"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerald C.","family":"Gannod","sequence":"additional","affiliation":[{"name":"Tennessee Tech University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akond","family":"Rahman","sequence":"additional","affiliation":[{"name":"Tennessee Tech University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaitlyn","family":"Cottrell","sequence":"additional","affiliation":[{"name":"Tennessee Tech University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,5,4]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n.d.]. Julia. https:\/\/juliacomputing.com\/case-studies\/celeste.html.  [n.d.]. Julia. https:\/\/juliacomputing.com\/case-studies\/celeste.html."},{"key":"e_1_3_2_1_2_1","unstructured":"[n.d.]. Julia: Come For The Syntax Stay For The Speed. https:\/\/www.nature.com\/articles\/d41586-019-02310-3.  [n.d.]. Julia: Come For The Syntax Stay For The Speed. https:\/\/www.nature.com\/articles\/d41586-019-02310-3."},{"key":"e_1_3_2_1_3_1","unstructured":"[n.d.]. The Julia Language. https:\/\/docs.julialang.org\/en\/v1\/.  [n.d.]. The Julia Language. https:\/\/docs.julialang.org\/en\/v1\/."},{"volume-title":"Julia Update: Adoption Keeps Climbing","year":"2021","key":"e_1_3_2_1_4_1","unstructured":"[n.d.]. Julia Update: Adoption Keeps Climbing ; Is It a Python Challenger ? https:\/\/www.hpcwire.com\/ 2021 \/01\/13\/julia-update-adoption-keeps-climbing-is-it-a-python-challenger\/. [n.d.]. Julia Update: Adoption Keeps Climbing; Is It a Python Challenger? https:\/\/www.hpcwire.com\/2021\/01\/13\/julia-update-adoption-keeps-climbing-is-it-a-python-challenger\/."},{"key":"e_1_3_2_1_5_1","unstructured":"[n.d.]. Programming Languages: Developers Reveal What They Love and Loathe and What Pays Best. https:\/\/www.zdnet.com\/article\/programming-languages-developers-reveal-what-they-love-and-loathe\/.  [n.d.]. Programming Languages: Developers Reveal What They Love and Loathe and What Pays Best. https:\/\/www.zdnet.com\/article\/programming-languages-developers-reveal-what-they-love-and-loathe\/."},{"key":"e_1_3_2_1_6_1","unstructured":"[n.d.]. Why Julia is Slowly Replacing Python in Machine Learning and Data Science. https:\/\/www.section.io\/engineering-education\/why-julia-is-slowly-replacing-python-for-machine-learning-and-data-science\/.  [n.d.]. Why Julia is Slowly Replacing Python in Machine Learning and Data Science. https:\/\/www.section.io\/engineering-education\/why-julia-is-slowly-replacing-python-for-machine-learning-and-data-science\/."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-017-9508-2"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3338906.3338939"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196398.3196430"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276490"},{"volume-title":"Doing Qualitative Research","author":"Crabtree Benjamin","key":"e_1_3_2_1_12_1","unstructured":"Benjamin Crabtree and William Miller . 1999. Doing Qualitative Research . SAGE Publications . Benjamin Crabtree and William Miller. 1999. Doing Qualitative Research. SAGE Publications."},{"volume-title":"Using Python and Julia for Efficient Implementation of Natural Computing and Complexity Related Algorithms. In 2015 20th International Conference on Control Systems and Computer Science","author":"Dogaru Ioana","key":"e_1_3_2_1_13_1","unstructured":"Ioana Dogaru and Radu Dogaru . 2015. Using Python and Julia for Efficient Implementation of Natural Computing and Complexity Related Algorithms. In 2015 20th International Conference on Control Systems and Computer Science . IEEE , 599--604. https:\/\/ieeexplore.ieee.org\/abstract\/document\/7168488 Ioana Dogaru and Radu Dogaru. 2015. Using Python and Julia for Efficient Implementation of Natural Computing and Complexity Related Algorithms. In 2015 20th International Conference on Control Systems and Computer Science. IEEE, 599--604. https:\/\/ieeexplore.ieee.org\/abstract\/document\/7168488"},{"key":"e_1_3_2_1_14_1","volume-title":"Synthesizing Program Execution Time Discrepancies in Julia Used for Scientific Software. In 2019 IEEE International Conference on Software Maintenance and Evolution (ICSME). IEEE, 496--500","author":"Farhana Effat","year":"2019","unstructured":"Effat Farhana , Nasif Imtiaz , and Akond Rahman . 2019 . Synthesizing Program Execution Time Discrepancies in Julia Used for Scientific Software. In 2019 IEEE International Conference on Software Maintenance and Evolution (ICSME). IEEE, 496--500 . https:\/\/ieeexplore.ieee.org\/abstract\/document\/8918949 Effat Farhana, Nasif Imtiaz, and Akond Rahman. 2019. Synthesizing Program Execution Time Discrepancies in Julia Used for Scientific Software. In 2019 IEEE International Conference on Software Maintenance and Evolution (ICSME). IEEE, 496--500. https:\/\/ieeexplore.ieee.org\/abstract\/document\/8918949"},{"key":"e_1_3_2_1_15_1","volume-title":"The Julia Programming Language: The Future of Scientific Computing. APS","author":"Gibson John","year":"2017","unstructured":"John Gibson . 2017. The Julia Programming Language: The Future of Scientific Computing. APS ( 2017 ), L39--011. https:\/\/ui.adsabs.harvard.edu\/abs\/2017APS. .DFDL39011G\/abstract John Gibson. 2017. The Julia Programming Language: The Future of Scientific Computing. APS (2017), L39--011. https:\/\/ui.adsabs.harvard.edu\/abs\/2017APS. .DFDL39011G\/abstract"},{"key":"e_1_3_2_1_16_1","volume-title":"A Comparative Study of High-productivity High-performance Programming Languages for Parallel Metaheuristics. Swarm and Evolutionary Computation","author":"Gmys Jan","year":"2020","unstructured":"Jan Gmys , Tiago Carneiro , Nouredine Melab , El-Ghazali Talbi , and Daniel Tuyttens . 2020. A Comparative Study of High-productivity High-performance Programming Languages for Parallel Metaheuristics. Swarm and Evolutionary Computation ( 2020 ), 100720. https:\/\/www.sciencedirect.com\/science\/article\/abs\/pii\/S2210650220303734 Jan Gmys, Tiago Carneiro, Nouredine Melab, El-Ghazali Talbi, and Daniel Tuyttens. 2020. A Comparative Study of High-productivity High-performance Programming Languages for Parallel Metaheuristics. Swarm and Evolutionary Computation (2020), 100720. https:\/\/www.sciencedirect.com\/science\/article\/abs\/pii\/S2210650220303734"},{"key":"e_1_3_2_1_17_1","volume-title":"Comparative Analysis of the Efficiency of Julia Language Against the Other Classic Programming Languages. Silesian Journal of Pure and Applied Mathematics 8","author":"Januszek Tomasz","year":"2018","unstructured":"Tomasz Januszek and Mark Pleszczy\u0144ski . 2018. Comparative Analysis of the Efficiency of Julia Language Against the Other Classic Programming Languages. Silesian Journal of Pure and Applied Mathematics 8 ( 2018 ). https:\/\/yadda.icm.edu.pl\/baztech\/element\/bwmeta1.element.baztech-c4339453-4519-4b92-a673-307638a50cb1 Tomasz Januszek and Mark Pleszczy\u0144ski. 2018. Comparative Analysis of the Efficiency of Julia Language Against the Other Classic Programming Languages. Silesian Journal of Pure and Applied Mathematics 8 (2018). https:\/\/yadda.icm.edu.pl\/baztech\/element\/bwmeta1.element.baztech-c4339453-4519-4b92-a673-307638a50cb1"},{"key":"e_1_3_2_1_18_1","volume-title":"Content Analysis: An Introduction to its Methodology","author":"Krippendorff Klaus","year":"2018","unstructured":"Klaus Krippendorff . 2018 . Content Analysis: An Introduction to its Methodology . Sage publications. Klaus Krippendorff. 2018. Content Analysis: An Introduction to its Methodology. Sage publications."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460319.3464797"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2017.37"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSR.2019.00040"},{"volume-title":"The Coding Manual for Qualitative Researchers","author":"Salda\u00f1a Johnny","key":"e_1_3_2_1_22_1","unstructured":"Johnny Salda\u00f1a . 2015. The Coding Manual for Qualitative Researchers . Sage . Johnny Salda\u00f1a. 2015. The Coding Manual for Qualitative Researchers. Sage."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/AERO47225.2020.9172277"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377811.3380352"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2008.15"},{"key":"e_1_3_2_1_26_1","unstructured":"Stack Overflow. 2019. Memory Allocation with Broadcasted Operation. https:\/\/stackoverflow.com\/questions\/57295291\/.  Stack Overflow. 2019. Memory Allocation with Broadcasted Operation. https:\/\/stackoverflow.com\/questions\/57295291\/."},{"key":"e_1_3_2_1_27_1","volume-title":"An Analysis of Python's Topics, Trends, and Technologies Through Mining Stack Overflow Discussions. arXiv preprint arXiv:2004.06280","author":"Tahmooresi Hamed","year":"2020","unstructured":"Hamed Tahmooresi , Abbas Heydarnoori , and Alireza Aghamohammadi . 2020. An Analysis of Python's Topics, Trends, and Technologies Through Mining Stack Overflow Discussions. arXiv preprint arXiv:2004.06280 ( 2020 ). Hamed Tahmooresi, Abbas Heydarnoori, and Alireza Aghamohammadi. 2020. An Analysis of Python's Topics, Trends, and Technologies Through Mining Stack Overflow Discussions. arXiv preprint arXiv:2004.06280 (2020)."},{"key":"e_1_3_2_1_28_1","volume-title":"HERO: On the Chaos When PATH Meets Modules. In 2021 IEEE\/ACM 43rd International Conference on Software Engineering (ICSE). IEEE, 99--111","author":"Wang Ying","year":"2021","unstructured":"Ying Wang , Liang Qiao , Chang Xu , Yepang Liu , Shing-Chi Cheung , Na Meng , Hai Yu , and Zhiliang Zhu . 2021 . HERO: On the Chaos When PATH Meets Modules. In 2021 IEEE\/ACM 43rd International Conference on Software Engineering (ICSE). IEEE, 99--111 . Ying Wang, Liang Qiao, Chang Xu, Yepang Liu, Shing-Chi Cheung, Na Meng, Hai Yu, and Zhiliang Zhu. 2021. HERO: On the Chaos When PATH Meets Modules. In 2021 IEEE\/ACM 43rd International Conference on Software Engineering (ICSE). IEEE, 99--111."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276483"}],"event":{"name":"ACM SE '22: 2022 ACM Southeast Conference","sponsor":["ACM Association for Computing Machinery"],"location":"Virtual Event","acronym":"ACM SE '22"},"container-title":["Proceedings of the ACM Southeast Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3476883.3520205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3476883.3520205","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3476883.3520205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:20Z","timestamp":1750268960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3476883.3520205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,18]]},"references-count":28,"alternative-id":["10.1145\/3476883.3520205","10.1145\/3476883"],"URL":"https:\/\/doi.org\/10.1145\/3476883.3520205","relation":{},"subject":[],"published":{"date-parts":[[2022,4,18]]}}}