{"id":"https://openalex.org/W2122018771","doi":"https://doi.org/10.1109/synasc.2008.22","title":"Termination Analysis by Program Inversion","display_name":"Termination Analysis by Program Inversion","alternate_titles":[],"publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2122018771","doi":"https://doi.org/10.1109/synasc.2008.22","mag":"2122018771"},"language":"en","primary_location":{"id":"doi:10.1109/synasc.2008.22","doi":"https://doi.org/10.1109/synasc.2008.22","is_oa":false,"landing_page_url":"https://doi.org/10.1109/synasc.2008.22","pdf_url":null,"source":{"id":"https://openalex.org/S7407086568","display_name":"International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2122018771"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5055377327","display_name":"\u015etefan Andrei","orcid":"https://orcid.org/0009-0009-8406-3757","observed_orcids":["https://orcid.org/0009-0009-8406-3757"]},"institutions":[{"id":"https://openalex.org/I177898655","display_name":"Lamar University","ror":"https://ror.org/008ms5s18","country_code":"US","type":"education","lineage":["https://openalex.org/I177898655"]}],"countries":["US"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Stefan Andrei","raw_affiliation_strings":["Department of Computer Science, Lamar University, Beaumont, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lamar University, Beaumont, TX, USA","institution_ids":["https://openalex.org/I177898655"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055377327"],"corresponding_institution_ids":["https://openalex.org/I177898655"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"277","last_page":"280"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9814000129699707,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9814000129699707,"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.004900000058114529,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.002300000051036477,"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/program-termination","display_name":"program termination","score":0.9300000071525574},{"id":"https://openalex.org/keywords/runtime-analysis","display_name":"runtime analysis","score":0.6570000052452087},{"id":"https://openalex.org/keywords/program-inversion","display_name":"program inversion","score":0.9160000085830688},{"id":"https://openalex.org/keywords/execution-traces","display_name":"execution traces","score":0.5680000185966492},{"id":"https://openalex.org/keywords/symbolic-numeric-algorithms","display_name":"symbolic-numeric algorithms","score":0.8209999799728394},{"id":"https://openalex.org/keywords/termination-proofs","display_name":"termination proofs","score":0.33000001311302185}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7829408645629883},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5548171997070312},{"id":"https://openalex.org/C1893757","wikidata":"https://www.wikidata.org/wiki/Q3653001","display_name":"Inversion (geology)","level":3,"score":0.5279185771942139},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5169388651847839},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47787991166114807},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.45672330260276794},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4539080858230591},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.44726860523223877},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44200676679611206},{"id":"https://openalex.org/C2776937632","wikidata":"https://www.wikidata.org/wiki/Q4117718","display_name":"Program synthesis","level":2,"score":0.43084481358528137},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4011561870574951},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.14094310998916626},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13651663064956665},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11954441666603088},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C109007969","wikidata":"https://www.wikidata.org/wiki/Q749565","display_name":"Structural basin","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/synasc.2008.22","doi":"https://doi.org/10.1109/synasc.2008.22","is_oa":false,"landing_page_url":"https://doi.org/10.1109/synasc.2008.22","pdf_url":null,"source":{"id":"https://openalex.org/S7407086568","display_name":"International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1593745409","https://openalex.org/W1834328158","https://openalex.org/W1993129359","https://openalex.org/W2047764386","https://openalex.org/W2082603183","https://openalex.org/W2119650177","https://openalex.org/W2124909257","https://openalex.org/W2126160338","https://openalex.org/W2378259225","https://openalex.org/W2955442659","https://openalex.org/W2987907651"],"related_works":["https://openalex.org/W7097735302","https://openalex.org/W7096856942","https://openalex.org/W2044402569","https://openalex.org/W2298199820","https://openalex.org/W1987280813","https://openalex.org/W2501953491","https://openalex.org/W1990295079","https://openalex.org/W2206131239","https://openalex.org/W2141604945","https://openalex.org/W4225657323"],"abstract_inverted_index":{"Automatic":[0],"methods":[1],"for":[2,27,38,70,91],"discovering":[3],"program":[4,8],"runtime":[5,35,90],"and":[6,24,84],"proving":[7],"termination":[9,69],"have":[10],"always":[11],"been":[12],"a":[13,22,39,52,57,63,79,92],"challenging":[14],"problem":[15],"in":[16],"computer":[17],"science.":[18],"We":[19],"present":[20],"here":[21],"novel":[23,80],"systematic":[25],"approach":[26,74],"calculating":[28],"an":[29,49],"upper":[30],"bound":[31],"of":[32,36,42,95],"the":[33,88],"maximum":[34,89],"functions":[37],"non-trivial":[40],"class":[41,94],"programs.":[43],"The":[44,73],"proof":[45],"is":[46],"based":[47],"on":[48],"induction":[50],"over":[51,78],"treeof":[53],"execution":[54],"traces":[55],"-":[56],"new":[58],"mathematical":[59,81],"data":[60,82],"structure.":[61],"As":[62],"consequence,":[64],"this":[65],"can":[66,85],"also":[67],"show":[68],"these":[71],"functions.":[72,96],"uses":[75],"symbolic-numeric":[76],"algorithms":[77],"structure,":[83],"systematically":[86],"find":[87],"wide":[93]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2122018771","counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
