{"id":"https://openalex.org/W4401990041","doi":"https://doi.org/10.1109/tetci.2024.3446695","title":"Balancing Security and Correctness in Code Generation: An Empirical Study on Commercial Large Language Models","display_name":"Balancing Security and Correctness in Code Generation: An Empirical Study on Commercial Large Language Models","publication_year":2024,"publication_date":"2024-08-29","ids":{"openalex":"https://openalex.org/W4401990041","doi":"https://doi.org/10.1109/tetci.2024.3446695"},"language":"en","primary_location":{"id":"doi:10.1109/tetci.2024.3446695","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tetci.2024.3446695","pdf_url":null,"source":{"id":"https://openalex.org/S4210210251","display_name":"IEEE Transactions on Emerging Topics in Computational Intelligence","issn_l":"2471-285X","issn":["2471-285X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Emerging Topics in Computational Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113355101","display_name":"Gavin Black","orcid":"https://orcid.org/0000-0002-5748-6553"},"institutions":[{"id":"https://openalex.org/I125467818","display_name":"Dakota State University","ror":"https://ror.org/016yv6y68","country_code":"US","type":"education","lineage":["https://openalex.org/I125467818"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gavin S. Black","raw_affiliation_strings":["Beacom College of Computer and Cyber Sciences, Dakota State University, Madison, SD, USA"],"raw_orcid":"https://orcid.org/0000-0002-5748-6553","affiliations":[{"raw_affiliation_string":"Beacom College of Computer and Cyber Sciences, Dakota State University, Madison, SD, USA","institution_ids":["https://openalex.org/I125467818"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026032717","display_name":"Bhaskar Prasad Rimal","orcid":"https://orcid.org/0000-0001-7680-9293"},"institutions":[{"id":"https://openalex.org/I155093810","display_name":"University of Idaho","ror":"https://ror.org/03hbp5t65","country_code":"US","type":"education","lineage":["https://openalex.org/I155093810"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bhaskar P. Rimal","raw_affiliation_strings":["Department of Computer Science, University of Idaho, Moscow, ID, USA"],"raw_orcid":"https://orcid.org/0000-0001-7680-9293","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Idaho, Moscow, ID, USA","institution_ids":["https://openalex.org/I155093810"]}]},{"author_position":"last","author":{"id":null,"display_name":"Varghese Mathew Vaidyan","orcid":"https://orcid.org/0000-0002-9737-242X"},"institutions":[{"id":"https://openalex.org/I125467818","display_name":"Dakota State University","ror":"https://ror.org/016yv6y68","country_code":"US","type":"education","lineage":["https://openalex.org/I125467818"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Varghese Mathew Vaidyan","raw_affiliation_strings":["Beacom College of Computer and Cyber Sciences, Dakota State University, Madison, SD, USA"],"raw_orcid":"https://orcid.org/0000-0002-9737-242X","affiliations":[{"raw_affiliation_string":"Beacom College of Computer and Cyber Sciences, Dakota State University, Madison, SD, USA","institution_ids":["https://openalex.org/I125467818"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.2744,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.97497485,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":"9","issue":"1","first_page":"419","last_page":"430"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10260","display_name":"Software Engineering Research","score":0.9643999934196472,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10260","display_name":"Software Engineering Research","score":0.9643999934196472,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7501670718193054},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.695782482624054},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4994206428527832},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.46723753213882446}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7501670718193054},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.695782482624054},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4994206428527832},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.46723753213882446},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tetci.2024.3446695","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tetci.2024.3446695","pdf_url":null,"source":{"id":"https://openalex.org/S4210210251","display_name":"IEEE Transactions on Emerging Topics in Computational Intelligence","issn_l":"2471-285X","issn":["2471-285X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Emerging Topics in Computational Intelligence","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320313455","display_name":"University of Idaho","ror":"https://ror.org/03hbp5t65"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W2012436850","https://openalex.org/W2132688679","https://openalex.org/W2958860733","https://openalex.org/W3206193994","https://openalex.org/W4281763794","https://openalex.org/W4288057765","https://openalex.org/W4308627645","https://openalex.org/W4321354332","https://openalex.org/W4323033814","https://openalex.org/W4327946446","https://openalex.org/W4328028522","https://openalex.org/W4366548330","https://openalex.org/W4366735548","https://openalex.org/W4378574344","https://openalex.org/W4378942602","https://openalex.org/W4384026520","https://openalex.org/W4385187421","https://openalex.org/W4389158474","https://openalex.org/W4391307510","https://openalex.org/W4399203759","https://openalex.org/W4399750638","https://openalex.org/W6800844176","https://openalex.org/W6841333436","https://openalex.org/W6851202749","https://openalex.org/W6851560035","https://openalex.org/W6851678493","https://openalex.org/W6851985570","https://openalex.org/W6852183785","https://openalex.org/W6852294948","https://openalex.org/W6852755587","https://openalex.org/W6852835532","https://openalex.org/W6852887568","https://openalex.org/W6853672345"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W1667647204","https://openalex.org/W2404647514","https://openalex.org/W4247536566","https://openalex.org/W2018477250","https://openalex.org/W3119814709","https://openalex.org/W4241418540","https://openalex.org/W1508895727","https://openalex.org/W2725786787"],"abstract_inverted_index":{"Large":[0],"language":[1],"models":[2,24],"(LLMs)":[3],"continue":[4],"to":[5,30,41,91,106,127,158],"be":[6],"adopted":[7],"for":[8,84],"a":[9,19,53],"multitude":[10],"of":[11,34,98,136,147,162,169],"previously":[12],"manual":[13],"tasks,":[14],"with":[15,56,119,144],"code":[16,51,64,88,109],"generation":[17,89],"as":[18],"prominent":[20],"use.":[21],"Multiple":[22],"commercial":[23,112],"have":[25],"seen":[26],"wide":[27],"adoption":[28],"due":[29],"the":[31,35,49,134,145,150,160,167],"accessible":[32],"nature":[33],"interface.":[36],"Simple":[37],"prompts":[38,105,125],"can":[39,69],"lead":[40],"working":[42],"solutions":[43],"that":[44,133,165],"save":[45],"developers":[46],"time.":[47],"However,":[48],"generated":[50,102,142],"has":[52],"significant":[54,152],"challenge":[55],"maintaining":[57],"security.":[58,129],"There":[59],"are":[60,116,156],"no":[61],"guarantees":[62],"on":[63],"safety,":[65],"and":[66,123],"LLM":[67],"responses":[68,86],"readily":[70],"include":[71],"known":[72],"weaknesses.":[73],"To":[74],"address":[75],"this":[76],"concern,":[77],"our":[78],"research":[79],"examines":[80],"different":[81,120],"prompt":[82],"types":[83],"shaping":[85],"from":[87],"tasks":[90],"produce":[92],"safer":[93],"outputs.":[94],"The":[95],"top":[96],"set":[97],"common":[99],"weaknesses":[100],"is":[101],"through":[103],"unconditioned":[104],"create":[107],"vulnerable":[108],"across":[110],"multiple":[111],"LLMs.":[113],"These":[114],"inputs":[115],"then":[117],"paired":[118],"contexts,":[121],"roles,":[122],"identification":[124],"intended":[126],"improve":[128],"Our":[130],"findings":[131],"show":[132],"inclusion":[135],"appropriate":[137],"guidance":[138],"reduces":[139],"vulnerabilities":[140],"in":[141],"code,":[143],"choice":[146],"model":[148,170],"having":[149],"most":[151],"effect.":[153],"Additionally,":[154],"timings":[155],"presented":[157],"demonstrate":[159],"efficiency":[161],"singular":[163],"requests":[164],"limit":[166],"number":[168],"interactions.":[171]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":8}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}