{"id":"https://openalex.org/W4237606848","doi":"https://doi.org/10.1109/cgo.2019.8661178","title":"Generation of In-Bounds Inputs for Arrays in Memory-Unsafe Languages","display_name":"Generation of In-Bounds Inputs for Arrays in Memory-Unsafe Languages","publication_year":2019,"publication_date":"2019-02-01","ids":{"openalex":"https://openalex.org/W4237606848","doi":"https://doi.org/10.1109/cgo.2019.8661178"},"language":"en","primary_location":{"id":"doi:10.1109/cgo.2019.8661178","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cgo.2019.8661178","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)","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/A5031914137","display_name":"Marcus Rodrigues","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Marcus Rodrigues","raw_affiliation_strings":["UFMG, Belo Horizonte, Brazil"],"affiliations":[{"raw_affiliation_string":"UFMG, Belo Horizonte, Brazil","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033228498","display_name":"Breno Campos Ferreira Guimar\u00e3es","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Breno Guimaraes","raw_affiliation_strings":["UFMG, Belo Horizonte, Brazil"],"affiliations":[{"raw_affiliation_string":"UFMG, Belo Horizonte, Brazil","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078149140","display_name":"Fernando Magno Quint\u00e3o Pereira","orcid":"https://orcid.org/0000-0002-0375-1657"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fernando Magno Quintao Pereira","raw_affiliation_strings":["UFMG, Belo Horizonte, Brazil"],"affiliations":[{"raw_affiliation_string":"UFMG, Belo Horizonte, Brazil","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5031914137"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2793,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.8295305,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2","issue":null,"first_page":"136","last_page":"148"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10260","display_name":"Software Engineering Research","score":0.998199999332428,"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/computer-science","display_name":"Computer science","score":0.7733160257339478},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.540276825428009},{"id":"https://openalex.org/keywords/griffin","display_name":"Griffin","score":0.5267238616943359},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48855194449424744},{"id":"https://openalex.org/keywords/profiling","display_name":"Profiling (computer programming)","score":0.4634307324886322},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.4604294002056122},{"id":"https://openalex.org/keywords/symbolic-execution","display_name":"Symbolic execution","score":0.44256922602653503},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4364437460899353},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3767335116863251},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.37487828731536865},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.360739529132843},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.20927488803863525}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7733160257339478},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.540276825428009},{"id":"https://openalex.org/C2775969163","wikidata":"https://www.wikidata.org/wiki/Q130223","display_name":"Griffin","level":2,"score":0.5267238616943359},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48855194449424744},{"id":"https://openalex.org/C187191949","wikidata":"https://www.wikidata.org/wiki/Q1138496","display_name":"Profiling (computer programming)","level":2,"score":0.4634307324886322},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.4604294002056122},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.44256922602653503},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4364437460899353},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3767335116863251},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.37487828731536865},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.360739529132843},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.20927488803863525},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cgo.2019.8661178","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cgo.2019.8661178","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":77,"referenced_works":["https://openalex.org/W335711039","https://openalex.org/W1483717008","https://openalex.org/W1504751168","https://openalex.org/W1541128807","https://openalex.org/W1553894716","https://openalex.org/W1554233394","https://openalex.org/W1710734607","https://openalex.org/W1874682220","https://openalex.org/W1878544538","https://openalex.org/W1974133806","https://openalex.org/W1979345446","https://openalex.org/W1985774614","https://openalex.org/W2011458734","https://openalex.org/W2012921833","https://openalex.org/W2018131486","https://openalex.org/W2040825319","https://openalex.org/W2043100293","https://openalex.org/W2052172035","https://openalex.org/W2066535672","https://openalex.org/W2076880263","https://openalex.org/W2089011091","https://openalex.org/W2104302557","https://openalex.org/W2107742417","https://openalex.org/W2108149083","https://openalex.org/W2114054012","https://openalex.org/W2114869486","https://openalex.org/W2128330595","https://openalex.org/W2129075596","https://openalex.org/W2130711572","https://openalex.org/W2131135493","https://openalex.org/W2135841285","https://openalex.org/W2144344516","https://openalex.org/W2145458045","https://openalex.org/W2145911832","https://openalex.org/W2149237601","https://openalex.org/W2150205236","https://openalex.org/W2153578567","https://openalex.org/W2155281159","https://openalex.org/W2156858199","https://openalex.org/W2160844513","https://openalex.org/W2169890243","https://openalex.org/W2183017423","https://openalex.org/W2296467253","https://openalex.org/W2323172212","https://openalex.org/W2333976070","https://openalex.org/W2345838529","https://openalex.org/W2461773937","https://openalex.org/W2463553622","https://openalex.org/W2465422497","https://openalex.org/W2596289355","https://openalex.org/W2758020742","https://openalex.org/W2771946537","https://openalex.org/W2780762329","https://openalex.org/W2808641670","https://openalex.org/W2991062394","https://openalex.org/W3149216967","https://openalex.org/W3158747708","https://openalex.org/W3160978791","https://openalex.org/W4210676563","https://openalex.org/W4232666937","https://openalex.org/W4234020632","https://openalex.org/W4235762625","https://openalex.org/W4237492309","https://openalex.org/W4241134169","https://openalex.org/W4242314113","https://openalex.org/W4246166885","https://openalex.org/W4255616683","https://openalex.org/W6611484032","https://openalex.org/W6628849399","https://openalex.org/W6637688222","https://openalex.org/W6639404562","https://openalex.org/W6639560864","https://openalex.org/W6676123549","https://openalex.org/W6686201354","https://openalex.org/W6718562376","https://openalex.org/W6719315682","https://openalex.org/W6746267350"],"related_works":["https://openalex.org/W4245846742","https://openalex.org/W588680182","https://openalex.org/W2093304180","https://openalex.org/W2276557871","https://openalex.org/W3024933229","https://openalex.org/W145413986","https://openalex.org/W2414931473","https://openalex.org/W3124843757","https://openalex.org/W2038894842","https://openalex.org/W2611230223"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,60,82,101,116],"technique":[4],"to":[5,37,53,79,84],"generate":[6],"in-bounds":[7],"inputs":[8],"for":[9],"arrays":[10,64],"used":[11,52,65],"in":[12,28],"memory-unsafe":[13],"programming":[14],"languages,":[15],"such":[16],"as":[17],"C":[18,30,86],"and":[19,62,106],"C++.":[20],"We":[21,95],"show":[22,45,96,108],"that":[23,34,67],"most":[24],"memory":[25],"indexation":[26],"found":[27],"actual":[29],"programs":[31,87],"follows":[32],"patterns":[33],"are":[35],"easy":[36],"analyze":[38],"statically.":[39],"Based":[40],"on":[41],"this":[42],"observation,":[43],"we":[44,76,107],"how":[46,97,109],"symbolic":[47],"range":[48],"analysis":[49],"can":[50],"be":[51,92],"establish":[54],"contracts":[55],"between":[56],"the":[57,63,71],"arguments":[58],"of":[59,73,119],"function":[61],"within":[66],"function.":[68],"To":[69],"demonstrate":[70],"effectiveness":[72],"our":[74],"ideas,":[75],"use":[77],"them":[78],"implement":[80],"Griffin-TG,":[81],"tool":[83],"stress-test":[85],"whose":[88],"source":[89],"code":[90],"might":[91],"partially":[93],"available.":[94],"Griffin-TG":[98],"improves":[99],"Aprof,":[100],"well-known":[102],"algorithmic":[103],"profiling":[104],"tool,":[105],"it":[110],"lets":[111],"us":[112],"enrich":[113],"PolyBench":[114],"with":[115],"large":[117],"set":[118],"new":[120],"inputs.":[121]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}