{"id":"https://openalex.org/W4255235909","doi":"https://doi.org/10.1109/lics.2004.1319603","title":"Proving termination assertions in dynamic logics","display_name":"Proving termination assertions in dynamic logics","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W4255235909","doi":"https://doi.org/10.1109/lics.2004.1319603"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2004.1319603","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2004.1319603","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","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/A5018841823","display_name":"Dani\u00ebl Leivant","orcid":"https://orcid.org/0000-0003-4041-4382"},"institutions":[{"id":"https://openalex.org/I592451","display_name":"Indiana University","ror":"https://ror.org/01kg8sb98","country_code":"US","type":"education","lineage":["https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"D. Leivant","raw_affiliation_strings":["Indiana University, USA"],"affiliations":[{"raw_affiliation_string":"Indiana University, USA","institution_ids":["https://openalex.org/I592451"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018841823"],"corresponding_institution_ids":["https://openalex.org/I592451"],"apc_list":null,"apc_paid":null,"fwci":0.4497,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.78794406,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":null,"first_page":"89","last_page":"98"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9997000098228455,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.8604702949523926},{"id":"https://openalex.org/keywords/peano-axioms","display_name":"Peano axioms","score":0.6403216123580933},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6313939094543457},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4990065097808838},{"id":"https://openalex.org/keywords/syntax","display_name":"Syntax","score":0.48552966117858887},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.477020263671875},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.44314101338386536},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.44184985756874084},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3698519170284271},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32559674978256226},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2652550935745239}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8604702949523926},{"id":"https://openalex.org/C97489613","wikidata":"https://www.wikidata.org/wiki/Q842755","display_name":"Peano axioms","level":2,"score":0.6403216123580933},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6313939094543457},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4990065097808838},{"id":"https://openalex.org/C60048249","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntax","level":2,"score":0.48552966117858887},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.477020263671875},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.44314101338386536},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.44184985756874084},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3698519170284271},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32559674978256226},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2652550935745239},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics.2004.1319603","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2004.1319603","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W113352416","https://openalex.org/W1490966766","https://openalex.org/W1978270323","https://openalex.org/W2006207208","https://openalex.org/W2015731361","https://openalex.org/W2024015109","https://openalex.org/W2037906582","https://openalex.org/W2063809508","https://openalex.org/W2087821987","https://openalex.org/W2089545158","https://openalex.org/W2094484747","https://openalex.org/W2116520367","https://openalex.org/W2147543351","https://openalex.org/W4239007999"],"related_works":["https://openalex.org/W171744056","https://openalex.org/W1577881803","https://openalex.org/W4301007153","https://openalex.org/W3136886172","https://openalex.org/W2146906212","https://openalex.org/W4390013774","https://openalex.org/W1536605945","https://openalex.org/W2624478615","https://openalex.org/W4297811169","https://openalex.org/W2606974619"],"abstract_inverted_index":{"Total":[0],"correctness":[1,194],"assertions":[2],"(TCAs)":[3],"have":[4],"long":[5],"been":[6],"considered":[7],"a":[8,28,49,151],"natural":[9],"formalization":[10,138],"of":[11,25,30,75,139,185,192,200],"successful":[12],"program":[13],"termination.":[14],"However,":[15],"research":[16],"dating":[17],"back":[18],"to":[19,115,124,127,135,190],"the":[20,43,160,171,197,201],"1980s":[21],"suggests":[22],"that":[23,61,77,150,170,183],"validity":[24,184,191],"TCAs":[26,63],"is":[27,71,108,153,163,174,187],"notion":[29],"limited":[31],"interest;":[32],"we":[33,143],"corroborate":[34],"this":[35,105],"by":[36],"proving":[37,62],"compactness":[38],"and":[39,53,110],"Herbrand":[40],"properties":[41],"for":[42,57,80,118],"valid":[44],"TCAs,":[45],"defining":[46],"in":[47,73,113,155,165],"passing":[48],"new":[50],"sound,":[51],"complete,":[52],"syntax-directed":[54],"deductive":[55],"system":[56],"TCAs.":[58],"It":[59],"follows":[60],"whose":[64],"truth":[65],"depends":[66],"on":[67,88],"underlying":[68],"inductive":[69,128,145],"data-types":[70],"impossible":[72],"logics":[74],"programs":[76],"are":[78],"sound":[79],"all":[81],"structures,":[82],"such":[83],"as":[84],"dynamic":[85],"logic":[86],"based":[87],"Segerberg's":[89,166],"PDL,":[90],"even":[91],"when":[92,159],"augmented":[93],"with":[94],"powerful":[95],"first-order":[96],"theories":[97],"like":[98],"Peano":[99],"arithmetic.":[100],"Harel's":[101,156],"convergence":[102,172],"rule":[103,173],"bypasses":[104],"difficulty,":[106],"but":[107],"methodologically":[109],"conceptually":[111],"problematic,":[112],"addition":[114],"being":[116],"unsound":[117],"general":[119],"validity.":[120],"We":[121,148,180],"propose":[122],"instead":[123],"bind":[125],"variables":[126],"data":[129],"via":[130],"DL's":[131],"box":[132],"operator,":[133],"leading":[134],"an":[136],"alternative":[137],"termination":[140],"assertions,":[141,195],"which":[142],"dub":[144],"TCA":[146,152],"(ITCA).":[147],"observe":[149],"provable":[154,164],"DL":[157],"exactly":[158],"corresponding":[161],"ITCA":[162],"DL,":[167],"thereby":[168],"showing":[169],"not":[175],"foundationally":[176],"or":[177],"practically":[178],"necessary.":[179],"also":[181],"show":[182],"ITCAs":[186],"directly":[188],"reducible":[189],"partial":[193],"confirming":[196],"foundational":[198],"importance":[199],"latter.":[202]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}