{"id":"https://openalex.org/W2293405767","doi":"https://doi.org/10.1145/2854065.2854067","title":"Refinement based verification of imperative data structures","display_name":"Refinement based verification of imperative data structures","publication_year":2016,"publication_date":"2016-01-12","ids":{"openalex":"https://openalex.org/W2293405767","doi":"https://doi.org/10.1145/2854065.2854067","mag":"2293405767"},"language":"en","primary_location":{"id":"doi:10.1145/2854065.2854067","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2854065.2854067","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.manchester.ac.uk/en/publications/8179f005-1cd2-4a37-888a-6dcf6de9862a","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082037264","display_name":"Peter Lammich","orcid":"https://orcid.org/0000-0003-3576-0504"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Peter Lammich","raw_affiliation_strings":["TU M\u00fcnchen, Germany"],"affiliations":[{"raw_affiliation_string":"TU M\u00fcnchen, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5082037264"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.5756,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.95971666,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"27","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9983999729156494,"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.9983000159263611,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9980000257492065,"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/hol","display_name":"HOL","score":0.85341477394104},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8425540924072266},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7273092269897461},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.6743146181106567},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.5866197347640991},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41678205132484436}],"concepts":[{"id":"https://openalex.org/C17435882","wikidata":"https://www.wikidata.org/wiki/Q17030435","display_name":"HOL","level":2,"score":0.85341477394104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8425540924072266},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7273092269897461},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6743146181106567},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.5866197347640991},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41678205132484436}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2854065.2854067","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2854065.2854067","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire/8179f005-1cd2-4a37-888a-6dcf6de9862a","is_oa":true,"landing_page_url":"https://research.manchester.ac.uk/en/publications/8179f005-1cd2-4a37-888a-6dcf6de9862a","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lammich, P 2016, 'Refinement based verification of imperative data structures', Paper presented at the 5th ACM SIGPLAN Conference, 18/01/16 - 19/01/16 pp. 27-36. https://doi.org/10.1145/2854065.2854067","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/8179f005-1cd2-4a37-888a-6dcf6de9862a","is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?doid=2854065.2854067","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/8179f005-1cd2-4a37-888a-6dcf6de9862a","is_oa":true,"landing_page_url":"https://research.manchester.ac.uk/en/publications/8179f005-1cd2-4a37-888a-6dcf6de9862a","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lammich, P 2016, 'Refinement based verification of imperative data structures', Paper presented at the 5th ACM SIGPLAN Conference, 18/01/16 - 19/01/16 pp. 27-36. https://doi.org/10.1145/2854065.2854067","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W77329694","https://openalex.org/W101424827","https://openalex.org/W122118143","https://openalex.org/W326743114","https://openalex.org/W1511826042","https://openalex.org/W1522519483","https://openalex.org/W1581325065","https://openalex.org/W1820726602","https://openalex.org/W1955004327","https://openalex.org/W1967019306","https://openalex.org/W2098037505","https://openalex.org/W2137628566","https://openalex.org/W2148687959","https://openalex.org/W2148817888","https://openalex.org/W2160573490","https://openalex.org/W2169528473","https://openalex.org/W2206900256","https://openalex.org/W2396303865","https://openalex.org/W2964226978","https://openalex.org/W2987977008","https://openalex.org/W4238118210","https://openalex.org/W4247464325","https://openalex.org/W4253748132"],"related_works":["https://openalex.org/W3158536649","https://openalex.org/W3208388410","https://openalex.org/W3085888268","https://openalex.org/W82161441","https://openalex.org/W1560655349","https://openalex.org/W1576042299","https://openalex.org/W1990602094","https://openalex.org/W2181943964","https://openalex.org/W1528423264","https://openalex.org/W2898214470"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,93],"present":[4],"a":[5,90],"stepwise":[6],"refinement":[7,57],"based":[8],"top-down":[9],"approach":[10,17],"to":[11,59,103],"verified":[12,25,107],"imperative":[13],"data":[14,26,36,40,98],"structures.":[15,37],"Our":[16,53],"is":[18,67,78],"modular":[19],"in":[20,62,70],"the":[21,49,80,84],"sense":[22],"that":[23,73],"already":[24],"structures":[27,41],"can":[28,42],"be":[29,43],"used":[30,44],"for":[31,48],"construction":[32],"of":[33,51,87,109],"more":[34],"complex":[35],"Moreover,":[38],"our":[39],"as":[45],"building":[46],"blocks":[47],"verification":[50],"algorithms.":[52],"tool":[54],"chain":[55],"supports":[56],"down":[58],"executable":[60],"code":[61,76,85],"various":[63],"programming":[64],"languages,":[65],"and":[66,83,100],"fully":[68],"implemented":[69],"Isabelle/HOL,":[71],"such":[72],"its":[74],"trusted":[75],"base":[77],"only":[79],"inference":[81],"kernel":[82],"generator":[86],"Isabelle/HOL.":[88],"As":[89],"case":[91],"study,":[92],"verify":[94],"an":[95,105],"indexed":[96],"heap":[97],"structure,":[99],"use":[101],"it":[102],"generate":[104],"efficient":[106],"implementation":[108],"Dijkstra's":[110],"algorithm.":[111]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}