{"id":"https://openalex.org/W2398327122","doi":"https://doi.org/10.1109/fmcad.2015.7542253","title":"Compositional recurrence analysis","display_name":"Compositional recurrence analysis","publication_year":2015,"publication_date":"2015-09-01","ids":{"openalex":"https://openalex.org/W2398327122","doi":"https://doi.org/10.1109/fmcad.2015.7542253","mag":"2398327122"},"language":"en","primary_location":{"id":"doi:10.1109/fmcad.2015.7542253","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2015.7542253","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 Formal Methods in Computer-Aided Design (FMCAD)","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/A5016276143","display_name":"Azadeh Farzan","orcid":"https://orcid.org/0000-0001-9005-2653"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Azadeh Farzan","raw_affiliation_strings":["University of Toronto University of Toronto"],"affiliations":[{"raw_affiliation_string":"University of Toronto University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041698482","display_name":"Zachary Kincaid","orcid":"https://orcid.org/0000-0002-7294-9165"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Zachary Kincaid","raw_affiliation_strings":["University of Toronto University of Toronto"],"affiliations":[{"raw_affiliation_string":"University of Toronto University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016276143"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":3.6385,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.93618423,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"57","last_page":"64"},"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.9998000264167786,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/abstraction","display_name":"Abstraction","score":0.7437872886657715},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6246365904808044},{"id":"https://openalex.org/keywords/transition","display_name":"Transition (genetics)","score":0.6008691787719727},{"id":"https://openalex.org/keywords/transition-system","display_name":"Transition system","score":0.5079870820045471},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.4598880708217621},{"id":"https://openalex.org/keywords/recurrence-relation","display_name":"Recurrence relation","score":0.4240010976791382},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4178812503814697},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.41646867990493774},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39661967754364014},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.33907365798950195},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3327904939651489},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22983455657958984},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.09017488360404968},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06755185127258301}],"concepts":[{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.7437872886657715},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6246365904808044},{"id":"https://openalex.org/C194232998","wikidata":"https://www.wikidata.org/wiki/Q1606712","display_name":"Transition (genetics)","level":3,"score":0.6008691787719727},{"id":"https://openalex.org/C2779167558","wikidata":"https://www.wikidata.org/wiki/Q176468","display_name":"Transition system","level":2,"score":0.5079870820045471},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.4598880708217621},{"id":"https://openalex.org/C201292218","wikidata":"https://www.wikidata.org/wiki/Q740970","display_name":"Recurrence relation","level":2,"score":0.4240010976791382},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4178812503814697},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.41646867990493774},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39661967754364014},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.33907365798950195},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3327904939651489},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22983455657958984},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.09017488360404968},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06755185127258301},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fmcad.2015.7542253","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2015.7542253","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 Formal Methods in Computer-Aided Design (FMCAD)","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":39,"referenced_works":["https://openalex.org/W139856780","https://openalex.org/W148396834","https://openalex.org/W183831629","https://openalex.org/W1480909796","https://openalex.org/W1500085611","https://openalex.org/W1518247129","https://openalex.org/W1527560342","https://openalex.org/W1535183500","https://openalex.org/W1547584984","https://openalex.org/W1550288578","https://openalex.org/W1580450019","https://openalex.org/W1585981132","https://openalex.org/W1600009974","https://openalex.org/W1603048013","https://openalex.org/W1603182045","https://openalex.org/W1771118579","https://openalex.org/W1821880317","https://openalex.org/W1844529821","https://openalex.org/W1921152384","https://openalex.org/W1963547452","https://openalex.org/W1967845657","https://openalex.org/W1969311876","https://openalex.org/W2021437589","https://openalex.org/W2044738061","https://openalex.org/W2074131210","https://openalex.org/W2095810701","https://openalex.org/W2107089133","https://openalex.org/W2119179558","https://openalex.org/W2140678594","https://openalex.org/W2157056800","https://openalex.org/W2171834078","https://openalex.org/W2218365969","https://openalex.org/W2952380519","https://openalex.org/W3158747708","https://openalex.org/W4256585318","https://openalex.org/W4285719527","https://openalex.org/W4294611706","https://openalex.org/W4298262456","https://openalex.org/W6607522719"],"related_works":["https://openalex.org/W3160136729","https://openalex.org/W2172022734","https://openalex.org/W4251521700","https://openalex.org/W2050680750","https://openalex.org/W2786344256","https://openalex.org/W2008395018","https://openalex.org/W1830380692","https://openalex.org/W2165049295","https://openalex.org/W1603666985","https://openalex.org/W2398327122"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,17,25,45,66],"new":[4],"method":[5,83],"for":[6,11,48,57,69],"automatically":[7],"generating":[8],"numerical":[9],"invariants":[10],"imperative":[12],"programs.":[13],"The":[14],"procedure":[15],"computes":[16],"transition":[18,46,67],"formula":[19,47,68],"which":[20],"overapproximates":[21],"the":[22,33,40,70],"behaviour":[23],"of":[24],"given":[26],"input":[27],"program.":[28],"It":[29],"is":[30,84],"compositional":[31],"in":[32],"sense":[34],"that":[35,81],"it":[36],"operates":[37],"by":[38,61],"decomposing":[39],"program":[41],"into":[42],"parts,":[43],"computing":[44,75],"each":[49],"part,":[50],"and":[51,73],"then":[52,74],"composing":[53],"them.":[54],"Transition":[55],"formulas":[56],"loops":[58],"are":[59],"computed":[60],"extracting":[62],"recurrence":[63],"relations":[64],"from":[65],"loop":[71],"body":[72],"their":[76],"closed":[77],"forms.":[78],"Experimentation":[79],"demonstrates":[80],"this":[82],"competitive":[85],"with":[86],"leading":[87],"verification":[88],"techniques":[89],"based":[90],"on":[91],"abstraction":[92],"refinement.":[93]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}