{"id":"https://openalex.org/W2149621559","doi":"https://doi.org/10.1109/iscsct.2008.58","title":"Termination of Nested Loop","display_name":"Termination of Nested Loop","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2149621559","doi":"https://doi.org/10.1109/iscsct.2008.58","mag":"2149621559"},"language":"en","primary_location":{"id":"doi:10.1109/iscsct.2008.58","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscsct.2008.58","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 International Symposium on Computer Science and Computational Technology","raw_type":"proceedings-article"},"type":"conference-paper","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/A5013347813","display_name":"Bin Wu","orcid":"https://orcid.org/0000-0002-1511-2457"},"institutions":[{"id":"https://openalex.org/I4210139618","display_name":"Shanghai Key Laboratory of Trustworthy Computing","ror":"https://ror.org/030qbr085","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210139618"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bin Wu","raw_affiliation_strings":["Shanghai Key Laboratory of Trustworthy Computing, East China Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Key Laboratory of Trustworthy Computing, East China Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I4210139618"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068537006","display_name":"Zhongqin Bi","orcid":"https://orcid.org/0000-0001-8815-4845"},"institutions":[{"id":"https://openalex.org/I4210139618","display_name":"Shanghai Key Laboratory of Trustworthy Computing","ror":"https://ror.org/030qbr085","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210139618"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhongqin Bi","raw_affiliation_strings":["Shanghai Key Laboratory of Trustworthy Computing, East China Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Key Laboratory of Trustworthy Computing, East China Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I4210139618"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210139618"],"apc_list":null,"apc_paid":null,"fwci":0.8571,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.71097964,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2988","issue":null,"first_page":"536","last_page":"539"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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/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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9929999709129333,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.8043473958969116},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6928622126579285},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.692453920841217},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6755561828613281},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.6162346601486206},{"id":"https://openalex.org/keywords/normalization-property","display_name":"Normalization property","score":0.5464465022087097},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4397445321083069},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43787795305252075},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43516698479652405},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.294347882270813},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2602337598800659},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.190146803855896},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.13438564538955688},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10970509052276611}],"concepts":[{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.8043473958969116},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6928622126579285},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.692453920841217},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6755561828613281},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.6162346601486206},{"id":"https://openalex.org/C159333733","wikidata":"https://www.wikidata.org/wiki/Q7051809","display_name":"Normalization property","level":2,"score":0.5464465022087097},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4397445321083069},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43787795305252075},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43516698479652405},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.294347882270813},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2602337598800659},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.190146803855896},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.13438564538955688},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10970509052276611},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscsct.2008.58","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscsct.2008.58","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 International Symposium on Computer Science and Computational Technology","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":13,"referenced_works":["https://openalex.org/W1503537039","https://openalex.org/W1530375435","https://openalex.org/W1541144457","https://openalex.org/W1593745409","https://openalex.org/W1599321461","https://openalex.org/W2101743103","https://openalex.org/W2119409553","https://openalex.org/W2121365859","https://openalex.org/W2132661148","https://openalex.org/W2136333450","https://openalex.org/W2137740677","https://openalex.org/W2293708017","https://openalex.org/W4248689402"],"related_works":["https://openalex.org/W1776429635","https://openalex.org/W154155438","https://openalex.org/W4205359103","https://openalex.org/W2481821631","https://openalex.org/W2058764256","https://openalex.org/W2114948246","https://openalex.org/W2052992886","https://openalex.org/W2117007419","https://openalex.org/W2182178328","https://openalex.org/W2001294731"],"abstract_inverted_index":{"The":[0,43],"verification":[1],"of":[2,10,22,40,49],"termination":[3,16,39,48],"is":[4],"a":[5],"difficult":[6],"problem.":[7],"While":[8],"most":[9],"the":[11,20,47,61],"recent":[12],"work":[13],"on":[14,19,34],"automated":[15],"proofs":[17],"focuses":[18],"construction":[21],"linear":[23,57],"ranking":[24,58],"functions":[25],"for":[26],"unnested":[27],"loops,":[28],"we":[29,63],"present":[30],"an":[31],"algorithm":[32],"based":[33],"region":[35],"graphs":[36],"to":[37],"prove":[38,46],"nested":[41,51],"loops.":[42],"method":[44],"can":[45],"terminating":[50],"loops":[52],"that":[53],"may":[54],"not":[55],"have":[56,64],"function.":[59],"For":[60],"programs":[62],"considered,":[65],"this":[66],"approach":[67],"converges":[68],"faster":[69],"and":[70],"sufficiently.":[71]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}