{"id":"https://openalex.org/W2564359929","doi":"https://doi.org/10.1145/3018610.3018623","title":"Automatic cyclic termination proofs for recursive procedures in separation logic","display_name":"Automatic cyclic termination proofs for recursive procedures in separation logic","publication_year":2016,"publication_date":"2016-12-22","ids":{"openalex":"https://openalex.org/W2564359929","doi":"https://doi.org/10.1145/3018610.3018623","mag":"2564359929"},"language":"en","primary_location":{"id":"doi:10.1145/3018610.3018623","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3018610.3018623","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3018623&type=pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=3018623&type=pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056648657","display_name":"Reuben N. S. Rowe","orcid":"https://orcid.org/0000-0002-4271-9078"},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Reuben N. S. Rowe","raw_affiliation_strings":["University College London, UK"],"affiliations":[{"raw_affiliation_string":"University College London, UK","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025368137","display_name":"J G. Brotherston","orcid":"https://orcid.org/0000-0002-7536-4496"},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"James Brotherston","raw_affiliation_strings":["University College London, UK"],"affiliations":[{"raw_affiliation_string":"University College London, UK","institution_ids":["https://openalex.org/I45129253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056648657"],"corresponding_institution_ids":["https://openalex.org/I45129253"],"apc_list":null,"apc_paid":null,"fwci":6.626,"has_fulltext":true,"cited_by_count":37,"citation_normalized_percentile":{"value":0.96845996,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"53","last_page":"65"},"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.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"}},"topics":[{"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9987999796867371,"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.9968000054359436,"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.9360713362693787},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.8704909086227417},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7396219372749329},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6612206101417542},{"id":"https://openalex.org/keywords/pointer","display_name":"Pointer (user interface)","score":0.6466996669769287},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.4941559135913849},{"id":"https://openalex.org/keywords/formal-methods","display_name":"Formal methods","score":0.48038560152053833},{"id":"https://openalex.org/keywords/symbolic-execution","display_name":"Symbolic execution","score":0.462654173374176},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.45433762669563293},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4359564185142517},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39536532759666443},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.219241201877594},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10113164782524109},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.08228030800819397}],"concepts":[{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.9360713362693787},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8704909086227417},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7396219372749329},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6612206101417542},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.6466996669769287},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.4941559135913849},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.48038560152053833},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.462654173374176},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.45433762669563293},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4359564185142517},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39536532759666443},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.219241201877594},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10113164782524109},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.08228030800819397},{"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/3018610.3018623","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3018610.3018623","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3018623&type=pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs","raw_type":"proceedings-article"},{"id":"pmh:oai:kar.kent.ac.uk:64716","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3018610.3018623>)","pdf_url":null,"source":{"id":"https://openalex.org/S4377196264","display_name":"Kent Academic Repository (University of Kent)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I20581793","host_organization_name":"University of Kent","host_organization_lineage":["https://openalex.org/I20581793"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:1546183","is_oa":false,"landing_page_url":"https://discovery.ucl.ac.uk/id/eprint/1546183/","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:  CPP 2017 Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs.  (pp. pp. 53-65).  Association for Computing Machinery: New York. (2017)     ","raw_type":"Proceedings paper"}],"best_oa_location":{"id":"doi:10.1145/3018610.3018623","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3018610.3018623","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3018623&type=pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.6299999952316284,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G3795326585","display_name":null,"funder_award_id":"EP/K040049/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7369439297","display_name":"Boosting Automated Verification Using Cyclic Proof","funder_award_id":"EP/K040049/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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2564359929.pdf","grobid_xml":"https://content.openalex.org/works/W2564359929.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W32928793","https://openalex.org/W144022046","https://openalex.org/W1506927614","https://openalex.org/W1556705528","https://openalex.org/W1556837122","https://openalex.org/W1575501012","https://openalex.org/W1608869910","https://openalex.org/W1983496086","https://openalex.org/W1992012690","https://openalex.org/W1993129359","https://openalex.org/W1996245589","https://openalex.org/W1999823887","https://openalex.org/W2003383232","https://openalex.org/W2014496562","https://openalex.org/W2029129011","https://openalex.org/W2069300761","https://openalex.org/W2085428535","https://openalex.org/W2096944412","https://openalex.org/W2108611287","https://openalex.org/W2110082678","https://openalex.org/W2115215132","https://openalex.org/W2123056643","https://openalex.org/W2126160338","https://openalex.org/W2130162474","https://openalex.org/W2130413583","https://openalex.org/W2130427425","https://openalex.org/W2136242294","https://openalex.org/W2137628566","https://openalex.org/W2264729369","https://openalex.org/W2284409231","https://openalex.org/W2286195948","https://openalex.org/W2344539696","https://openalex.org/W6630314268","https://openalex.org/W6667847518","https://openalex.org/W6696009411"],"related_works":["https://openalex.org/W2985615839","https://openalex.org/W2011836220","https://openalex.org/W134837158","https://openalex.org/W2032767692","https://openalex.org/W4232408220","https://openalex.org/W1537636533","https://openalex.org/W1574842323","https://openalex.org/W2520438138","https://openalex.org/W2470870125","https://openalex.org/W3166784586"],"abstract_inverted_index":{"We":[0],"describe":[1],"a":[2],"formal":[3],"verification":[4],"framework":[5],"and":[6,67],"tool":[7],"implementation,":[8],"based":[9],"upon":[10],"cyclic":[11,54],"proofs,":[12],"for":[13],"certifying":[14],"the":[15,65],"safe":[16],"termination":[17,47],"of":[18,42,69],"imperative":[19],"pointer":[20],"programs":[21,57],"with":[22,33,58],"recursive":[23],"procedures.":[24],"Our":[25],"assertions":[26],"are":[27],"symbolic":[28],"heaps":[29],"in":[30],"separation":[31],"logic":[32],"user":[34],"defined":[35],"inductive":[36],"predicates;":[37],"we":[38],"employ":[39],"explicit":[40],"approximations":[41],"these":[43,62],"predicates":[44],"as":[45],"our":[46],"measures.":[48],"This":[49],"enables":[50],"us":[51],"to":[52,56],"extend":[53],"proof":[55],"procedures":[59],"by":[60],"relating":[61],"measures":[63],"across":[64],"pre-":[66],"postconditions":[68],"procedure":[70],"calls.":[71]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}