{"id":"https://openalex.org/W4234413063","doi":"https://doi.org/10.1109/fmcad.2014.6987597","title":"Disproving termination with overapproximation","display_name":"Disproving termination with overapproximation","publication_year":2014,"publication_date":"2014-10-01","ids":{"openalex":"https://openalex.org/W4234413063","doi":"https://doi.org/10.1109/fmcad.2014.6987597"},"language":"en","primary_location":{"id":"doi:10.1109/fmcad.2014.6987597","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2014.6987597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Formal Methods in Computer-Aided Design (FMCAD)","raw_type":"proceedings-article"},"type":"article","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/A5112528389","display_name":"Byron Cook","orcid":null},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]},{"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":"Byron Cook","raw_affiliation_strings":["Microsoft Research","University College London"],"affiliations":[{"raw_affiliation_string":"Microsoft Research","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"University College London","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045363254","display_name":"Carsten Fuhs","orcid":null},"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":"Carsten Fuhs","raw_affiliation_strings":["University College London"],"affiliations":[{"raw_affiliation_string":"University College London","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017623833","display_name":"Kaustubh Nimkar","orcid":null},"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":"Kaustubh Nimkar","raw_affiliation_strings":["University College London"],"affiliations":[{"raw_affiliation_string":"University College London","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068136684","display_name":"Peter W. O\u2019Hearn","orcid":null},"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":"Peter O'Hearn","raw_affiliation_strings":["University College London"],"affiliations":[{"raw_affiliation_string":"University College London","institution_ids":["https://openalex.org/I45129253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5112528389"],"corresponding_institution_ids":["https://openalex.org/I4210164937","https://openalex.org/I45129253"],"apc_list":null,"apc_paid":null,"fwci":1.227,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.86320638,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"67","last_page":"74"},"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.9994999766349792,"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.9994999766349792,"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.9994000196456909,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8137881755828857},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8108594417572021},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5754011869430542},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5546011924743652},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.537692666053772},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.5145520567893982},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.43227869272232056},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39348289370536804},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16308337450027466},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.09884658455848694}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8137881755828857},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8108594417572021},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5754011869430542},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5546011924743652},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.537692666053772},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.5145520567893982},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.43227869272232056},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39348289370536804},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16308337450027466},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.09884658455848694}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fmcad.2014.6987597","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2014.6987597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Formal Methods in Computer-Aided Design (FMCAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.4099999964237213}],"awards":[{"id":"https://openalex.org/G990077672","display_name":null,"funder_award_id":"EP/H008373/2","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":44,"referenced_works":["https://openalex.org/W146333850","https://openalex.org/W188927585","https://openalex.org/W197252015","https://openalex.org/W1493060511","https://openalex.org/W1495368328","https://openalex.org/W1496468608","https://openalex.org/W1499072146","https://openalex.org/W1499937701","https://openalex.org/W1503406871","https://openalex.org/W1505537169","https://openalex.org/W1508261706","https://openalex.org/W1518247129","https://openalex.org/W1563374593","https://openalex.org/W1608799719","https://openalex.org/W1834328158","https://openalex.org/W1964528821","https://openalex.org/W1972319677","https://openalex.org/W1989813138","https://openalex.org/W1996245589","https://openalex.org/W2003383232","https://openalex.org/W2027825679","https://openalex.org/W2030865387","https://openalex.org/W2072967308","https://openalex.org/W2098022036","https://openalex.org/W2099232008","https://openalex.org/W2115215132","https://openalex.org/W2134589411","https://openalex.org/W2135681149","https://openalex.org/W2136242294","https://openalex.org/W2147263168","https://openalex.org/W2226594342","https://openalex.org/W2487992810","https://openalex.org/W3158747708","https://openalex.org/W4232668957","https://openalex.org/W6608011023","https://openalex.org/W6629697938","https://openalex.org/W6629850550","https://openalex.org/W6630163716","https://openalex.org/W6630271603","https://openalex.org/W6630957242","https://openalex.org/W6636327300","https://openalex.org/W6652124247","https://openalex.org/W6680158267","https://openalex.org/W6681932367"],"related_works":["https://openalex.org/W3158777280","https://openalex.org/W2949158926","https://openalex.org/W2093687902","https://openalex.org/W4301885003","https://openalex.org/W2005058894","https://openalex.org/W1529656707","https://openalex.org/W2053233145","https://openalex.org/W2928599599","https://openalex.org/W2170634995","https://openalex.org/W2082036845"],"abstract_inverted_index":{"When":[0],"disproving":[1],"termination":[2],"using":[3,69],"known":[4],"techniques":[5],"(e.g.":[6],"recurrence":[7,40],"sets),":[8],"abstractions":[9,29],"that":[10,30],"overapproximate":[11],"the":[12,35,48],"program's":[13],"transition":[14],"relation":[15],"are":[16],"unsound.":[17],"In":[18],"this":[19,52],"paper":[20],"we":[21,55],"introduce":[22],"live":[23],"abstractions,":[24],"a":[25],"natural":[26],"class":[27],"of":[28,38,51],"can":[31,65],"be":[32,66],"combined":[33],"with":[34,59],"recent":[36],"concept":[37],"closed":[39],"sets":[41],"to":[42],"soundly":[43],"disprove":[44],"termination.":[45],"To":[46],"demonstrate":[47],"practical":[49],"usefulness":[50],"new":[53],"approach":[54],"show":[56],"how":[57],"programs":[58],"nonlinear,":[60],"nondeterministic,":[61],"and":[62],"heap-based":[63],"commands":[64],"shown":[67],"nonterminating":[68],"linear":[70],"overapproximations.":[71]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}