{"id":"https://openalex.org/W4379522465","doi":"https://doi.org/10.1145/3589250.3596143","title":"Completeness Thresholds for Memory Safety of Array Traversing Programs","display_name":"Completeness Thresholds for Memory Safety of Array Traversing Programs","publication_year":2023,"publication_date":"2023-06-06","ids":{"openalex":"https://openalex.org/W4379522465","doi":"https://doi.org/10.1145/3589250.3596143"},"language":"en","primary_location":{"id":"doi:10.1145/3589250.3596143","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3589250.3596143","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis","raw_type":"proceedings-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/A5048636624","display_name":"Tobias Reinhard","orcid":"https://orcid.org/0000-0003-1048-8735"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Tobias Reinhard","raw_affiliation_strings":["KU Leuven, Belgium"],"affiliations":[{"raw_affiliation_string":"KU Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089526693","display_name":"Justus Fasse","orcid":null},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Justus Fasse","raw_affiliation_strings":["KU Leuven, Belgium"],"affiliations":[{"raw_affiliation_string":"KU Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042359645","display_name":"Bart Jacobs","orcid":"https://orcid.org/0000-0002-3605-249X"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Bart Jacobs","raw_affiliation_strings":["KU Leuven, Belgium"],"affiliations":[{"raw_affiliation_string":"KU Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5048636624"],"corresponding_institution_ids":["https://openalex.org/I99464096"],"apc_list":null,"apc_paid":null,"fwci":0.1735,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.53945414,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"47","last_page":"54"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11424","display_name":"Security and Verification in Computing","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/completeness","display_name":"Completeness (order theory)","score":0.7828906774520874},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.7753317952156067},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7661870718002319},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7193807363510132},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.7022126913070679},{"id":"https://openalex.org/keywords/memory-safety","display_name":"Memory safety","score":0.6302438974380493},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5694316029548645},{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.5633894205093384},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4961884617805481},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4604192078113556},{"id":"https://openalex.org/keywords/c-dynamic-memory-allocation","display_name":"C dynamic memory allocation","score":0.43836861848831177},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3620477616786957},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.23240980505943298},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2123706042766571},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.10357546806335449}],"concepts":[{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.7828906774520874},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.7753317952156067},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7661870718002319},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7193807363510132},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.7022126913070679},{"id":"https://openalex.org/C28180684","wikidata":"https://www.wikidata.org/wiki/Q4080983","display_name":"Memory safety","level":3,"score":0.6302438974380493},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5694316029548645},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.5633894205093384},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4961884617805481},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4604192078113556},{"id":"https://openalex.org/C34339311","wikidata":"https://www.wikidata.org/wiki/Q1050390","display_name":"C dynamic memory allocation","level":4,"score":0.43836861848831177},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3620477616786957},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.23240980505943298},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2123706042766571},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.10357546806335449},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3589250.3596143","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3589250.3596143","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis","raw_type":"proceedings-article"},{"id":"pmh:oai:lirias2repo.kuleuven.be:20.500.12942/721275","is_oa":false,"landing_page_url":"https://lirias.kuleuven.be/handle/20.500.12942/721275","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Workshop on the State Of the Art in Program Analysis (SOAP), Orlando, Florida, USA, 17 June 2023","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W171295454","https://openalex.org/W174184838","https://openalex.org/W1495266209","https://openalex.org/W1495368328","https://openalex.org/W1509819701","https://openalex.org/W1511737804","https://openalex.org/W1535375892","https://openalex.org/W1549820563","https://openalex.org/W1598659274","https://openalex.org/W1889756448","https://openalex.org/W1982900911","https://openalex.org/W2031525781","https://openalex.org/W2051054731","https://openalex.org/W2128466619","https://openalex.org/W2129538349","https://openalex.org/W2132150351","https://openalex.org/W2137628566","https://openalex.org/W2143641131","https://openalex.org/W2153923555","https://openalex.org/W2158395308","https://openalex.org/W2171999426","https://openalex.org/W2293624369","https://openalex.org/W2612667315","https://openalex.org/W2789258134","https://openalex.org/W2884670017","https://openalex.org/W2901454403","https://openalex.org/W2940960788","https://openalex.org/W2987907651","https://openalex.org/W2995424326","https://openalex.org/W3013666522","https://openalex.org/W3016403159","https://openalex.org/W3018689464","https://openalex.org/W3102946249","https://openalex.org/W3138459719","https://openalex.org/W4290860497"],"related_works":["https://openalex.org/W4296607663","https://openalex.org/W1481101394","https://openalex.org/W4232666937","https://openalex.org/W2766468145","https://openalex.org/W4290679430","https://openalex.org/W4287240968","https://openalex.org/W3102946249","https://openalex.org/W3143952252","https://openalex.org/W4319452872","https://openalex.org/W4379522465"],"abstract_inverted_index":{"We":[0],"report":[1],"on":[2],"intermediate":[3],"results":[4],"of":[5,10,17,48,76,84,95],"--":[6,13],"to":[7,60,86,92],"the":[8,14,45],"best":[9],"our":[11],"knowledge":[12],"first":[15,46],"study":[16],"completeness":[18,49,71],"thresholds":[19,50,72],"for":[20,51,73],"(partially)":[21,61],"bounded":[22,62],"memory":[23,57],"safety":[24,58],"proofs.":[25],"Specifically,":[26],"we":[27,43,65,68,81],"consider":[28],"heap-manipulating":[29],"programs":[30,96],"that":[31,67],"iterate":[32],"over":[33],"arrays":[34],"without":[35],"allocating":[36],"or":[37],"freeing":[38],"memory.":[39],"In":[40],"this":[41,88],"setting,":[42],"present":[44],"notion":[47],"program":[52],"verification":[53],"which":[54],"reduce":[55],"unbounded":[56],"proofs":[59],"ones.":[63],"Moreover,":[64],"demonstrate":[66],"can":[69],"characterise":[70],"simple":[74],"classes":[75,94],"array":[77],"traversing":[78],"programs.":[79],"Finally,":[80],"suggest":[82],"avenues":[83],"research":[85],"scale":[87],"technique":[89],"theoretically,":[90],"i.e.,":[91],"larger":[93],"(heap":[97],"manipulation,":[98],"tree-like":[99],"data":[100],"structures),":[101],"and":[102],"practically":[103],"by":[104],"highlighting":[105],"automation":[106],"opportunities.":[107]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-06T07:47:59.780226","created_date":"2025-10-10T00:00:00"}