{"id":"https://openalex.org/W1991444609","doi":"https://doi.org/10.1145/2402676.2402689","title":"Program proving using intermediate verification languages (IVLs) like boogie and why3","display_name":"Program proving using intermediate verification languages (IVLs) like boogie and why3","publication_year":2012,"publication_date":"2012-11-29","ids":{"openalex":"https://openalex.org/W1991444609","doi":"https://doi.org/10.1145/2402676.2402689","mag":"1991444609"},"language":"en","primary_location":{"id":"doi:10.1145/2402676.2402689","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2402676.2402689","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2012 ACM conference on High integrity language technology","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/A5077941255","display_name":"K. Rustan M. Leino","orcid":"https://orcid.org/0000-0003-2872-8039"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"K. Rustan M. Leino","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5077941255"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.0736245,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"25","last_page":"26"},"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.9998999834060669,"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.9998999834060669,"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.9983000159263611,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9961000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.882858395576477},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.8479616641998291},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.763035774230957},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.5578897595405579},{"id":"https://openalex.org/keywords/front-and-back-ends","display_name":"Front and back ends","score":0.4917614758014679},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.4522250294685364},{"id":"https://openalex.org/keywords/architecture","display_name":"Architecture","score":0.42280927300453186}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.882858395576477},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.8479616641998291},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.763035774230957},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.5578897595405579},{"id":"https://openalex.org/C53016008","wikidata":"https://www.wikidata.org/wiki/Q620167","display_name":"Front and back ends","level":2,"score":0.4917614758014679},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4522250294685364},{"id":"https://openalex.org/C123657996","wikidata":"https://www.wikidata.org/wiki/Q12271","display_name":"Architecture","level":2,"score":0.42280927300453186},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2402676.2402689","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2402676.2402689","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2012 ACM conference on High integrity language technology","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W23483625","https://openalex.org/W41329643","https://openalex.org/W177306140","https://openalex.org/W196033600","https://openalex.org/W1433083390","https://openalex.org/W1532097571","https://openalex.org/W1606177908","https://openalex.org/W1946187443","https://openalex.org/W2096601022","https://openalex.org/W2106339650","https://openalex.org/W6607122937"],"related_works":["https://openalex.org/W4240253816","https://openalex.org/W3096456556","https://openalex.org/W2169584677","https://openalex.org/W2979513934","https://openalex.org/W4232954277","https://openalex.org/W2020341030","https://openalex.org/W3179449891","https://openalex.org/W4231274081","https://openalex.org/W2025879119","https://openalex.org/W4254884584"],"abstract_inverted_index":{"A":[0],"program":[1,20,91],"verifier":[2,21],"is":[3,49,58,82],"a":[4,14,18,27,31],"complex":[5],"piece":[6],"of":[7,17,23,43,65,74,88],"software.":[8],"To":[9],"deal":[10],"with":[11,60,84],"this":[12,47],"complexity,":[13],"standard":[15],"architecture":[16,48],"modern":[19],"consists":[22],"two":[24],"basic":[25],"parts:":[26],"front":[28,56],"end":[29,57,81],"and":[30,78],"back":[32,80],"end,":[33],"separated":[34],"by":[35,46],"an":[36],"intermediate":[37,76,90],"verification":[38],"language":[39],"(IVL).":[40],"The":[41],"separation":[42],"concerns":[44],"obtained":[45],"analogous":[50],"to":[51],"that":[52],"in":[53],"compilers:":[54],"the":[55,63,70,75,79,86,89],"concerned":[59,83],"breaking":[61],"down":[62],"semantics":[64],"given":[66],"source-language":[67],"programs":[68],"into":[69],"more":[71],"primitive":[72],"operations":[73],"language,":[77],"encoding":[85],"meaning":[87],"as":[92],"efficient":[93],"theorem-prover":[94],"input.":[95]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}