{"id":"https://openalex.org/W1963706207","doi":"https://doi.org/10.1016/j.entcs.2008.10.022","title":"Higher-Order Separation Logic in Isabelle/HOLCF","display_name":"Higher-Order Separation Logic in Isabelle/HOLCF","publication_year":2008,"publication_date":"2008-10-01","ids":{"openalex":"https://openalex.org/W1963706207","doi":"https://doi.org/10.1016/j.entcs.2008.10.022","mag":"1963706207"},"language":"en","primary_location":{"id":"doi:10.1016/j.entcs.2008.10.022","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2008.10.022","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/j.entcs.2008.10.022","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090965738","display_name":"Carsten Varming","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Carsten Varming","raw_affiliation_strings":["Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055959064","display_name":"Lars Birkedal","orcid":"https://orcid.org/0000-0003-1320-0098"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lars Birkedal","raw_affiliation_strings":["Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055959064","https://openalex.org/A5090965738"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":5.7205,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.95497248,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"218","issue":null,"first_page":"371","last_page":"389"},"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.9976999759674072,"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.9939000010490417,"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/hol","display_name":"HOL","score":0.9243096113204956},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7392858862876892},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.7269254922866821},{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.6861299872398376},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6632159948348999},{"id":"https://openalex.org/keywords/hoare-logic","display_name":"Hoare logic","score":0.6421601176261902},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.5898681879043579},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.491991251707077},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.48512348532676697},{"id":"https://openalex.org/keywords/horn-clause","display_name":"Horn clause","score":0.45729079842567444},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.4180329740047455},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.3772646188735962},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3742328882217407},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.35949304699897766},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.3077910542488098},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27234703302383423}],"concepts":[{"id":"https://openalex.org/C17435882","wikidata":"https://www.wikidata.org/wiki/Q17030435","display_name":"HOL","level":2,"score":0.9243096113204956},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7392858862876892},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.7269254922866821},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.6861299872398376},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6632159948348999},{"id":"https://openalex.org/C104949639","wikidata":"https://www.wikidata.org/wiki/Q1375924","display_name":"Hoare logic","level":3,"score":0.6421601176261902},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.5898681879043579},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.491991251707077},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.48512348532676697},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.45729079842567444},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.4180329740047455},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.3772646188735962},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3742328882217407},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.35949304699897766},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.3077910542488098},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27234703302383423},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"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":2,"locations":[{"id":"doi:10.1016/j.entcs.2008.10.022","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2008.10.022","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/08256e90-88b2-11dd-8006-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.itu.dk/portal/da/publications/08256e90-88b2-11dd-8006-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Varming, C & Birkedal, L 2008, 'Higher-Order Separation Logic in Isabelle/HOLCF', Electronical Notes in Theoretical Computer Science, pp. 371-389. https://doi.org/10.1016/j.entcs.2008.10.022","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1016/j.entcs.2008.10.022","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2008.10.022","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W189569203","https://openalex.org/W1495368328","https://openalex.org/W1509296872","https://openalex.org/W1520685476","https://openalex.org/W1677332761","https://openalex.org/W1965760540","https://openalex.org/W1975076763","https://openalex.org/W1996404651","https://openalex.org/W2050576837","https://openalex.org/W2103960969","https://openalex.org/W2113426200","https://openalex.org/W2121405115","https://openalex.org/W2125398300","https://openalex.org/W2125505801","https://openalex.org/W2125947584","https://openalex.org/W2132761501","https://openalex.org/W2137628566","https://openalex.org/W2156956446","https://openalex.org/W2533538450","https://openalex.org/W4250305641","https://openalex.org/W6630571127","https://openalex.org/W6637521183"],"related_works":["https://openalex.org/W2096553703","https://openalex.org/W183428347","https://openalex.org/W4318145497","https://openalex.org/W2984583406","https://openalex.org/W1574561771","https://openalex.org/W1595420666","https://openalex.org/W590274811","https://openalex.org/W1975577974","https://openalex.org/W3029202334","https://openalex.org/W1963706207"],"abstract_inverted_index":{"We":[0,125,244],"formalize":[1],"higher-order":[2,48,138,170,341],"separation":[3,76,171,321,342],"logic":[4,49,77,139,183,322],"for":[5,153,188],"a":[6,24,88,250,273,294],"first-order":[7,75],"imperative":[8],"language":[9,19,66],"with":[10],"procedures":[11],"and":[12,82,133,156,166,173,233,288,334],"local":[13,113],"variables":[14],"in":[15,22,33,71,115,143,161,204,283],"Isabelle/HOLCF.":[16],"The":[17,47,182,278,314],"assertion":[18],"is":[20,184],"modeled":[21],"such":[23],"way":[25],"that":[26,51],"one":[27],"may":[28],"use":[29,245,339],"any":[30],"theory":[31],"defined":[32],"Isabelle/HOLCF":[34],"to":[35,60,129,134,224,248,325],"construct":[36],"assertions,":[37],"e.g.,":[38],"primitive":[39],"recursion,":[40],"least":[41],"or":[42],"greatest":[43],"fixed":[44],"points":[45],"etc.":[46],"ensures":[50],"we":[52,149],"can":[53],"show":[54,135],"non-trivial":[55,127],"algorithms":[56],"correct":[57],"without":[58],"having":[59],"extend":[61],"the":[62,65,95,119,137,191,195,200,209,217,225,281,301,320,327,331],"semantics":[63,193],"of":[64,94,102,112,194,211,219,254,276,300,308,319,340],"as":[67,159,186],"was":[68],"done":[69],"previously":[70],"verifications":[72],"based":[73],"on":[74,100,216,239,306],"[Birkedal,":[78,284],"L.,":[79,285],"N.T.":[80,286],"Smith":[81,287],"J.C.":[83,289],"Reynolds,":[84,290],"Local":[85,291],"reasoning":[86,114,148,189,292],"about":[87,190,293],"copying":[89,256,295],"garbage":[90,257,296,332],"collector,":[91,297],"in:":[92,228,298],"Proceedings":[93,299],"31st":[96,302],"ACM":[97,175,267,303],"SIGPLAN-SIGACT":[98,304],"Symposium":[99,305],"Principles":[101,307],"Programming":[103,309],"Languages":[104,310],"(2004),":[105,311],"pp.":[106,242,270,312],"220\u2013231;":[107],"Yang,":[108],"H.,":[109],"An":[110],"example":[111],"BI":[116],"pointer":[117],"logic:":[118],"Schorr-Waite":[120],"graph":[121],"marking":[122],"algorithm":[123],"(2000)].":[124],"provide":[126],"examples":[128],"support":[130,146],"this":[131],"claim":[132],"how":[136],"enables":[140],"natural":[141],"assertions":[142],"specifications.":[144],"To":[145],"abstract":[147],"have":[150],"implemented":[151],"rules":[152],"representation":[154,275],"hiding":[155],"data":[157],"abstraction":[158],"seen":[160],"[Biering,":[162],"B.,":[163],"L.":[164],"Birkedal":[165],"N.":[167],"Torp-Smith,":[168],"BI-hyperdoctrines,":[169],"logic,":[172],"abstraction,":[174],"Trans.":[176],"Program.":[177],"Lang.":[178],"Syst.":[179],"29":[180],"(2007)].":[181],"represented":[185],"lemmas":[187],"denotational":[192],"programming":[196],"language.":[197],"This":[198],"follows":[199],"definitional":[201],"approach":[202],"common":[203],"HOL":[205,226,229],"theorem":[206],"provers,":[207],"i.e.,":[208],"soundness":[210,218],"our":[212,246],"model":[213],"only":[214],"relies":[215],"Isabelle/HOL":[220],"[Gordon,":[221],"M.,":[222],"Introduction":[223],"system,":[227],"Theorem":[230],"Proving":[231],"System":[232],"Its":[234],"Applications,":[235],"1991.,":[236],"International":[237],"Workshop":[238],"the,":[240],"1991,":[241],"2\u20133].":[243],"formalization":[247],"give":[249],"formally":[251],"verified":[252],"proof":[253,279,315],"Cheney's":[255],"collector":[258],"[Cheney,":[259],"C.J.,":[260],"A":[261],"nonrecursive":[262],"list":[263],"compacting":[264],"algorithm,":[265],"Commun.":[266],"13":[268],"(1970),":[269],"677\u2013678]":[271],"using":[272],"tagged":[274],"objects.":[277],"generalizes":[280],"results":[282],"220\u2013231].":[313],"uses":[316],"an":[317],"encoding":[318],"formula":[323],"this(h)":[324],"capture":[326],"heap":[328],"from":[329],"before":[330],"collection":[333],"thus":[335],"shows":[336],"another":[337],"novel":[338],"logic.":[343]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}