{"id":"https://openalex.org/W2767258384","doi":"https://doi.org/10.1145/3158141","title":"Refinement reflection: complete verification with SMT","display_name":"Refinement reflection: complete verification with SMT","publication_year":2017,"publication_date":"2017-12-27","ids":{"openalex":"https://openalex.org/W2767258384","doi":"https://doi.org/10.1145/3158141","mag":"2767258384"},"language":"en","primary_location":{"id":"doi:10.1145/3158141","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3158141","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3158141?download=true","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3158141?download=true","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Niki Vazou","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Niki Vazou","raw_affiliation_strings":["University of Maryland, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Anish Tondwalkar","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anish Tondwalkar","raw_affiliation_strings":["University of California at San Diego, USA"],"affiliations":[{"raw_affiliation_string":"University of California at San Diego, USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Vikraman Choudhury","orcid":null},"institutions":[{"id":"https://openalex.org/I592451","display_name":"Indiana University","ror":"https://ror.org/01kg8sb98","country_code":"US","type":"education","lineage":["https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vikraman Choudhury","raw_affiliation_strings":["Indiana University, USA"],"affiliations":[{"raw_affiliation_string":"Indiana University, USA","institution_ids":["https://openalex.org/I592451"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Ryan G. Scott","orcid":null},"institutions":[{"id":"https://openalex.org/I592451","display_name":"Indiana University","ror":"https://ror.org/01kg8sb98","country_code":"US","type":"education","lineage":["https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ryan G. Scott","raw_affiliation_strings":["Indiana University, USA"],"affiliations":[{"raw_affiliation_string":"Indiana University, USA","institution_ids":["https://openalex.org/I592451"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Ryan R. Newton","orcid":null},"institutions":[{"id":"https://openalex.org/I592451","display_name":"Indiana University","ror":"https://ror.org/01kg8sb98","country_code":"US","type":"education","lineage":["https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ryan R. Newton","raw_affiliation_strings":["Indiana University, USA"],"affiliations":[{"raw_affiliation_string":"Indiana University, USA","institution_ids":["https://openalex.org/I592451"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Philip Wadler","orcid":null},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Philip Wadler","raw_affiliation_strings":["University of Edinburgh, UK / Input Output HK, UK"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, UK / Input Output HK, UK","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":null,"display_name":"Ranjit Jhala","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ranjit Jhala","raw_affiliation_strings":["University of California at San Diego, USA"],"affiliations":[{"raw_affiliation_string":"University of California at San Diego, USA","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":7,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":3.3232,"has_fulltext":true,"cited_by_count":42,"citation_normalized_percentile":{"value":0.93954323,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":"2","issue":"POPL","first_page":"1","last_page":"31"},"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.8313999772071838,"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.8313999772071838,"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.12919999659061432,"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/T11424","display_name":"Security and Verification in Computing","score":0.01549999974668026,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/haskell","display_name":"Haskell","score":0.738099992275238},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7200999855995178},{"id":"https://openalex.org/keywords/reflection","display_name":"Reflection (computer programming)","score":0.6543999910354614},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.6258000135421753},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.5529999732971191},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5407999753952026},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5336999893188477},{"id":"https://openalex.org/keywords/monad","display_name":"Monad (category theory)","score":0.47440001368522644},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.361299991607666},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.359499990940094}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8126999735832214},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7828999757766724},{"id":"https://openalex.org/C2780624054","wikidata":"https://www.wikidata.org/wiki/Q34010","display_name":"Haskell","level":3,"score":0.738099992275238},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7200999855995178},{"id":"https://openalex.org/C65682993","wikidata":"https://www.wikidata.org/wiki/Q1056451","display_name":"Reflection (computer programming)","level":2,"score":0.6543999910354614},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.6258000135421753},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5529999732971191},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5407999753952026},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5336999893188477},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4772000014781952},{"id":"https://openalex.org/C33959348","wikidata":"https://www.wikidata.org/wiki/Q1630568","display_name":"Monad (category theory)","level":3,"score":0.47440001368522644},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3621000051498413},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.361299991607666},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.359499990940094},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.34279999136924744},{"id":"https://openalex.org/C159423971","wikidata":"https://www.wikidata.org/wiki/Q177251","display_name":"Associative property","level":2,"score":0.34209999442100525},{"id":"https://openalex.org/C65880906","wikidata":"https://www.wikidata.org/wiki/Q1771121","display_name":"Sequent calculus","level":3,"score":0.3411000072956085},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3409000039100647},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.32829999923706055},{"id":"https://openalex.org/C2780432614","wikidata":"https://www.wikidata.org/wiki/Q864213","display_name":"Conservative extension","level":2,"score":0.3237999975681305},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.3149999976158142},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.31200000643730164},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.3050000071525574},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.29899999499320984},{"id":"https://openalex.org/C35390924","wikidata":"https://www.wikidata.org/wiki/Q661075","display_name":"Metaprogramming","level":2,"score":0.2957000136375427},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.2946999967098236},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.28519999980926514},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.28139999508857727},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.28049999475479126},{"id":"https://openalex.org/C88482812","wikidata":"https://www.wikidata.org/wiki/Q6453666","display_name":"Modular programming","level":2,"score":0.2702000141143799},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.27000001072883606},{"id":"https://openalex.org/C104949639","wikidata":"https://www.wikidata.org/wiki/Q1375924","display_name":"Hoare logic","level":3,"score":0.26829999685287476},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.2660999894142151},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.25850000977516174},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.2572000026702881},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.2556999921798706},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.25060001015663147},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3158141","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3158141","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3158141?download=true","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1711.03842","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1711.03842","pdf_url":"https://arxiv.org/pdf/1711.03842","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pure.ed.ac.uk:publications/db053eee-273b-40b1-aab8-7337384b77f1","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/db053eee-273b-40b1-aab8-7337384b77f1","pdf_url":"https://www.research.ed.ac.uk/en/publications/db053eee-273b-40b1-aab8-7337384b77f1","source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Vazou, N, Tondwalkar, A, Choudhury, V, Scott, R G, Newton, R R, Wadler, P & Jhala, R 2017, 'Refinement Reflection : Complete Verification with SMT', Proceedings of the ACM on Programming Languages, vol. 2. https://doi.org/10.1145/3158141","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1145/3158141","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3158141","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3158141?download=true","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1732280479","display_name":"TWC: Large: Collaborative: The Science and Applications of Crypto-Currency","funder_award_id":"1518765","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1798638720","display_name":"From Data Types to Session Types---A Basis for Concurrency and Distribution","funder_award_id":"EP/K034413/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3330119427","display_name":null,"funder_award_id":"EPSRC","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3743283427","display_name":"TWC: Small: New Foundations for Secure JavaScript","funder_award_id":"1223850","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5278361414","display_name":null,"funder_award_id":"CCF-1618756, CNS-1518765, CCF-1518844, CCF-1422471, CCF-1223850, and CCF-1218344","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6268822357","display_name":null,"funder_award_id":"1618756","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6537961175","display_name":null,"funder_award_id":"1518844","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6644523292","display_name":null,"funder_award_id":"CCF-121834","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7918631928","display_name":null,"funder_award_id":"EP/K034413/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7924197546","display_name":null,"funder_award_id":"CCF-1518844","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8154076970","display_name":"SHF: Small: Next-Generation, Dependent Type-based Software Model Checking for C","funder_award_id":"1218344","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8826023445","display_name":"SHF: Small: Refinement Types For Verified Web Frameworks and Applications","funder_award_id":"1422471","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/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2767258384.pdf","grobid_xml":"https://content.openalex.org/works/W2767258384.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W100631053","https://openalex.org/W197730338","https://openalex.org/W1502282368","https://openalex.org/W1674186056","https://openalex.org/W1874682220","https://openalex.org/W1996164638","https://openalex.org/W2024914463","https://openalex.org/W2027584005","https://openalex.org/W2034711041","https://openalex.org/W2034810774","https://openalex.org/W2043100293","https://openalex.org/W2043416466","https://openalex.org/W2045900383","https://openalex.org/W2048536148","https://openalex.org/W2074077414","https://openalex.org/W2077881577","https://openalex.org/W2084143659","https://openalex.org/W2104815907","https://openalex.org/W2114092850","https://openalex.org/W2120172501","https://openalex.org/W2125995229","https://openalex.org/W2128963089","https://openalex.org/W2130427425","https://openalex.org/W2136758562","https://openalex.org/W2144160229","https://openalex.org/W2146306932","https://openalex.org/W2155762556","https://openalex.org/W2161011930","https://openalex.org/W2162315884","https://openalex.org/W2186501980","https://openalex.org/W2215196193","https://openalex.org/W2267469130","https://openalex.org/W2273111921","https://openalex.org/W2295923951","https://openalex.org/W2340618214","https://openalex.org/W2418260908","https://openalex.org/W2491721896","https://openalex.org/W3138380317","https://openalex.org/W4244488020","https://openalex.org/W4250846042"],"related_works":["https://openalex.org/W2099473324","https://openalex.org/W3103850025","https://openalex.org/W99812881","https://openalex.org/W2965966430","https://openalex.org/W4287727028","https://openalex.org/W3038540829","https://openalex.org/W2752785089","https://openalex.org/W2973834791","https://openalex.org/W3125985216","https://openalex.org/W2898994572"],"abstract_inverted_index":{"We":[0,122],"introduce":[1,99],"Refinement":[2],"Reflection":[3,56],",":[4],"a":[5,22,32,49,100],"new":[6],"framework":[7],"for":[8,178],"building":[9],"SMT-based":[10],"deductive":[11],"verifiers.":[12],"The":[13],"key":[14,149],"idea":[15],"is":[16,42],"to":[17,60,75,117,132,153,162],"reflect":[18],"the":[19,26,37,39,45,58,82,90,135,140,155,164],"code":[20],"implementing":[21],"user-defined":[23],"function":[24,40],"into":[25],"function\u2019s":[27],"(output)":[28],"refinement":[29],"type.":[30],"As":[31],"consequence,":[33],"at":[34],"uses":[35,109],"of":[36,64,92,139],"function,":[38],"definition":[41],"instantiated":[43],"in":[44,48,126],"SMT":[46],"logic":[47],"precise":[50],"fashion":[51],"that":[52,87,108,134,167,175],"permits":[53,89],"decidable":[54],"verification.":[55],"allows":[57],"user":[59],"write":[61],"equational":[62,120],"proofs":[63],"programs":[65,70],"just":[66],"by":[67,105],"writing":[68],"other":[69],"using":[71],"pattern-matching":[72],"and":[73,78,114,129,144,158,173],"recursion":[74],"perform":[76],"case-splitting":[77],"induction.":[79],"Thus,":[80],"via":[81],"propositions-as-types":[83],"principle,":[84],"we":[85,98],"show":[86],"reflection":[88,125,161],"specification":[91],"arbitrary":[93],"functional":[94],"correctness":[95],"properties.":[96],"Finally,":[97],"proof-search":[101],"algorithm":[102],"called":[103],"Proof":[104],"Logical":[106],"Evaluation":[107],"techniques":[110],"from":[111],"model":[112],"checking":[113],"abstract":[115],"interpretation,":[116],"completely":[118],"automate":[119],"reasoning.":[121],"have":[123,159],"implemented":[124],"Liquid":[127],"Haskell":[128],"used":[130,137,160],"it":[131],"verify":[133],"widely":[136],"instances":[138],"Monoid,":[141],"Applicative,":[142],"Functor,":[143],"Monad":[145],"typeclasses":[146],"actually":[147,168],"satisfy":[148],"algebraic":[150],"laws":[151],"required":[152],"make":[154],"clients":[156],"safe,":[157],"build":[163],"first":[165],"library":[166],"verifies":[169],"assumptions":[170],"about":[171],"associativity":[172],"ordering":[174],"are":[176],"crucial":[177],"safe":[179],"deterministic":[180],"parallelism.":[181]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":6}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2017-11-17T00:00:00"}