{"id":"https://openalex.org/W4387793311","doi":"https://doi.org/10.1145/3618305.3623601","title":"An Optimal Structure-Aware Code Difference Framework with MaxSAT-Solver","display_name":"An Optimal Structure-Aware Code Difference Framework with MaxSAT-Solver","publication_year":2023,"publication_date":"2023-10-19","ids":{"openalex":"https://openalex.org/W4387793311","doi":"https://doi.org/10.1145/3618305.3623601"},"language":"en","primary_location":{"id":"doi:10.1145/3618305.3623601","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3618305.3623601","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618305.3623601?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Companion Proceedings of the 2023 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618305.3623601?download=true","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037693613","display_name":"Haolin Ye","orcid":"https://orcid.org/0000-0002-7402-617X"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Haolin Ye","raw_affiliation_strings":["McGill University, Longueuil, Canada"],"affiliations":[{"raw_affiliation_string":"McGill University, Longueuil, Canada","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037693613"],"corresponding_institution_ids":["https://openalex.org/I5023651"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17054765,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2021","issue":null,"first_page":"43","last_page":"45"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12127","display_name":"Software System Performance and Reliability","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12127","display_name":"Software System Performance and Reliability","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10639","display_name":"Advanced Software Engineering Methodologies","score":0.9954000115394592,"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/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.7876174449920654},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6914755702018738},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5810001492500305},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5637673139572144},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.41936415433883667},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37594160437583923},{"id":"https://openalex.org/keywords/computational-science","display_name":"Computational science","score":0.3325381278991699},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.24437692761421204},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.06956884264945984}],"concepts":[{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.7876174449920654},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6914755702018738},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5810001492500305},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5637673139572144},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41936415433883667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37594160437583923},{"id":"https://openalex.org/C459310","wikidata":"https://www.wikidata.org/wiki/Q117801","display_name":"Computational science","level":1,"score":0.3325381278991699},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.24437692761421204},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.06956884264945984},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3618305.3623601","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3618305.3623601","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618305.3623601?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Companion Proceedings of the 2023 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3618305.3623601","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3618305.3623601","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618305.3623601?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Companion Proceedings of the 2023 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4387793311.pdf","grobid_xml":"https://content.openalex.org/works/W4387793311.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W2964296984"],"related_works":["https://openalex.org/W2056396287","https://openalex.org/W1604758548","https://openalex.org/W2804126825","https://openalex.org/W4367553810","https://openalex.org/W2104142636","https://openalex.org/W1549048322","https://openalex.org/W2015141752","https://openalex.org/W2731831065","https://openalex.org/W4283162424","https://openalex.org/W2271439649"],"abstract_inverted_index":{"The":[0],"Abstract":[1],"Syntax":[2],"Tree":[3],"(AST)":[4],"serves":[5],"as":[6,39,106],"a":[7,14,81,87,107],"pivotal":[8],"representation":[9],"of":[10,19,49],"program":[11],"codes,":[12],"offering":[13],"structured":[15],"and":[16,41,52,74,101,119],"hierarchical":[17],"view":[18],"the":[20,27,50,54,111,116,121],"program\u2019s":[21],"syntax.":[22],"When":[23],"developers":[24],"modify":[25],"code,":[26],"underlying":[28],"AST":[29,51],"also":[30],"evolves":[31],"to":[32,45,92],"reflect":[33],"these":[34,60],"changes.":[35],"Tree-diff":[36],"algorithms,":[37],"such":[38],"truediff":[40],"Gumtreediff,":[42],"are":[43,62],"developed":[44],"compare":[46],"different":[47],"versions":[48],"identify":[53],"modifications":[55],"made":[56],"between":[57],"them.":[58],"However,":[59],"heuristics":[61],"based":[63],"on":[64],"certain":[65],"vertex":[66,99,123],"matching":[67,124],"methods":[68],"that":[69,85],"do":[70],"not":[71],"ensure":[72],"optimality":[73],"preciseness.":[75],"In":[76],"this":[77,94],"study,":[78],"I":[79],"propose":[80],"novel":[82],"tree-diff":[83,108],"approach":[84],"utilizes":[86],"MaxSAT":[88,112],"(Maximum":[89],"satisfiability)":[90],"solver":[91,113],"address":[93],"issue.":[95],"By":[96],"encoding":[97],"potential":[98],"matches":[100],"edges":[102],"with":[103],"associated":[104],"costs":[105],"SAT":[109],"problem,":[110],"effectively":[114],"minimizes":[115],"edit":[117],"distance":[118],"reveals":[120],"optimal":[122],"plan.":[125]},"counts_by_year":[],"updated_date":"2026-03-07T13:37:22.277990","created_date":"2025-10-10T00:00:00"}