{"id":"https://openalex.org/W1983496086","doi":"https://doi.org/10.1145/1328438.1328453","title":"Cyclic proofs of program termination in separation logic","display_name":"Cyclic proofs of program termination in separation logic","publication_year":2008,"publication_date":"2008-01-07","ids":{"openalex":"https://openalex.org/W1983496086","doi":"https://doi.org/10.1145/1328438.1328453","mag":"1983496086"},"language":"en","primary_location":{"id":"doi:10.1145/1328438.1328453","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1328438.1328453","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},"type":"conference-paper","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/A5025368137","display_name":"J G. Brotherston","orcid":"https://orcid.org/0000-0002-7536-4496"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"James Brotherston","raw_affiliation_strings":["Imperial College London, London, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Imperial College London, London, United Kingdom","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034062698","display_name":"Richard Bornat","orcid":"https://orcid.org/0000-0002-7261-0233"},"institutions":[{"id":"https://openalex.org/I60488453","display_name":"Middlesex University","ror":"https://ror.org/01rv4p989","country_code":"GB","type":"education","lineage":["https://openalex.org/I60488453"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Richard Bornat","raw_affiliation_strings":["Middlesex University, London, United Kingdom","[Middlesex University, London, United Kingdom]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Middlesex University, London, United Kingdom","institution_ids":["https://openalex.org/I60488453"]},{"raw_affiliation_string":"[Middlesex University, London, United Kingdom]","institution_ids":["https://openalex.org/I60488453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055733288","display_name":"Cristiano Calcagno","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Cristiano Calcagno","raw_affiliation_strings":["Imperial College London, London, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Imperial College London, London, United Kingdom","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.5324,"has_fulltext":false,"cited_by_count":75,"citation_normalized_percentile":{"value":0.95578114,"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":"101","last_page":"112"},"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.9991999864578247,"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.998199999332428,"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/separation-logic","display_name":"Separation logic","score":0.9096236228942871},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6930718421936035},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6847189664840698},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6685549020767212},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.6151476502418518},{"id":"https://openalex.org/keywords/bunched-logic","display_name":"Bunched logic","score":0.5751112699508667},{"id":"https://openalex.org/keywords/predicate-transformer-semantics","display_name":"Predicate transformer semantics","score":0.5089704990386963},{"id":"https://openalex.org/keywords/precondition","display_name":"Precondition","score":0.4782406687736511},{"id":"https://openalex.org/keywords/hoare-logic","display_name":"Hoare logic","score":0.43180716037750244},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33034375309944153},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22480973601341248},{"id":"https://openalex.org/keywords/multimodal-logic","display_name":"Multimodal logic","score":0.12977051734924316},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.12206029891967773},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.10572624206542969},{"id":"https://openalex.org/keywords/zeroth-order-logic","display_name":"Zeroth-order logic","score":0.09981673955917358},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.09543657302856445},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.07874917984008789}],"concepts":[{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.9096236228942871},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6930718421936035},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6847189664840698},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6685549020767212},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.6151476502418518},{"id":"https://openalex.org/C80467683","wikidata":"https://www.wikidata.org/wiki/Q4997446","display_name":"Bunched logic","level":5,"score":0.5751112699508667},{"id":"https://openalex.org/C30128091","wikidata":"https://www.wikidata.org/wiki/Q291929","display_name":"Predicate transformer semantics","level":4,"score":0.5089704990386963},{"id":"https://openalex.org/C192465680","wikidata":"https://www.wikidata.org/wiki/Q1413450","display_name":"Precondition","level":2,"score":0.4782406687736511},{"id":"https://openalex.org/C104949639","wikidata":"https://www.wikidata.org/wiki/Q1375924","display_name":"Hoare logic","level":3,"score":0.43180716037750244},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33034375309944153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22480973601341248},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.12977051734924316},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.12206029891967773},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.10572624206542969},{"id":"https://openalex.org/C110039528","wikidata":"https://www.wikidata.org/wiki/Q8069651","display_name":"Zeroth-order logic","level":4,"score":0.09981673955917358},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.09543657302856445},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.07874917984008789},{"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/1328438.1328453","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1328438.1328453","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.564.1539","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.564.1539","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www0.cs.ucl.ac.uk/staff/J.Brotherston/POPL08/cyclicterm.pdf","raw_type":"text"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:1377671","is_oa":false,"landing_page_url":"http://discovery.ucl.ac.uk/1377671/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"In: (Proceedings) 35th ACM-SIGPLAN-SIGACT Symposium on Principles of Programming Languages. (pp. pp. 101-112). ASSOC COMPUTING MACHINERY (2008)","raw_type":"Proceedings paper"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.800000011920929}],"awards":[{"id":"https://openalex.org/G2155823658","display_name":null,"funder_award_id":"EP/E002536/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W88647010","https://openalex.org/W1196275239","https://openalex.org/W1508811155","https://openalex.org/W1556837122","https://openalex.org/W1562865234","https://openalex.org/W1575501012","https://openalex.org/W1608869910","https://openalex.org/W1883955460","https://openalex.org/W1887332367","https://openalex.org/W1969682671","https://openalex.org/W1975076763","https://openalex.org/W1993129359","https://openalex.org/W2008132476","https://openalex.org/W2120869910","https://openalex.org/W2123056643","https://openalex.org/W2124909257","https://openalex.org/W2130162474","https://openalex.org/W2135021832","https://openalex.org/W2135163511","https://openalex.org/W2135331739","https://openalex.org/W2136242294","https://openalex.org/W2137628566","https://openalex.org/W2158738638","https://openalex.org/W2168056516","https://openalex.org/W2953081354","https://openalex.org/W4232668957","https://openalex.org/W4241086578"],"related_works":["https://openalex.org/W2963446106","https://openalex.org/W1509296872","https://openalex.org/W2096553703","https://openalex.org/W2015096460","https://openalex.org/W4256587698","https://openalex.org/W2018603276","https://openalex.org/W1864574667","https://openalex.org/W1480120842","https://openalex.org/W2399029393","https://openalex.org/W1983496086"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,20,36,44,47,54],"novel":[3],"approach":[4],"to":[5],"proving":[6],"the":[7,31,40,81],"termination":[8,29],"of":[9,30,56,62,66,83],"heap-manipulating":[10],"programs,":[11],"which":[12,50],"combines":[13],"separation":[14,57],"logic":[15],"with":[16],"cyclic":[17],"proof":[18,22,60],"within":[19],"Hoare-style":[21],"system.Judgements":[23],"in":[24,39,43],"this":[25],"system":[26,64],"express":[27],"(guaranteed)":[28],"program":[32,41,85],"when":[33],"started":[34],"from":[35],"given":[37,48],"line":[38],"and":[42,75],"state":[45],"satisfying":[46],"precondition,":[49],"is":[51],"expressed":[52],"as":[53],"formula":[55],"logic.":[58],"The":[59],"rules":[61,70,78],"our":[63],"are":[65],"two":[67],"types:":[68],"logical":[69],"that":[71,79],"operate":[72],"on":[73],"preconditions;":[74],"symbolic":[76],"execution":[77],"capture":[80],"effect":[82],"executing":[84],"commands.":[86]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":7}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}