{"id":"https://openalex.org/W2284409231","doi":"https://doi.org/10.1145/2837614.2837621","title":"Model checking for symbolic-heap separation logic with inductive predicates","display_name":"Model checking for symbolic-heap separation logic with inductive predicates","publication_year":2016,"publication_date":"2016-01-07","ids":{"openalex":"https://openalex.org/W2284409231","doi":"https://doi.org/10.1145/2837614.2837621","mag":"2284409231"},"language":"en","primary_location":{"id":"doi:10.1145/2837614.2837621","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2837614.2837621","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2837614.2837621?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2837614.2837621?download=true","any_repository_has_fulltext":null},"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/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":"James Brotherston","raw_affiliation_strings":["University College London, UK"],"affiliations":[{"raw_affiliation_string":"University College London, UK","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007779952","display_name":"Nikos Gorogiannis","orcid":null},"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":"Nikos Gorogiannis","raw_affiliation_strings":["Middlesex University, UK"],"affiliations":[{"raw_affiliation_string":"Middlesex University, UK","institution_ids":["https://openalex.org/I60488453"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048798287","display_name":"Max Kanovich","orcid":"https://orcid.org/0000-0002-7502-1653"},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]},{"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","RU"],"is_corresponding":false,"raw_author_name":"Max Kanovich","raw_affiliation_strings":["University College London, UK / National Research University Higher School of Economics, Russia"],"affiliations":[{"raw_affiliation_string":"University College London, UK / National Research University Higher School of Economics, Russia","institution_ids":["https://openalex.org/I118501908","https://openalex.org/I45129253"]}]},{"author_position":"last","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":false,"raw_author_name":"Reuben Rowe","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":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5025368137"],"corresponding_institution_ids":["https://openalex.org/I45129253"],"apc_list":null,"apc_paid":null,"fwci":7.5379,"has_fulltext":true,"cited_by_count":23,"citation_normalized_percentile":{"value":0.97158312,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"84","last_page":"96"},"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.9995999932289124,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9991999864578247,"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/heap","display_name":"Heap (data structure)","score":0.820402979850769},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7376327514648438},{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.7242499589920044},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6993310451507568},{"id":"https://openalex.org/keywords/p","display_name":"P","score":0.5767761468887329},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5560012459754944},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5266525745391846},{"id":"https://openalex.org/keywords/presburger-arithmetic","display_name":"Presburger arithmetic","score":0.4631369113922119},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.4530264735221863},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4456230700016022},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4053538143634796},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32880908250808716}],"concepts":[{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.820402979850769},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7376327514648438},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.7242499589920044},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6993310451507568},{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.5767761468887329},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5560012459754944},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5266525745391846},{"id":"https://openalex.org/C5852641","wikidata":"https://www.wikidata.org/wiki/Q956059","display_name":"Presburger arithmetic","level":3,"score":0.4631369113922119},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.4530264735221863},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4456230700016022},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4053538143634796},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32880908250808716}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2837614.2837621","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2837614.2837621","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2837614.2837621?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.mdx.ac.uk:19162","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400025","display_name":"Middlesex University Research Repository (Middlesex University Of London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I60488453","host_organization_name":"Middlesex University","host_organization_lineage":["https://openalex.org/I60488453"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:1476369","is_oa":false,"landing_page_url":"https://discovery.ucl.ac.uk/id/eprint/1476369/","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: Bodik, R and Majumdar, R, (eds.)   (pp. pp. 84-96).  ACM (2016)     ","raw_type":"Proceedings paper"}],"best_oa_location":{"id":"doi:10.1145/2837614.2837621","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2837614.2837621","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2837614.2837621?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1361938442","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2284409231.pdf","grobid_xml":"https://content.openalex.org/works/W2284409231.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W122465024","https://openalex.org/W134837158","https://openalex.org/W1506927614","https://openalex.org/W1561702747","https://openalex.org/W1564750950","https://openalex.org/W1565541828","https://openalex.org/W1577525693","https://openalex.org/W1581674879","https://openalex.org/W1910824881","https://openalex.org/W1974265510","https://openalex.org/W2011039300","https://openalex.org/W2045388381","https://openalex.org/W2061679993","https://openalex.org/W2066585576","https://openalex.org/W2080769562","https://openalex.org/W2103490167","https://openalex.org/W2108611287","https://openalex.org/W2110082678","https://openalex.org/W2123056643","https://openalex.org/W2130162474","https://openalex.org/W2137628566","https://openalex.org/W2148193377","https://openalex.org/W2152178634","https://openalex.org/W2170612356","https://openalex.org/W2241234471","https://openalex.org/W2264729369","https://openalex.org/W2551720480","https://openalex.org/W4241108585","https://openalex.org/W4256027310","https://openalex.org/W6630314268","https://openalex.org/W6633710813","https://openalex.org/W6634806450"],"related_works":["https://openalex.org/W4296607663","https://openalex.org/W4290679430","https://openalex.org/W1481101394","https://openalex.org/W1530851674","https://openalex.org/W4296464145","https://openalex.org/W2528592500","https://openalex.org/W2899424233","https://openalex.org/W2949141320","https://openalex.org/W2284409231","https://openalex.org/W3137061681"],"abstract_inverted_index":{"We":[0,105],"investigate":[1],"the":[2,15,45,59,67,70,81,86,99,102,120],"*model":[3],"checking*":[4],"problem":[5,16,46,60,71,87],"for":[6,80,112],"symbolic-heap":[7],"separation":[8],"logic":[9],"with":[10],"user-defined":[11],"inductive":[12,103],"predicates,":[13],"i.e.,":[14],"of":[17,69,123,129,137],"checking":[18,79],"that":[19,44,57],"a":[20,26,52,127],"given":[21,27],"stack-heap":[22],"memory":[23],"state":[24],"satisfies":[25],"formula":[28],"in":[29,35,63,66],"this":[30],"language,":[31],"as":[32],"arises":[33],"e.g.":[34],"software":[36],"testing":[37],"or":[38,90],"runtime":[39],"verification.":[40],"First,":[41],"we":[42,50,74,93,117],"show":[43,75],"is":[47,84],"*decidable*;":[48],"specifically,":[49],"present":[51,107],"bottom-up":[53],"fixed":[54],"point":[55],"algorithm":[56],"decides":[58],"and":[61,109],"runs":[62],"exponential":[64],"time":[65],"size":[68],"instance.":[72],"Second,":[73],"that,":[76],"while":[77],"model":[78],"full":[82],"language":[83],"EXPTIME-complete,":[85],"becomes":[88],"NP-complete":[89],"PTIME-solvable":[91],"when":[92],"impose":[94],"natural":[95],"syntactic":[96,138],"restrictions":[97],"on":[98,119,126],"schemata":[100],"defining":[101],"predicates.":[104],"additionally":[106],"NP":[108],"PTIME":[110],"algorithms":[111],"these":[113],"restricted":[114],"fragments.":[115],"Finally,":[116],"report":[118],"experimental":[121],"performance":[122],"our":[124],"procedures":[125],"variety":[128],"specifications":[130],"extracted":[131],"from":[132],"programs,":[133],"exercising":[134],"multiple":[135],"combinations":[136],"restrictions.":[139]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}