{"id":"https://openalex.org/W1967019306","doi":"https://doi.org/10.1145/2034574.2034828","title":"Characteristic formulae for the verification of imperative programs","display_name":"Characteristic formulae for the verification of imperative programs","publication_year":2011,"publication_date":"2011-09-18","ids":{"openalex":"https://openalex.org/W1967019306","doi":"https://doi.org/10.1145/2034574.2034828","mag":"1967019306"},"language":"en","primary_location":{"id":"doi:10.1145/2034574.2034828","doi":"https://doi.org/10.1145/2034574.2034828","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2034574.2034828","pdf_url":null,"source":{"id":"https://openalex.org/S148324379","display_name":"ACM SIGPLAN Notices","issn_l":"0362-1340","issn":["0362-1340","1558-1160"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGPLAN Notices","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5025324126","display_name":"Arthur Chargu\u00e9raud","orcid":"https://orcid.org/0000-0001-7764-4507","observed_orcids":["https://orcid.org/0000-0001-7764-4507"]},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Arthur Chargu\u00e9raud","raw_affiliation_strings":["Max Planck Institute for Software Systems, Kaiserslautern, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Software Systems, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025324126"],"corresponding_institution_ids":["https://openalex.org/I149899117","https://openalex.org/I4210121786"],"apc_list":null,"apc_paid":null,"fwci":10.5226,"has_fulltext":false,"cited_by_count":69,"citation_normalized_percentile":{"value":0.97951212,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":"46","issue":"9","first_page":"418","last_page":"430"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":1.0,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":9.999999747378752e-05,"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/T10533","display_name":"Teaching and Learning Programming","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/program-verification","display_name":"program verification","score":0.8019999861717224},{"id":"https://openalex.org/keywords/imperative-programs","display_name":"imperative programs","score":0.9850000143051147},{"id":"https://openalex.org/keywords/separation-logic","display_name":"separation logic","score":0.7429999709129333},{"id":"https://openalex.org/keywords/frame-rule","display_name":"frame rule","score":0.9919999837875366},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"higher-order logic","score":0.824999988079071},{"id":"https://openalex.org/keywords/coq-proof-assistant","display_name":"Coq","score":0.8759999871253967},{"id":"https://openalex.org/keywords/caml","display_name":"CAML","score":0.8270000219345093}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8164846897125244},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7439749836921692},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.5337477922439575},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4998128414154053},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4483078718185425},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.43564337491989136},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.4206116795539856},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36190900206565857},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3292927145957947},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16525408625602722},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.15346527099609375},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2034574.2034828","doi":"https://doi.org/10.1145/2034574.2034828","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2034574.2034828","pdf_url":null,"source":{"id":"https://openalex.org/S148324379","display_name":"ACM SIGPLAN Notices","issn_l":"0362-1340","issn":["0362-1340","1558-1160"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGPLAN Notices","raw_type":"journal-article"},{"id":"pmh:oai:escidoc.org:escidoc:2173340","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0028-8B6F-2","pdf_url":null,"source":{"id":"https://openalex.org/S7407052962","display_name":"Max Planck Digital Library","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4210088280","host_organization_name":"Max Planck Digital Library","host_organization_lineage":["https://openalex.org/I4210088280"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.mpg.de:item_2173340","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0028-8B6F-2","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ICFP\u201911 : Proceedings of the 2011 ACM SIGPLAN International Conference on Functional Programming","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W169519546","https://openalex.org/W1445870142","https://openalex.org/W1495368328","https://openalex.org/W1504407915","https://openalex.org/W1537084112","https://openalex.org/W1554068457","https://openalex.org/W1562865234","https://openalex.org/W1588363303","https://openalex.org/W1589421353","https://openalex.org/W1590844387","https://openalex.org/W1601157167","https://openalex.org/W1867526098","https://openalex.org/W1965109565","https://openalex.org/W1968829301","https://openalex.org/W1971616901","https://openalex.org/W1990409169","https://openalex.org/W2011270512","https://openalex.org/W2013532785","https://openalex.org/W2068352674","https://openalex.org/W2069300761","https://openalex.org/W2071542068","https://openalex.org/W2073904768","https://openalex.org/W2105045857","https://openalex.org/W2124461564","https://openalex.org/W2129671708","https://openalex.org/W2129695855","https://openalex.org/W2130853806","https://openalex.org/W2136310957","https://openalex.org/W2137628566","https://openalex.org/W2141236940","https://openalex.org/W2151131364","https://openalex.org/W2164078934","https://openalex.org/W2165970356","https://openalex.org/W2171313158","https://openalex.org/W2336123333","https://openalex.org/W2480791090","https://openalex.org/W2614478555","https://openalex.org/W2748193922","https://openalex.org/W2987907651","https://openalex.org/W3146075203"],"related_works":["https://openalex.org/W2013532785","https://openalex.org/W2596200388","https://openalex.org/W2129671708","https://openalex.org/W1523915036","https://openalex.org/W2947683711","https://openalex.org/W4297817435","https://openalex.org/W1522519483","https://openalex.org/W7099997642","https://openalex.org/W909064011","https://openalex.org/W7099452656"],"abstract_inverted_index":{"In":[0,84,100],"previous":[1,75],"work,":[2],"we":[3,88,151],"introduced":[4],"an":[5,60,96],"approach":[6,15],"to":[7,64,95],"program":[8,69],"verification":[9,139],"based":[10,129],"on":[11,130],"characteristic":[12,31,93,103,131],"formulae.":[13,132],"The":[14,53],"consists":[16],"of":[17,27,47,50,92,111,140],"generating":[18],"a":[19,28,37,42,71,127],"higher-order":[20,163,168],"logic":[21],"formula":[22,32,54],"from":[23],"the":[24,48,68,85,90,109,117,138,145],"source":[25],"code":[26],"program.":[29,52],"This":[30,74,133],"is":[33],"constructed":[34],"in":[35,59,108],"such":[36],"way":[38],"that":[39,51,67],"it":[40],"gives":[41],"sound":[43],"and":[44,165],"complete":[45],"description":[46],"semantics":[49],"can":[55],"thus":[56],"be":[57],"exploited":[58],"interactive":[61],"proof":[62,147],"assistant":[63],"formally":[65,153],"verify":[66],"satisfies":[70],"particular":[72],"specification.":[73],"work":[76],"was,":[77],"however,":[78],"only":[79],"concerned":[80],"with":[81],"purely-functional":[82],"programs.":[83],"present":[86],"paper,":[87],"describe":[89],"generalization":[91],"formulae":[94,104],"imperative":[97,141,156],"programming":[98],"language.":[99],"this":[101],"setting,":[102],"involve":[105],"specifications":[106],"expressed":[107],"style":[110],"Separation":[112],"Logic.":[113],"They":[114],"also":[115],"integrate":[116],"frame":[118],"rule,":[119],"which":[120],"enables":[121],"local":[122],"reasoning.":[123],"We":[124],"have":[125,152],"implemented":[126],"tool":[128],"tool,":[134],"called":[135],"CFML,":[136,150],"supports":[137],"Caml":[142],"programs":[143,166],"using":[144],"Coq":[146],"assistant.":[148],"Using":[149],"verified":[154],"nontrivial":[155],"algorithms,":[157],"as":[158,160],"well":[159],"CPS":[161],"functions,":[162],"iterators,":[164],"involving":[167],"stores.":[169]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}