{"id":"https://openalex.org/W4214484086","doi":"https://doi.org/10.1145/3503222.3507751","title":"Tree traversal synthesis using domain-specific symbolic compilation","display_name":"Tree traversal synthesis using domain-specific symbolic compilation","publication_year":2022,"publication_date":"2022-02-22","ids":{"openalex":"https://openalex.org/W4214484086","doi":"https://doi.org/10.1145/3503222.3507751"},"language":"en","primary_location":{"id":"doi:10.1145/3503222.3507751","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3503222.3507751","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3503222.3507751","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3503222.3507751","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101573237","display_name":"Yanju Chen","orcid":"https://orcid.org/0000-0002-6494-3126"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yanju Chen","raw_affiliation_strings":["University of California at Santa Barbara, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102883539","display_name":"Junrui Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Junrui Liu","raw_affiliation_strings":["University of California at Santa Barbara, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101567136","display_name":"Yu Feng","orcid":"https://orcid.org/0000-0003-1000-1229"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yu Feng","raw_affiliation_strings":["University of California at Santa Barbara, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085160432","display_name":"Rastislav Bod\u00edk","orcid":"https://orcid.org/0000-0001-6639-1647"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rastislav Bodik","raw_affiliation_strings":["University of Washington, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington, USA","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9513,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.71914648,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1030","last_page":"1042"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9986000061035156,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.8501330018043518},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8009846806526184},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6551311016082764},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6262373328208923},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5239920020103455},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5187666416168213},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5104042887687683},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.45513734221458435},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4476795792579651},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09792932868003845}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.8501330018043518},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8009846806526184},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6551311016082764},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6262373328208923},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5239920020103455},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5187666416168213},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5104042887687683},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.45513734221458435},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4476795792579651},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09792932868003845},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3503222.3507751","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3503222.3507751","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3503222.3507751","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3503222.3507751","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3503222.3507751","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3503222.3507751","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2233570209","display_name":"Convergence Accelerator Phase I (RAISE): Linking the Open Knowledge Network to the Web with End-User Programming","funder_award_id":"1936731","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5292072049","display_name":"FMitF: Track II: Programming by Demonstration for the Browser with Applications in Data Science","funder_award_id":"1918027","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5985606540","display_name":"SaTC: CORE: Medium: Collaborative: Effective Formal Reasoning for Mobile Malware","funder_award_id":"1908494","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G731481035","display_name":"CAPA: Collaborative Research: ARION: Taming Heterogeneity with DSLs, Approximation, and Synthesis","funder_award_id":"1723352","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306087","display_name":"Semiconductor Research Corporation","ror":"https://ror.org/047z4n946"},{"id":"https://openalex.org/F4320308258","display_name":"Qualcomm","ror":"https://ror.org/002zrf773"},{"id":"https://openalex.org/F4320308737","display_name":"Facebook","ror":"https://ror.org/01zbnvs85"},{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4214484086.pdf","grobid_xml":"https://content.openalex.org/works/W4214484086.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W146699588","https://openalex.org/W1813837568","https://openalex.org/W1964071625","https://openalex.org/W1987398446","https://openalex.org/W1990761038","https://openalex.org/W1992580684","https://openalex.org/W1994650182","https://openalex.org/W2040924900","https://openalex.org/W2049639527","https://openalex.org/W2051389247","https://openalex.org/W2051785652","https://openalex.org/W2057156093","https://openalex.org/W2066466217","https://openalex.org/W2079605657","https://openalex.org/W2098884876","https://openalex.org/W2110848488","https://openalex.org/W2116368564","https://openalex.org/W2153131284","https://openalex.org/W2163671349","https://openalex.org/W2166708428","https://openalex.org/W2201238838","https://openalex.org/W2219864925","https://openalex.org/W2294628582","https://openalex.org/W2538528660","https://openalex.org/W2623675588","https://openalex.org/W2728654551","https://openalex.org/W2761240515","https://openalex.org/W2798604085","https://openalex.org/W2806689062","https://openalex.org/W2954053416","https://openalex.org/W2964240296","https://openalex.org/W2964342690"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4252596799","https://openalex.org/W4254594467","https://openalex.org/W4230405657","https://openalex.org/W244044452","https://openalex.org/W2552915643","https://openalex.org/W3213135344","https://openalex.org/W170547082","https://openalex.org/W4229950834","https://openalex.org/W3107197685"],"abstract_inverted_index":{"Efficient":[0],"computation":[1,24],"on":[2],"tree":[3,30],"data":[4],"structures":[5],"is":[6,18],"important":[7],"in":[8,37,51],"compilers,":[9],"numeric":[10],"computations,":[11],"and":[12,32,76],"web":[13,52],"browser":[14],"layout":[15],"engines.":[16],"Efficiency":[17],"achieved":[19],"by":[20,33],"statically":[21],"scheduling":[22],"the":[23,35,72,78],"into":[25],"a":[26,64],"small":[27],"number":[28,79],"of":[29,43,66,80],"traversals":[31,36,45],"performing":[34],"parallel":[38],"when":[39],"possible.":[40],"Manual":[41],"design":[42],"such":[44],"leads":[46],"to":[47],"bugs,":[48],"as":[49],"observed":[50],"browsers.":[53],"Automatic":[54],"schedulers":[55],"avoid":[56],"these":[57],"bugs":[58],"but":[59],"they":[60],"currently":[61],"cannot":[62],"explore":[63],"space":[65],"legal":[67],"traversals,":[68],"which":[69],"prevents":[70],"exploring":[71],"trade-offs":[73],"between":[74],"parallelism":[75],"minimizing":[77],"traversals.":[81]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}