{"id":"https://openalex.org/W2011665527","doi":"https://doi.org/10.1142/s0129054112400588","title":"ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS","display_name":"ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS","publication_year":2012,"publication_date":"2012-11-01","ids":{"openalex":"https://openalex.org/W2011665527","doi":"https://doi.org/10.1142/s0129054112400588","mag":"2011665527"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054112400588","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054112400588","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-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/A5019616888","display_name":"Amir M. Ben-Amram","orcid":null},"institutions":[{"id":"https://openalex.org/I4210141777","display_name":"Academic College of Tel Aviv-Yafo","ror":"https://ror.org/04cg6c004","country_code":"IL","type":"education","lineage":["https://openalex.org/I4210141777"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"AMIR M. BEN-AMRAM","raw_affiliation_strings":["School of Computer Science, The Academic College of Tel-Aviv Yaffo, 2 Rabenu Yeruham Str., Tel-Aviv, 68182, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, The Academic College of Tel-Aviv Yaffo, 2 Rabenu Yeruham Str., Tel-Aviv, 68182, Israel","institution_ids":["https://openalex.org/I4210141777"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063909629","display_name":"Lars Kristiansen","orcid":"https://orcid.org/0000-0002-6749-4004"},"institutions":[{"id":"https://openalex.org/I184942183","display_name":"University of Oslo","ror":"https://ror.org/01xtthb56","country_code":"NO","type":"education","lineage":["https://openalex.org/I184942183"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"LARS KRISTIANSEN","raw_affiliation_strings":["Department of Mathematics, University of Oslo, P. O. Box 1053, Blindern, Oslo, NO-0316, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Oslo, P. O. Box 1053, Blindern, Oslo, NO-0316, Norway","institution_ids":["https://openalex.org/I184942183"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.08882339,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"23","issue":"07","first_page":"1451","last_page":"1464"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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/T11567","display_name":"semigroups and automata theory","score":0.9980000257492065,"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/decidability","display_name":"Decidability","score":0.934796929359436},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.8887271285057068},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5935556888580322},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5602190494537354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.487282395362854},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42643845081329346},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.4174998998641968}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.934796929359436},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8887271285057068},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5935556888580322},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5602190494537354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.487282395362854},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42643845081329346},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.4174998998641968},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054112400588","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054112400588","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.188.1674","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.1674","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www2.mta.ac.il/%7Eamirben/downloadable/undecidable.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W60370665","https://openalex.org/W1548801608","https://openalex.org/W1572215054","https://openalex.org/W1585917312","https://openalex.org/W1985456258","https://openalex.org/W1988826480","https://openalex.org/W2003295303","https://openalex.org/W2028542428","https://openalex.org/W2030748072","https://openalex.org/W2043100293","https://openalex.org/W2048694918","https://openalex.org/W2051600983","https://openalex.org/W2056964218","https://openalex.org/W2060213695","https://openalex.org/W2071713296","https://openalex.org/W2072088733","https://openalex.org/W2083350000","https://openalex.org/W2084875723","https://openalex.org/W2115581182","https://openalex.org/W2160527279","https://openalex.org/W2949436104","https://openalex.org/W2962995303","https://openalex.org/W4232464552"],"related_works":["https://openalex.org/W1561522752","https://openalex.org/W1835325438","https://openalex.org/W1563786920","https://openalex.org/W1629112568","https://openalex.org/W2037204124","https://openalex.org/W2529633050","https://openalex.org/W2952426464","https://openalex.org/W4294402683","https://openalex.org/W3037532811","https://openalex.org/W3034838075"],"abstract_inverted_index":{"We":[0,88,167],"investigate":[1],"the":[2,5,30,93,98,125,131,150,178,187,203],"decidability":[3,96,195],"of":[4,29,37,40,45,95,152,161],"feasibility":[6,33,99],"problem":[7,34,100],"for":[8,58,68,86,97,114],"imperative":[9],"programs":[10],"with":[11,171,196],"bounded":[12,26,120,185],"loops.":[13,141],"A":[14,142],"program":[15],"is":[16,35,50,149],"called":[17],"feasible":[18],"if":[19,75],"all":[20],"values":[21],"it":[22],"computes":[23],"are":[24,56,71,78,89,112,119],"polynomially":[25],"in":[27,91],"terms":[28],"input.":[31],"The":[32],"representative":[36],"a":[38,59,84,115,162],"group":[39],"related":[41],"properties,":[42],"like":[43],"that":[44,53,70,109,146],"polynomial":[46],"time":[47],"complexity.":[48],"It":[49],"well":[51],"known":[52],"such":[54,110],"properties":[55],"undecidable":[57],"Turing-complete":[60],"programming":[61],"language.":[62],"They":[63],"may":[64,127,181],"be":[65],"decidable,":[66],"however,":[67],"languages":[69,77],"not":[72],"Turing-complete.":[73],"But":[74,192],"these":[76],"expressive":[79],"enough,":[80],"they":[81],"do":[82],"pose":[83],"challenge":[85],"analysis.":[87],"interested":[90],"tracing":[92],"edge":[94],"and":[101],"similar":[102],"problems.":[103],"In":[104,135],"previous":[105],"work,":[106],"we":[107,138,147,158,193],"proved":[108],"problems":[111],"decidable":[113],"language":[116,144,165],"where":[117,177,202],"loops":[118,126],"but":[121],"indefinite":[122],"(that":[123,174,199],"is,":[124,175,200],"exit":[128],"before":[129],"completing":[130],"given":[132,188],"iteration":[133],"count).":[134],"this":[136],"paper,":[137],"consider":[139],"definite":[140],"second":[143],"feature":[145],"vary,":[148],"kind":[151],"assignment":[153,173],"statements.":[154],"With":[155],"ordinary":[156],"assignment,":[157],"prove":[159,169,194],"undecidability":[160,170],"very":[163],"tiny":[164],"fragment.":[166],"also":[168],"lossy":[172],"assignments":[176,198,201],"modified":[179,204],"variable":[180,205],"receive":[182],"any":[183],"value":[184],"by":[186],"expression,":[189],"even":[190],"zero).":[191],"max":[197],"never":[206],"decreases":[207],"its":[208],"value).":[209]},"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}