{"id":"https://openalex.org/W2129830933","doi":"https://doi.org/10.1109/fmcad.2009.5351144","title":"Verification of recursive methods on tree-like data structures","display_name":"Verification of recursive methods on tree-like data structures","publication_year":2009,"publication_date":"2009-11-01","ids":{"openalex":"https://openalex.org/W2129830933","doi":"https://doi.org/10.1109/fmcad.2009.5351144","mag":"2129830933"},"language":"en","primary_location":{"id":"doi:10.1109/fmcad.2009.5351144","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2009.5351144","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Formal Methods in Computer-Aided Design","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/A5057473400","display_name":"Jyotirmoy V. Deshmukh","orcid":"https://orcid.org/0000-0003-4683-5540"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jyotirmoy Deshmukh","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Texas, Austin, USA","[Department of Electrical and Computer Engineering, University of Texas at Austin.]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Texas, Austin, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"[Department of Electrical and Computer Engineering, University of Texas at Austin.]","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022535511","display_name":"E. Allen Emerson","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. Allen Emerson","raw_affiliation_strings":["Department of Computer Science, University of Texas, Austin, USA","Dept. of Computer Science, University of Texas at Austin#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Austin, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Dept. of Computer Science, University of Texas at Austin#TAB#","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057473400"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":0.4362,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73824062,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"33","last_page":"40"},"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.9997000098228455,"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.9997000098228455,"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.9991000294685364,"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.998199999332428,"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/computer-science","display_name":"Computer science","score":0.8040109872817993},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6836295127868652},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6281971335411072},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5911779999732971},{"id":"https://openalex.org/keywords/pointer","display_name":"Pointer (user interface)","score":0.5708523988723755},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5648396015167236},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5222740173339844},{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.5092958211898804},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.5033170580863953},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5001001358032227},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.4828837215900421},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.44528335332870483},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.4441129267215729},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.43273913860321045},{"id":"https://openalex.org/keywords/linked-list","display_name":"Linked list","score":0.43229275941848755},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.4263526201248169},{"id":"https://openalex.org/keywords/abstract-syntax-tree","display_name":"Abstract syntax tree","score":0.4254530072212219},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.25285202264785767},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.15722191333770752}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8040109872817993},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6836295127868652},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6281971335411072},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5911779999732971},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.5708523988723755},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5648396015167236},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5222740173339844},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.5092958211898804},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.5033170580863953},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5001001358032227},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.4828837215900421},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.44528335332870483},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.4441129267215729},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.43273913860321045},{"id":"https://openalex.org/C146101286","wikidata":"https://www.wikidata.org/wiki/Q7003418","display_name":"Linked list","level":2,"score":0.43229275941848755},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.4263526201248169},{"id":"https://openalex.org/C58646249","wikidata":"https://www.wikidata.org/wiki/Q127380","display_name":"Abstract syntax tree","level":3,"score":0.4254530072212219},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.25285202264785767},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.15722191333770752},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fmcad.2009.5351144","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2009.5351144","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Formal Methods in Computer-Aided Design","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":34,"referenced_works":["https://openalex.org/W1483359125","https://openalex.org/W1505309070","https://openalex.org/W1508811155","https://openalex.org/W1522742464","https://openalex.org/W1533299090","https://openalex.org/W1537777555","https://openalex.org/W1552505815","https://openalex.org/W1577233792","https://openalex.org/W1595182411","https://openalex.org/W1604924060","https://openalex.org/W1851346840","https://openalex.org/W1975156572","https://openalex.org/W1988441831","https://openalex.org/W1991837261","https://openalex.org/W1994584977","https://openalex.org/W2108611287","https://openalex.org/W2112476716","https://openalex.org/W2136767512","https://openalex.org/W2137628566","https://openalex.org/W2147121279","https://openalex.org/W2147492162","https://openalex.org/W2163151383","https://openalex.org/W3100190719","https://openalex.org/W4285719527","https://openalex.org/W4391979734","https://openalex.org/W6628944087","https://openalex.org/W6630700474","https://openalex.org/W6631180258","https://openalex.org/W6632916876","https://openalex.org/W6636256795","https://openalex.org/W6639018528","https://openalex.org/W6643842212","https://openalex.org/W6676410049","https://openalex.org/W6680717844"],"related_works":["https://openalex.org/W2030110905","https://openalex.org/W2288580478","https://openalex.org/W4322731711","https://openalex.org/W2518341045","https://openalex.org/W2774310322","https://openalex.org/W1485199833","https://openalex.org/W2011836220","https://openalex.org/W2773551912","https://openalex.org/W2564254289","https://openalex.org/W134837158"],"abstract_inverted_index":{"Programs":[0],"that":[1,56],"manipulate":[2],"heap-allocated":[3],"data":[4],"structures":[5],"present":[6,46],"a":[7,23,47,52],"formidable":[8],"challenge":[9],"for":[10,22,59],"algorithmic":[11],"verification.":[12],"Recursive":[13],"procedures":[14],"(methods)":[15],"in":[16,42,69,74,83,107,120],"such":[17,38,100,127],"software":[18],"libraries":[19],"are":[20],"used":[21,96],"large":[24],"number":[25],"of":[26,37,57,77,105,135],"tasks":[27],"ranging":[28],"from":[29],"simple":[30],"traversals":[31],"to":[32,55,97,125],"complex":[33],"structural":[34],"transformations.":[35],"Verification":[36],"methods":[39,67,99],"is":[40,81],"undecidable":[41],"general.":[43],"Hence,":[44],"we":[45],"programming":[48],"language":[49],"fragment":[50],"with":[51,123],"syntax":[53],"similar":[54],"C":[58],"which":[60],"correctness":[61],"can":[62,94],"be":[63,95],"algorithmically":[64],"checked.":[65],"For":[66],"written":[68],"our":[70,89],"fragment,":[71],"and":[72,103,118,133],"specifications":[73,126],"the":[75],"form":[76],"tree":[78],"automata,":[79],"verification":[80],"efficient":[82],"most":[84],"cases,":[85],"as":[86,101,128],"illustrated":[87],"by":[88],"prototype":[90],"tool.":[91],"Our":[92],"framework":[93],"verify":[98],"insertion":[102],"deletion":[104],"nodes":[106],"k-ary":[108],"trees,":[109,112,122],"binary":[110],"search":[111],"linked":[113,115],"lists,":[114],"list":[116],"reversal,":[117],"rotations":[119],"balanced":[121],"respect":[124],"acyclicity,":[129],"sortedness,":[130],"list-ness,":[131],"tree-ness,":[132],"absence":[134],"null":[136],"pointer":[137],"dereferences.":[138]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}