{"id":"https://openalex.org/W2463825612","doi":"https://doi.org/10.1016/s1571-0661(04)81044-2","title":"Run-Time Validation of Speculative Optimizations using CVC.","display_name":"Run-Time Validation of Speculative Optimizations using CVC.","publication_year":2003,"publication_date":"2003-10-01","ids":{"openalex":"https://openalex.org/W2463825612","doi":"https://doi.org/10.1016/s1571-0661(04)81044-2","mag":"2463825612"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)81044-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)81044-2","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(04)81044-2","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026961968","display_name":"Clark Barrett","orcid":"https://orcid.org/0000-0002-9522-3084"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Clark Barrett","raw_affiliation_strings":["Department of Computer Science, New York University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, New York University","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046367201","display_name":"Benjamin Goldberg","orcid":"https://orcid.org/0009-0008-5879-0697"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Benjamin Goldberg","raw_affiliation_strings":["Department of Computer Science, New York University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, New York University","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076189272","display_name":"Lenore D. Zuck","orcid":"https://orcid.org/0000-0003-3613-1208"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lenore Zuck","raw_affiliation_strings":["Department of Computer Science, New York University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, New York University","institution_ids":["https://openalex.org/I57206974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5026961968","https://openalex.org/A5046367201","https://openalex.org/A5076189272"],"corresponding_institution_ids":["https://openalex.org/I57206974"],"apc_list":null,"apc_paid":null,"fwci":1.3706,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.858693,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"89","issue":"2","first_page":"89","last_page":"107"},"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.9997000098228455,"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.9997000098228455,"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.9993000030517578,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9988999962806702,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8678182363510132},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.8193415403366089},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6151580810546875},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.5766907334327698},{"id":"https://openalex.org/keywords/loop-optimization","display_name":"Loop optimization","score":0.5545654296875},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.5435346364974976},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5336393117904663},{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.4981832504272461},{"id":"https://openalex.org/keywords/program-optimization","display_name":"Program optimization","score":0.464255154132843},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45325005054473877},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.09676322340965271},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.08717799186706543},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07323357462882996}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8678182363510132},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.8193415403366089},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6151580810546875},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.5766907334327698},{"id":"https://openalex.org/C29331672","wikidata":"https://www.wikidata.org/wiki/Q3354468","display_name":"Loop optimization","level":4,"score":0.5545654296875},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.5435346364974976},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5336393117904663},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.4981832504272461},{"id":"https://openalex.org/C139571649","wikidata":"https://www.wikidata.org/wiki/Q1156793","display_name":"Program optimization","level":3,"score":0.464255154132843},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45325005054473877},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.09676322340965271},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.08717799186706543},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07323357462882996},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s1571-0661(04)81044-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)81044-2","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)81044-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)81044-2","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1500117749","https://openalex.org/W1504751168","https://openalex.org/W1524877046","https://openalex.org/W1531082202","https://openalex.org/W1575176197","https://openalex.org/W1596995840","https://openalex.org/W1980385176","https://openalex.org/W2005873279","https://openalex.org/W2040856861","https://openalex.org/W2069300761","https://openalex.org/W2078429521","https://openalex.org/W2105157994","https://openalex.org/W2112482891","https://openalex.org/W2911450990","https://openalex.org/W4251912342","https://openalex.org/W6630290363","https://openalex.org/W6758773630"],"related_works":["https://openalex.org/W3169195854","https://openalex.org/W2001356339","https://openalex.org/W1877657449","https://openalex.org/W1488300410","https://openalex.org/W2083681681","https://openalex.org/W2017614130","https://openalex.org/W2577630842","https://openalex.org/W4320560513","https://openalex.org/W2956382393","https://openalex.org/W1597127505"],"abstract_inverted_index":{"Translation":[0],"validation":[1,19,75,88,129],"is":[2,36],"an":[3,67,98,119],"approach":[4,89],"for":[5,82],"validating":[6],"the":[7,15,25,32,41,73,94,111,115,127,148],"output":[8],"of":[9,24,40,134,143],"optimizing":[10],"compilers.":[11],"Rather":[12],"than":[13],"verifying":[14],"compiler":[16,26],"itself,":[17],"translation":[18,74],"mandates":[20],"that":[21,31],"every":[22],"run":[23],"generate":[27,79],"a":[28,37,106,132],"formal":[29],"proof":[30],"produced":[33],"target":[34],"code":[35],"correct":[38,53],"implementation":[39],"source":[42],"code.":[43],"Speculative":[44],"loop":[45],"optimizations":[46,49],"are":[47,51],"aggressive":[48],"which":[50,57,97],"only":[52,92],"under":[54,96],"certain":[55],"conditions":[56,95],"cannot":[58],"be":[59],"validated":[60],"at":[61],"compile":[62],"time.":[63],"We":[64],"propose":[65],"using":[66],"automatic":[68],"theorem":[69,149],"prover":[70,150],"together":[71],"with":[72],"framework":[76],"to":[77,108,131],"automatically":[78],"run-time":[80,87,128,144],"tests":[81,145],"such":[83],"speculative":[84,135],"optimizations.":[85],"This":[86],"must":[90],"not":[91],"detect":[93],"optimization":[99,112],"generates":[100],"incorrect":[101,120],"code,":[102],"but":[103],"also":[104],"provide":[105],"way":[107],"recover":[109],"from":[110],"without":[113],"aborting":[114],"program":[116],"or":[117],"producing":[118],"result.":[121],"In":[122],"this":[123],"paper,":[124],"we":[125],"apply":[126],"technique":[130],"class":[133],"reordering":[136],"transformations":[137],"and":[138],"give":[139],"some":[140],"initial":[141],"results":[142],"generated":[146],"by":[147],"CVC.":[151]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}