{"id":"https://openalex.org/W6930237098","doi":"https://doi.org/10.5281/zenodo.11217414","title":"Exploring the Effectiveness of Abstract Syntax Tree Patterns for Algorithm Recognition - Reproducability Package","display_name":"Exploring the Effectiveness of Abstract Syntax Tree Patterns for Algorithm Recognition - Reproducability Package","publication_year":2024,"publication_date":"2024-05-23","ids":{"openalex":"https://openalex.org/W6930237098","doi":"https://doi.org/10.5281/zenodo.11217414"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.11217414","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.11217414","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Software"},"type":"software","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5281/zenodo.11217414","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Denis, Neum\u00fcller","orcid":"https://orcid.org/0000-0003-0987-185X"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Denis, Neum\u00fcller","raw_affiliation_strings":["University of Ulm"],"raw_orcid":"https://orcid.org/0000-0003-0987-185X","affiliations":[{"raw_affiliation_string":"University of Ulm","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Sihler, Florian","orcid":"https://orcid.org/0000-0001-7195-7801"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sihler, Florian","raw_affiliation_strings":["University of Ulm"],"raw_orcid":"https://orcid.org/0000-0001-7195-7801","affiliations":[{"raw_affiliation_string":"University of Ulm","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Straub, Raphael","orcid":"https://orcid.org/0009-0007-8534-0053"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Straub, Raphael","raw_affiliation_strings":["University of Ulm"],"raw_orcid":"https://orcid.org/0009-0007-8534-0053","affiliations":[{"raw_affiliation_string":"University of Ulm","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"last","author":{"id":null,"display_name":"Tichy, Matthias","orcid":"https://orcid.org/0000-0002-9067-3748"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tichy, Matthias","raw_affiliation_strings":["University of Ulm"],"raw_orcid":"https://orcid.org/0000-0002-9067-3748","affiliations":[{"raw_affiliation_string":"University of Ulm","institution_ids":["https://openalex.org/I196349391"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I196349391"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10483","display_name":"Nerve injury and regeneration","score":0.8866000175476074,"subfield":{"id":"https://openalex.org/subfields/2804","display_name":"Cellular and Molecular Neuroscience"},"field":{"id":"https://openalex.org/fields/28","display_name":"Neuroscience"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10483","display_name":"Nerve injury and regeneration","score":0.8866000175476074,"subfield":{"id":"https://openalex.org/subfields/2804","display_name":"Cellular and Molecular Neuroscience"},"field":{"id":"https://openalex.org/fields/28","display_name":"Neuroscience"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10196","display_name":"Pain Mechanisms and Treatments","score":0.014600000344216824,"subfield":{"id":"https://openalex.org/subfields/2737","display_name":"Physiology"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T12301","display_name":"Facial Nerve Paralysis Treatment and Research","score":0.012400000356137753,"subfield":{"id":"https://openalex.org/subfields/2728","display_name":"Neurology"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/abstract-syntax-tree","display_name":"Abstract syntax tree","score":0.7296000123023987},{"id":"https://openalex.org/keywords/syntax","display_name":"Syntax","score":0.5378000140190125},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5372999906539917},{"id":"https://openalex.org/keywords/usability","display_name":"Usability","score":0.5052000284194946},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5042999982833862},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.49459999799728394},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4652999937534332},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44600000977516174},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.4203999936580658},{"id":"https://openalex.org/keywords/syntax-error","display_name":"Syntax error","score":0.4115000069141388}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8504999876022339},{"id":"https://openalex.org/C58646249","wikidata":"https://www.wikidata.org/wiki/Q127380","display_name":"Abstract syntax tree","level":3,"score":0.7296000123023987},{"id":"https://openalex.org/C60048249","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntax","level":2,"score":0.5378000140190125},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5372999906539917},{"id":"https://openalex.org/C170130773","wikidata":"https://www.wikidata.org/wiki/Q216378","display_name":"Usability","level":2,"score":0.5052000284194946},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5048999786376953},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5042999982833862},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.49459999799728394},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4652999937534332},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4603999853134155},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44600000977516174},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.4203999936580658},{"id":"https://openalex.org/C11742125","wikidata":"https://www.wikidata.org/wiki/Q1195374","display_name":"Syntax error","level":4,"score":0.4115000069141388},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.39070001244544983},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.390500009059906},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3849000036716461},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.38370001316070557},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.38260000944137573},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.37290000915527344},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.37220001220703125},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.3407000005245209},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.328900009393692},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.31209999322891235},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3075999915599823},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.302700012922287},{"id":"https://openalex.org/C114408938","wikidata":"https://www.wikidata.org/wiki/Q333373","display_name":"Abstract syntax","level":3,"score":0.30250000953674316},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.30219998955726624},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.29750001430511475},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.28769999742507935},{"id":"https://openalex.org/C110083411","wikidata":"https://www.wikidata.org/wiki/Q1744628","display_name":"Statistical classification","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.2784000039100647},{"id":"https://openalex.org/C91071405","wikidata":"https://www.wikidata.org/wiki/Q1413145","display_name":"Program slicing","level":3,"score":0.2700999975204468},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.2687000036239624},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.263700008392334},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.2605000138282776}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5281/zenodo.11217414","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.11217414","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Software"}],"best_oa_location":{"id":"doi:10.5281/zenodo.11217414","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.11217414","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Software"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"is":[1,121],"the":[2,6,9,30,33,38,45,52,74,78,101,135,163,177,208,216,232,252,279],"reproducibility":[3],"package":[4],"for":[5,16,143,271],"paper":[7,39],"\"Exploring":[8],"Effectiveness":[10],"of":[11,32,59,103,139,166,192,215,231,249,276],"Abstract":[12],"Syntax":[13],"Tree":[14],"Patterns":[15],"Algorithm":[17],"Recognition\"":[18],"published":[19],"at":[20],"ICCQ":[21],"2024.":[22],"It":[23],"includes:":[24],"Instructions":[25],"on":[26,134,176,228],"how":[27,129],"to":[28,161,171,184,194],"reproduce":[29],"results":[31],"AlDeSCo":[34],"prototype":[35,154,227],"presented":[36],"in":[37,51,77,97],"and":[40,67,88,99,118,169,188,211,241],"run":[41],"own":[42],"experiments":[43],"with":[44,220],"tooling.":[46],"The":[47,56],"raw":[48],"data":[49],"used":[50,170],"paper.":[53],"Paper":[54],"Abstract:":[55],"automated":[57],"recognition":[58],"algorithm":[60,145,168,183,209],"implementations":[61,219],"can":[62,95],"support":[63],"many":[64],"software":[65],"maintenance":[66],"re-engineering":[68],"activities":[69],"by":[70],"providing":[71],"knowledge":[72],"about":[73],"concerns":[75],"present":[76],"code":[79,264],"base.":[80],"Moreover,":[81],"recognizing":[82],"inefficient":[83],"algorithms":[84,236],"like":[85,237],"Bubble":[86,239],"Sort":[87],"suggesting":[89],"superior":[90],"alternatives":[91],"from":[92,107,111],"a":[93,104,140,153,173,181,204,229,269,274],"library":[94],"help":[96],"assessing":[98],"improving":[100],"quality":[102],"system.":[105],"Approaches":[106],"related":[108],"work":[109],"suffer":[110],"usability":[112],"as":[113,115,268],"well":[114,130],"scalability":[116],"issues":[117],"their":[119],"accuracy":[120],"not":[122],"evaluated.":[123],"In":[124],"this":[125,148],"paper,":[126],"we":[127,150,202,261],"investigate":[128],"our":[131,199,221,226],"approach":[132],"based":[133],"abstract":[136,178],"syntax":[137,179],"tree":[138],"program":[141],"performs":[142],"automatic":[144],"recognition.":[146],"To":[147,197],"end,":[149],"have":[151],"implemented":[152],"consisting":[155],"of:":[156],"A":[157],"domain-specific":[158,222],"language":[159,254],"designed":[160],"capture":[162],"key":[164,213],"features":[165,214],"an":[167,189,246],"express":[172],"search":[174,200,206],"pattern":[175],"tree,":[180],"matching":[182],"find":[185],"these":[186],"features,":[187],"initial":[190],"catalog":[191],"\"ready":[193],"use\"":[195],"patterns.":[196],"create":[198],"patterns":[201],"performed":[203],"web":[205],"using":[207],"name":[210],"described":[212],"found":[217],"reference":[218],"language.":[223],"We":[224,244],"evaluate":[225],"subset":[230],"BigCloneEval":[233],"benchmark":[234],"containing":[235],"Fibonacci,":[238],"Sort,":[240],"Binary":[242],"Search.":[243],"achieve":[245],"average":[247],"F1-score":[248],"0.74":[250],"outperforming":[251],"large":[253],"model":[255],"Codellama":[256],"which":[257],"attains":[258],"0.35.":[259],"Additionally,":[260],"use":[262],"multiple":[263],"clone":[265],"detection":[266],"tools":[267],"baseline":[270],"comparison,":[272],"achieving":[273],"recall":[275],"0.62":[277],"while":[278],"best-performing":[280],"tool":[281],"reaches":[282],"0.20.":[283]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-10-10T00:00:00"}