{"id":"https://openalex.org/W2156745311","doi":"https://doi.org/10.1145/2254064.2254086","title":"Proving acceptability properties of relaxed nondeterministic approximate programs","display_name":"Proving acceptability properties of relaxed nondeterministic approximate programs","publication_year":2012,"publication_date":"2012-06-11","ids":{"openalex":"https://openalex.org/W2156745311","doi":"https://doi.org/10.1145/2254064.2254086","mag":"2156745311"},"language":"en","primary_location":{"id":"doi:10.1145/2254064.2254086","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2254064.2254086","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/72437","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091194125","display_name":"Michael Carbin","orcid":"https://orcid.org/0000-0002-6928-0456"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Carbin","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge , MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge , MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028990746","display_name":"Deokhwan Kim","orcid":"https://orcid.org/0000-0002-0968-3827"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Deokhwan Kim","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057462458","display_name":"Sa\u0161a Misailov\u00edc","orcid":"https://orcid.org/0000-0001-7319-8845"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sasa Misailovic","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045127387","display_name":"Martin Rinard","orcid":"https://orcid.org/0000-0001-8095-8523"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin C. Rinard","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5091194125"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":11.7108,"has_fulltext":false,"cited_by_count":104,"citation_normalized_percentile":{"value":0.98959841,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"169","last_page":"180"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9984999895095825,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9984999895095825,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9944000244140625,"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.9926000237464905,"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/memoization","display_name":"Memoization","score":0.8336180448532104},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7688676118850708},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7561036944389343},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.511875569820404},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.5034591555595398},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.49035000801086426},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.45247355103492737},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.45063892006874084},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.44867607951164246},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34473294019699097},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.332460880279541},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.31330612301826477},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13519245386123657},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.11349502205848694},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09619632363319397}],"concepts":[{"id":"https://openalex.org/C79516417","wikidata":"https://www.wikidata.org/wiki/Q1376168","display_name":"Memoization","level":4,"score":0.8336180448532104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7688676118850708},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7561036944389343},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.511875569820404},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.5034591555595398},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.49035000801086426},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.45247355103492737},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.45063892006874084},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.44867607951164246},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34473294019699097},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.332460880279541},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.31330612301826477},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13519245386123657},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.11349502205848694},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09619632363319397},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C42560504","wikidata":"https://www.wikidata.org/wiki/Q15419395","display_name":"Top-down parsing","level":3,"score":0.0},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2254064.2254086","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2254064.2254086","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.252.4124","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.252.4124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/rinard/paper/pldi12.relaxed.pdf","raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/72437","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/72437","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/72437","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/72437","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","score":0.4099999964237213,"display_name":"Partnerships for the goals"}],"awards":[{"id":"https://openalex.org/G142271431","display_name":null,"funder_award_id":"0835652","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2439932051","display_name":"CPA-CPL: Automatic Parallelization Using Semantic Commutativity Analysis","funder_award_id":"0811397","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3867501713","display_name":"SHF: Medium: Exposing and Eliminating Errors at Component Boundaries","funder_award_id":"0905244","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3921328034","display_name":"EAGER:  Profile and Transformation Driven Automatic Parallelization with Interactive Reports","funder_award_id":"1036241","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4713059963","display_name":null,"funder_award_id":"FA8750","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G5723975421","display_name":null,"funder_award_id":"DE-SC0005288","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G6133222808","display_name":null,"funder_award_id":"FA8750-12-2-0110","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G6286855260","display_name":null,"funder_award_id":"FA8650-11-C-7192","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W57185801","https://openalex.org/W1492552760","https://openalex.org/W1517417277","https://openalex.org/W1547786892","https://openalex.org/W1774384314","https://openalex.org/W1791348790","https://openalex.org/W1972999341","https://openalex.org/W2000873501","https://openalex.org/W2011444209","https://openalex.org/W2014620461","https://openalex.org/W2018408172","https://openalex.org/W2069300761","https://openalex.org/W2081942292","https://openalex.org/W2097243222","https://openalex.org/W2100877271","https://openalex.org/W2107220315","https://openalex.org/W2111444234","https://openalex.org/W2114703523","https://openalex.org/W2115974895","https://openalex.org/W2121753233","https://openalex.org/W2123468241","https://openalex.org/W2128932642","https://openalex.org/W2142883190","https://openalex.org/W2143283746","https://openalex.org/W2149996206","https://openalex.org/W2156680804","https://openalex.org/W2165247635","https://openalex.org/W2165448367","https://openalex.org/W2165964040","https://openalex.org/W2167505017","https://openalex.org/W2168617729","https://openalex.org/W2170239024","https://openalex.org/W2295387843","https://openalex.org/W2911450990","https://openalex.org/W2987907651","https://openalex.org/W3145555275","https://openalex.org/W3146075203","https://openalex.org/W4239588330","https://openalex.org/W4240237526","https://openalex.org/W4243963980","https://openalex.org/W6667847518"],"related_works":["https://openalex.org/W2966056201","https://openalex.org/W2182406401","https://openalex.org/W2772415251","https://openalex.org/W2971785569","https://openalex.org/W2610985003","https://openalex.org/W2583648466","https://openalex.org/W2810599929","https://openalex.org/W2762390662","https://openalex.org/W2038241762","https://openalex.org/W1558294391"],"abstract_inverted_index":{"Approximate":[0],"program":[1],"transformations":[2],"such":[3],"as":[4],"skipping":[5],"tasks":[6],"[29,":[7],"30],":[8],"loop":[9],"perforation":[10],"[21,":[11],"22,":[12],"35],":[13],"reduction":[14],"sampling":[15],"[38],":[16],"multiple":[17],"selectable":[18],"implementations":[19],"[3,":[20],"4,":[21],"16,":[22],"38],":[23],"dynamic":[24],"knobs":[25],"[16],":[26],"synchronization":[27],"elimination":[28],"[20,":[29],"32],":[30],"approximate":[31,35],"function":[32],"memoization":[33],"[11],and":[34],"data":[36],"types":[37],"[34]":[38],"produce":[39],"programs":[40,59],"that":[41,78],"can":[42],"execute":[43],"at":[44],"a":[45],"variety":[46],"of":[47,66],"points":[48],"in":[49],"an":[50],"underlying":[51],"performance":[52,71],"versus":[53],"accuracy":[54,65],"tradeoff":[55],"space.":[56],"These":[57],"transformed":[58],"have":[60],"the":[61],"ability":[62],"to":[63],"trade":[64],"their":[67,80],"results":[68],"for":[69],"increased":[70],"by":[72],"dynamically":[73],"and":[74],"nondeterministically":[75],"modifying":[76],"variables":[77],"control":[79],"execution.":[81]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":18},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}