{"id":"https://openalex.org/W1989792478","doi":"https://doi.org/10.1145/2627373.2627388","title":"Bounds Checking","display_name":"Bounds Checking","publication_year":2014,"publication_date":"2014-06-09","ids":{"openalex":"https://openalex.org/W1989792478","doi":"https://doi.org/10.1145/2627373.2627388","mag":"1989792478"},"language":"en","primary_location":{"id":"doi:10.1145/2627373.2627388","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2627373.2627388","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming","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/A5034400099","display_name":"Troels Henriksen","orcid":"https://orcid.org/0000-0002-1195-9722"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Troels Henriksen","raw_affiliation_strings":["HIPERFIT, Department of Computer Science, University of Copenhagen (DIKU)","HIPERFIT, Department of Computer Science, University of Copenhagen (DIKU)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"HIPERFIT, Department of Computer Science, University of Copenhagen (DIKU)","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"HIPERFIT, Department of Computer Science, University of Copenhagen (DIKU)#TAB#","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080735312","display_name":"Cosmin E. Oancea","orcid":"https://orcid.org/0000-0001-5421-6876"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Cosmin E. Oancea","raw_affiliation_strings":["HIPERFIT, Department of Computer Science, University of Copenhagen (DIKU)","HIPERFIT, Department of Computer Science, University of Copenhagen (DIKU)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"HIPERFIT, Department of Computer Science, University of Copenhagen (DIKU)","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"HIPERFIT, Department of Computer Science, University of Copenhagen (DIKU)#TAB#","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.652,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.94827573,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"88","last_page":"94"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9991999864578247,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9991999864578247,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9979000091552734,"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/T10142","display_name":"Formal Methods in Verification","score":0.9957000017166138,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8907434344291687},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6956268548965454},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6724089980125427},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.6705954074859619},{"id":"https://openalex.org/keywords/compile-time","display_name":"Compile time","score":0.5618086457252502},{"id":"https://openalex.org/keywords/runtime-system","display_name":"Runtime system","score":0.5305840373039246},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.5179359316825867},{"id":"https://openalex.org/keywords/type-inference","display_name":"Type inference","score":0.5010209083557129},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.47087037563323975},{"id":"https://openalex.org/keywords/static-analysis","display_name":"Static analysis","score":0.45988237857818604},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.4590410888195038},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.4534485638141632},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44834771752357483},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4461204707622528},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.43970271944999695},{"id":"https://openalex.org/keywords/just-in-time-compilation","display_name":"Just-in-time compilation","score":0.4305607080459595},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.391539990901947},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11324968934059143}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8907434344291687},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6956268548965454},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6724089980125427},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.6705954074859619},{"id":"https://openalex.org/C200833197","wikidata":"https://www.wikidata.org/wiki/Q333707","display_name":"Compile time","level":3,"score":0.5618086457252502},{"id":"https://openalex.org/C2780870223","wikidata":"https://www.wikidata.org/wiki/Q1004415","display_name":"Runtime system","level":2,"score":0.5305840373039246},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.5179359316825867},{"id":"https://openalex.org/C198370458","wikidata":"https://www.wikidata.org/wiki/Q586459","display_name":"Type inference","level":3,"score":0.5010209083557129},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.47087037563323975},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.45988237857818604},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.4590410888195038},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.4534485638141632},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44834771752357483},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4461204707622528},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.43970271944999695},{"id":"https://openalex.org/C76782552","wikidata":"https://www.wikidata.org/wiki/Q110546","display_name":"Just-in-time compilation","level":3,"score":0.4305607080459595},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.391539990901947},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11324968934059143},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2627373.2627388","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2627373.2627388","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/68b96754-ead9-48a1-81dc-f8d2093a7ef1","is_oa":false,"landing_page_url":"https://curis.ku.dk/portal/da/publications/bounds-checking(68b96754-ead9-48a1-81dc-f8d2093a7ef1).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Henriksen , T & Oancea , C E 2014 , Bounds checking : an instance of hybrid analysis . in Proceedings of ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming . Association for Computing Machinery , pp. 88-94 , ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming 2014 , Edinburgh , United Kingdom , 12/06/2014 . https://doi.org/10.1145/2627373.2627388","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.atira.dk:publications/68b96754-ead9-48a1-81dc-f8d2093a7ef1","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/68b96754-ead9-48a1-81dc-f8d2093a7ef1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Henriksen , T & Oancea , C E 2014 , Bounds checking : an instance of hybrid analysis . in Proceedings of ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming . Association for Computing Machinery , pp. 88-94 , ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming 2014 , Edinburgh , United Kingdom , 12/06/2014 . https://doi.org/10.1145/2627373.2627388","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320335354","display_name":"Strategic Research Council","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W58073954","https://openalex.org/W1555216982","https://openalex.org/W1569496172","https://openalex.org/W1965122136","https://openalex.org/W1983895125","https://openalex.org/W1984303163","https://openalex.org/W1997744477","https://openalex.org/W2002871272","https://openalex.org/W2017274604","https://openalex.org/W2024914463","https://openalex.org/W2034591560","https://openalex.org/W2091722458","https://openalex.org/W2096862145","https://openalex.org/W2100232637","https://openalex.org/W2108149083","https://openalex.org/W2143588523","https://openalex.org/W2278540936","https://openalex.org/W2436525433","https://openalex.org/W2563636221","https://openalex.org/W3005174853","https://openalex.org/W3015747443","https://openalex.org/W3102045914"],"related_works":["https://openalex.org/W2030281933","https://openalex.org/W3138455083","https://openalex.org/W4387773832","https://openalex.org/W4379521304","https://openalex.org/W2099479461","https://openalex.org/W2071795976","https://openalex.org/W2004337747","https://openalex.org/W2898389076","https://openalex.org/W2146942245","https://openalex.org/W2527038815"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3,22],"analysis":[4,104],"for":[5],"bounds":[6,72],"checking":[7,13,73,77],"of":[8,21,32,35,58,61,109,140,157],"array":[9],"subscripts":[10],"that":[11,64,95,151,153],"lifts":[12],"assertions":[14],"to":[15,47,52],"program":[16],"level":[17],"under":[18],"the":[19,30,33,38,41,66,71,98,103,106,125,148,154],"form":[20],"arbitrarily-complex":[23],"predicate":[24,39],"(inspector),":[25],"whose":[26],"runtime":[27,85,155],"evaluation":[28,86,139],"guards":[29],"execution":[31],"code":[34],"interest.":[36],"Separating":[37],"from":[40,147],"computation":[42],"makes":[43],"it":[44,51],"more":[45],"amenable":[46],"optimization,":[48],"and":[49,84,92,122],"allows":[50],"be":[53],"split":[54],"into":[55],"a":[56,111,130,137],"cascade":[57],"sufficient":[59],"conditions":[60],"increasing":[62],"complexity":[63],"optimizes":[65],"common-inspection":[67],"path.":[68],"While":[69],"synthesizing":[70],"invariant":[74],"resembles":[75],"type":[76],"techniques,":[78],"we":[79,135],"rely":[80],"on":[81,119,143],"compiler":[82],"simplification":[83],"rather":[87],"than":[88],"employing":[89],"complex":[90],"inference":[91],"annotation":[93],"systems":[94],"might":[96],"discourage":[97],"non-specialist":[99],"user.":[100],"We":[101],"integrate":[102],"in":[105],"compiler's":[107],"repertoire":[108],"Futhark:":[110],"purely-functional":[112],"core":[113],"language":[114,127],"supporting":[115],"map-reduce":[116],"nested":[117],"parallelism":[118],"regular":[120],"arrays,":[121],"show":[123],"how":[124],"high-level":[126],"invariants":[128],"enable":[129],"relatively":[131],"straightforward":[132],"analysis.":[133],"Finally,":[134],"report":[136],"qualitative":[138],"our":[141],"technique":[142],"three":[144],"real-world":[145],"applications":[146],"financial":[149],"domain":[150],"indicates":[152],"overhead":[156],"predicates":[158],"is":[159],"negligible.":[160]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}