{"id":"https://openalex.org/W4233804448","doi":"https://doi.org/10.1145/1108792.1108813","title":"Weakest-precondition of unstructured programs","display_name":"Weakest-precondition of unstructured programs","publication_year":2005,"publication_date":"2005-09-05","ids":{"openalex":"https://openalex.org/W4233804448","doi":"https://doi.org/10.1145/1108792.1108813"},"language":"en","primary_location":{"id":"doi:10.1145/1108792.1108813","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1108792.1108813","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering","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/A5111905597","display_name":"Mike Barnett","orcid":null},"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":false,"raw_author_name":"Mike Barnett","raw_affiliation_strings":["Microsoft Research, Redmond, WA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","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":false,"raw_author_name":"K. Rustan M. Leino","raw_affiliation_strings":["Microsoft Research, Redmond, WA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.6964,"has_fulltext":false,"cited_by_count":119,"citation_normalized_percentile":{"value":0.932935,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"82","last_page":"87"},"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.9997000098228455,"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.9997000098228455,"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.9997000098228455,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9995999932289124,"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/precondition","display_name":"Precondition","score":0.9354830384254456},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.8421307802200317},{"id":"https://openalex.org/keywords/expression","display_name":"Expression (computer science)","score":0.7427629232406616},{"id":"https://openalex.org/keywords/predicate-transformer-semantics","display_name":"Predicate transformer semantics","score":0.7025551795959473},{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.6484702825546265},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6356514692306519},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5417159199714661},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3987148404121399},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3968009054660797},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3691582679748535},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26788562536239624},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.15217071771621704},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.11517199873924255}],"concepts":[{"id":"https://openalex.org/C192465680","wikidata":"https://www.wikidata.org/wiki/Q1413450","display_name":"Precondition","level":2,"score":0.9354830384254456},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.8421307802200317},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.7427629232406616},{"id":"https://openalex.org/C30128091","wikidata":"https://www.wikidata.org/wiki/Q291929","display_name":"Predicate transformer semantics","level":4,"score":0.7025551795959473},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.6484702825546265},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6356514692306519},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5417159199714661},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3987148404121399},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3968009054660797},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3691582679748535},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26788562536239624},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.15217071771621704},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.11517199873924255},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.0},{"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.1145/1108792.1108813","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1108792.1108813","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1486696980","https://openalex.org/W1491178396","https://openalex.org/W1959256509","https://openalex.org/W1982205631","https://openalex.org/W1992431017","https://openalex.org/W1993836075","https://openalex.org/W2017179163","https://openalex.org/W2046213250","https://openalex.org/W2103953153","https://openalex.org/W2123115736","https://openalex.org/W2164419371"],"related_works":["https://openalex.org/W4318144845","https://openalex.org/W1981930797","https://openalex.org/W33800742","https://openalex.org/W2076584380","https://openalex.org/W2034137122","https://openalex.org/W4246350535","https://openalex.org/W3083050876","https://openalex.org/W2152492994","https://openalex.org/W4233804448","https://openalex.org/W1969211016"],"abstract_inverted_index":{"Program":[0],"verification":[1],"systems":[2],"typically":[3],"transform":[4],"a":[5,8,16,53,95],"program":[6,28,47,60,106],"into":[7],"logical":[9,20,54,123],"expression":[10,21,55,124],"which":[11],"is":[12,39,48,61,108,118],"then":[13,45],"fed":[14],"to":[15,30,41,68,88,133],"theorem":[17,37,90,130],"prover.":[18,91],"The":[19,116],"represents":[22],"the":[23,27,36,43,46,73,77,81,84,89,100,112,121,129,135],"weakest":[24,101],"precondition":[25,102],"of":[26,76,80,83,103,114],"relative":[29],"its":[31],"specification;":[32],"when":[33],"(and":[34],"if!)":[35],"prover":[38,131],"able":[40],"prove":[42],"expression,":[44],"considered":[49],"correct.":[50],"Computing":[51],"such":[52],"for":[56,98,128],"an":[57,104],"imperative,":[58],"structured":[59],"straightforward,":[62],"although":[63],"there":[64],"are":[65],"issues":[66],"having":[67],"do":[69],"with":[70,86],"loops":[71],"and":[72,79,120],"efficiency":[74],"both":[75],"computation":[78,117],"complexity":[82],"formula":[85],"respect":[87],"This":[92],"paper":[93],"presents":[94],"novel":[96],"approach":[97],"computing":[99],"unstructured":[105],"that":[107],"sound":[109],"even":[110],"in":[111],"presence":[113],"loops.":[115],"efficient":[119],"resulting":[122],"provides":[125],"more":[126],"leeway":[127],"efficiently":[132],"attack":[134],"proof.":[136]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}