{"id":"https://openalex.org/W2089005875","doi":"https://doi.org/10.1145/2505879.2505884","title":"Eventual linear ranking functions","display_name":"Eventual linear ranking functions","publication_year":2013,"publication_date":"2013-09-16","ids":{"openalex":"https://openalex.org/W2089005875","doi":"https://doi.org/10.1145/2505879.2505884","mag":"2089005875"},"language":"en","primary_location":{"id":"doi:10.1145/2505879.2505884","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2505879.2505884","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1306.1901","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Roberto Bagnara","orcid":null},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Roberto Bagnara","raw_affiliation_strings":["Universit\u00e0 di Parma, Italy"],"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Parma, Italy","institution_ids":["https://openalex.org/I124601658"]}]},{"author_position":"last","author":{"id":null,"display_name":"Fred Mesnard","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fred Mesnard","raw_affiliation_strings":["Universit\u00e9 de la R\u00e9union, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de la R\u00e9union, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I124601658"],"apc_list":null,"apc_paid":null,"fwci":2.4907,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.90635588,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"229","last_page":"238"},"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.9986000061035156,"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.9986000061035156,"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.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"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9975000023841858,"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/correctness","display_name":"Correctness","score":0.6934999823570251},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.590499997138977},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.5248000025749207},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.4683000147342682},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.46399998664855957},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.3986000120639801},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.3903000056743622},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.388700008392334},{"id":"https://openalex.org/keywords/java","display_name":"Java","score":0.38109999895095825}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6934999823570251},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.590499997138977},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5752000212669373},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5309000015258789},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.5248000025749207},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4932999908924103},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.4683000147342682},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.46399998664855957},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3986000120639801},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.3903000056743622},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.388700008392334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3815000057220459},{"id":"https://openalex.org/C548217200","wikidata":"https://www.wikidata.org/wiki/Q251","display_name":"Java","level":2,"score":0.38109999895095825},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3652999997138977},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.35929998755455017},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.3346000015735626},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32269999384880066},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.31769999861717224},{"id":"https://openalex.org/C124975894","wikidata":"https://www.wikidata.org/wiki/Q7293290","display_name":"Ranking SVM","level":3,"score":0.31540000438690186},{"id":"https://openalex.org/C2777723229","wikidata":"https://www.wikidata.org/wiki/Q4367921","display_name":"Learnability","level":2,"score":0.31040000915527344},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.30320000648498535},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.29820001125335693},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.2937999963760376},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2741999924182892},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.259799987077713},{"id":"https://openalex.org/C2777561058","wikidata":"https://www.wikidata.org/wiki/Q2652119","display_name":"Program comprehension","level":4,"score":0.25780001282691956},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.25200000405311584},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2505879.2505884","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2505879.2505884","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1306.1901","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1306.1901","pdf_url":"https://arxiv.org/pdf/1306.1901","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-01451694v1","is_oa":true,"landing_page_url":"https://hal.univ-reunion.fr/hal-01451694","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"15th International Symposium on Principles and Practice of Declarative Programming, PPDP '13, Sep 2013, Madrid, Spain. pp.229--238, ⟨10.1145/2505879.2505884⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1306.1901","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1306.1901","pdf_url":"https://arxiv.org/pdf/1306.1901","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1530375435","https://openalex.org/W1541144457","https://openalex.org/W1561261246","https://openalex.org/W1575647584","https://openalex.org/W1585194019","https://openalex.org/W1636451832","https://openalex.org/W1888810575","https://openalex.org/W1971872488","https://openalex.org/W1989462119","https://openalex.org/W1996245589","https://openalex.org/W2039525895","https://openalex.org/W2048854494","https://openalex.org/W2062873592","https://openalex.org/W2094997043","https://openalex.org/W2110820023","https://openalex.org/W2114695797","https://openalex.org/W2120647256","https://openalex.org/W2124765047","https://openalex.org/W4232668957","https://openalex.org/W6680945863","https://openalex.org/W6683184351"],"related_works":[],"abstract_inverted_index":{"Program":[0],"termination":[1,19,69],"is":[2],"a":[3,71,101],"hot":[4],"research":[5],"topic":[6],"in":[7],"program":[8],"analysis.":[9],"The":[10],"last":[11],"few":[12],"years":[13],"have":[14],"witnessed":[15],"the":[16,45,86,105],"development":[17],"of":[18,47,70,74,81,88,104,112],"analyzers":[20],"for":[21,63,84],"programming":[22],"languages":[23],"such":[24],"as":[25],"C":[26],"and":[27,32,41,110],"Java":[28],"with":[29],"remarkable":[30],"precision":[31],"performance.":[33],"These":[34],"systems":[35],"are":[36],"largely":[37],"based":[38,59],"on":[39,60],"techniques":[40],"tools":[42],"coming":[43],"from":[44],"field":[46],"declarative":[48],"constraint":[49],"programming.":[50],"In":[51],"this":[52,82,113],"paper,":[53],"we":[54,77],"first":[55],"recall":[56],"an":[57,79],"algorithm":[58],"Farkas'":[61],"Lemma":[62],"discovering":[64],"linear":[65,90,94],"ranking":[66,91,98],"functions":[67,95,99],"proving":[68],"certain":[72],"class":[73],"loops.":[75],"Then":[76],"propose":[78],"extension":[80],"method":[83],"showing":[85],"existence":[87],"eventual":[89],"functions,":[92],"i.e.,":[93],"that":[96],"become":[97],"after":[100],"finite":[102],"unrolling":[103],"loop.":[106],"We":[107],"show":[108],"correctness":[109],"completeness":[111],"algorithm.":[114]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}