{"id":"https://openalex.org/W3175382085","doi":"https://doi.org/10.1145/3460946.3464314","title":"Program analysis for reversible languages","display_name":"Program analysis for reversible languages","publication_year":2021,"publication_date":"2021-06-18","ids":{"openalex":"https://openalex.org/W3175382085","doi":"https://doi.org/10.1145/3460946.3464314","mag":"3175382085"},"language":"en","primary_location":{"id":"doi:10.1145/3460946.3464314","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3460946.3464314","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis","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/A5023883599","display_name":"Niklas Deworetzki","orcid":"https://orcid.org/0000-0002-7276-7708"},"institutions":[{"id":"https://openalex.org/I45155027","display_name":"Technische Hochschule Mittelhessen","ror":"https://ror.org/02qdc9985","country_code":"DE","type":"education","lineage":["https://openalex.org/I45155027"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Niklas Deworetzki","raw_affiliation_strings":["TH Mittelhessen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TH Mittelhessen, Germany","institution_ids":["https://openalex.org/I45155027"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000744880","display_name":"Uwe Meyer","orcid":"https://orcid.org/0000-0003-0216-8803"},"institutions":[{"id":"https://openalex.org/I45155027","display_name":"Technische Hochschule Mittelhessen","ror":"https://ror.org/02qdc9985","country_code":"DE","type":"education","lineage":["https://openalex.org/I45155027"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Uwe Meyer","raw_affiliation_strings":["TH Mittelhessen, Germany"],"raw_orcid":"https://orcid.org/0000-0003-0216-8803","affiliations":[{"raw_affiliation_string":"TH Mittelhessen, Germany","institution_ids":["https://openalex.org/I45155027"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023883599"],"corresponding_institution_ids":["https://openalex.org/I45155027"],"apc_list":null,"apc_paid":null,"fwci":0.8399,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.78548506,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"13","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","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/T10682","display_name":"Quantum Computing Algorithms and Architecture","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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9929999709129333,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9886000156402588,"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/compiler","display_name":"Compiler","score":0.8960844874382019},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.837192177772522},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7612643837928772},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.6719170212745667},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.6339141130447388},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5898192524909973},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.522215723991394},{"id":"https://openalex.org/keywords/interprocedural-optimization","display_name":"Interprocedural optimization","score":0.4665396511554718},{"id":"https://openalex.org/keywords/static-analysis","display_name":"Static analysis","score":0.44148653745651245},{"id":"https://openalex.org/keywords/program-optimization","display_name":"Program optimization","score":0.4212183952331543},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.41968604922294617},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.413849800825119},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.352586567401886},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3205084502696991}],"concepts":[{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.8960844874382019},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.837192177772522},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7612643837928772},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.6719170212745667},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.6339141130447388},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5898192524909973},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.522215723991394},{"id":"https://openalex.org/C111564260","wikidata":"https://www.wikidata.org/wiki/Q4288856","display_name":"Interprocedural optimization","level":5,"score":0.4665396511554718},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.44148653745651245},{"id":"https://openalex.org/C139571649","wikidata":"https://www.wikidata.org/wiki/Q1156793","display_name":"Program optimization","level":3,"score":0.4212183952331543},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.41968604922294617},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.413849800825119},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.352586567401886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3205084502696991},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C29331672","wikidata":"https://www.wikidata.org/wiki/Q3354468","display_name":"Loop optimization","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3460946.3464314","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3460946.3464314","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W95608104","https://openalex.org/W1522901891","https://openalex.org/W1972376146","https://openalex.org/W2031433874","https://openalex.org/W2068967633","https://openalex.org/W2101811680","https://openalex.org/W2482524050","https://openalex.org/W2510914679","https://openalex.org/W2902234053","https://openalex.org/W2963163544","https://openalex.org/W3025224030","https://openalex.org/W3025272741","https://openalex.org/W4233798822","https://openalex.org/W4412267756"],"related_works":["https://openalex.org/W1488300410","https://openalex.org/W2083681681","https://openalex.org/W2577630842","https://openalex.org/W4220800565","https://openalex.org/W1597127505","https://openalex.org/W2013570895","https://openalex.org/W2548034914","https://openalex.org/W4384571653","https://openalex.org/W2142079700","https://openalex.org/W2111447644"],"abstract_inverted_index":{"Reversible":[0,56],"computing":[1],"is":[2,124,143,190],"a":[3,24,31,76],"technique":[4],"to":[5,26,86,104,116,135,149,165],"\u201clet":[6],"computations":[7],"run":[8],"forwards":[9,72,183],"and":[10,12,51,73,93,113,119,151,194,211,217],"backwards\u201d":[11],"thus":[13],"extends":[14],"the":[15,28,43,60,81,87,131,144,177],"traditional":[16],"model":[17],"of":[18,30,62,78,89,156],"computation.":[19],"As":[20,137],"an":[21,49],"example,":[22],"consider":[23],"function":[25,44],"compute":[27],"factorial":[29],"given":[32],"number,":[33],"say":[34],"5,":[35],"yielding":[36],"120.":[37],"Running":[38],"this":[39,97,142],"program":[40,106,195],"backwards":[41,68],"inverses":[42],"by":[45],"taking":[46],"120":[47],"as":[48,54,69,71,139],"input":[50],"giving":[52],"5":[53],"result.":[55],"programming":[57,161],"languages":[58,162,187],"allow":[59],"creation":[61],"programs":[63,180],"that":[64,179,188],"can":[65],"be":[66],"executed":[67,182],"well":[70],"have":[74,218],"been":[75,219],"focus":[77],"research":[79],"over":[80],"last":[82],"decade":[83],"mostly":[84],"due":[85],"work":[88,123],"Gl\u00fcck,":[90],"Yokoyama,":[91],"Mogensen,":[92],"many":[94],"others.":[95],"In":[96],"paper,":[98],"we":[99,140],"report":[100],"our":[101,127,206],"recent":[102],"activities":[103],"perform":[105,117],"analysis":[107,196,207],"for":[108,209],"reversible":[109,132,157,186],"static-single-assignment":[110],"form":[111],"(RSSA)":[112],"using":[114],"them":[115],"local":[118],"global":[120],"optimizations.":[121],"This":[122],"based":[125,175],"on":[126,154,176,204],"compiler":[128,146],"translating":[129],"from":[130,147],"language":[133],"Janus":[134,148],"RSSA.":[136],"far":[138],"know,":[141],"first":[145,202],"RSSA,":[150],"no":[152,191],"results":[153,203],"optimization":[155],"intermediate":[158],"code":[159],"or":[160],"are":[163,173,181,214],"known":[164],"us":[166],"either.":[167],"Optimization":[168],"techniques":[169],"in":[170,185],"\u201ctraditional\u201d":[171],"compilers":[172],"always":[174],"understanding":[178],"-":[184],"assumption":[189],"longer":[192],"true":[193],"becomes":[197],"much":[198],"more":[199],"difficult.":[200],"Our":[201],"applying":[205],"methods":[208],"common-subexpression-elimination":[210],"constant":[212],"propagation":[213],"nevertheless":[215],"promising":[216],"implemented":[220],"successfully.":[221]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}