{"id":"https://openalex.org/W2398836986","doi":"https://doi.org/10.3233/fi-2016-1410","title":"An Efficient Equivalence-checking Algorithm for a Model of Programs with Commutative and Absorptive Statements","display_name":"An Efficient Equivalence-checking Algorithm for a Model of Programs with Commutative and Absorptive Statements","publication_year":2016,"publication_date":"2016-11-17","ids":{"openalex":"https://openalex.org/W2398836986","doi":"https://doi.org/10.3233/fi-2016-1410","mag":"2398836986"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2016-1410","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2016-1410","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-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/A5086098406","display_name":"V. V. Podymov","orcid":"https://orcid.org/0000-0002-2041-7634"},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Vladislav Podymov","raw_affiliation_strings":["National Research University Higher School of Economics, 3 Kochnovsky Proezd, 125319 Moscow, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Research University Higher School of Economics, 3 Kochnovsky Proezd, 125319 Moscow, Russia","institution_ids":["https://openalex.org/I118501908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5086098406"],"corresponding_institution_ids":["https://openalex.org/I118501908"],"apc_list":{"value":4150,"currency":"USD","value_usd":4150},"apc_paid":null,"fwci":0.3296,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.66099208,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"147","issue":"2-3","first_page":"315","last_page":"336"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9995999932289124,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7686043381690979},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7545922994613647},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.7493674755096436},{"id":"https://openalex.org/keywords/commutative-property","display_name":"Commutative property","score":0.6544234156608582},{"id":"https://openalex.org/keywords/logical-equivalence","display_name":"Logical equivalence","score":0.5601072311401367},{"id":"https://openalex.org/keywords/statement","display_name":"Statement (logic)","score":0.5400986671447754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44674527645111084},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43653735518455505},{"id":"https://openalex.org/keywords/monoid","display_name":"Monoid","score":0.4345245659351349},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41091418266296387},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39775335788726807},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32506635785102844}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7686043381690979},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7545922994613647},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7493674755096436},{"id":"https://openalex.org/C183778304","wikidata":"https://www.wikidata.org/wiki/Q165474","display_name":"Commutative property","level":2,"score":0.6544234156608582},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.5601072311401367},{"id":"https://openalex.org/C2777026412","wikidata":"https://www.wikidata.org/wiki/Q2684591","display_name":"Statement (logic)","level":2,"score":0.5400986671447754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44674527645111084},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43653735518455505},{"id":"https://openalex.org/C206901836","wikidata":"https://www.wikidata.org/wiki/Q208237","display_name":"Monoid","level":2,"score":0.4345245659351349},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41091418266296387},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39775335788726807},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32506635785102844},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/fi-2016-1410","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2016-1410","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W65686629","https://openalex.org/W1491178396","https://openalex.org/W1566080944","https://openalex.org/W1573169217","https://openalex.org/W1602614849","https://openalex.org/W1963980186","https://openalex.org/W1991034910","https://openalex.org/W2002089154","https://openalex.org/W2003250112","https://openalex.org/W2020915715","https://openalex.org/W2047764386","https://openalex.org/W2049140374","https://openalex.org/W2074864221","https://openalex.org/W2077330640","https://openalex.org/W2088459913","https://openalex.org/W2111270089","https://openalex.org/W2336123333"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W1501430220","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2583549044","https://openalex.org/W2119045600","https://openalex.org/W2584984136","https://openalex.org/W2962928105","https://openalex.org/W1511851241","https://openalex.org/W179795792"],"abstract_inverted_index":{"For":[0],"many":[1],"program":[2,132],"analysis":[3],"problems":[4],"it":[5],"is":[6,30,41,110],"useful":[7],"to":[8,11,25,37,42,66,103,125],"have":[9,17],"means":[10],"efficiently":[12],"prove":[13,26,209],"that":[14],"given":[15],"programs":[16,47],"similar":[18],"(equivalent)":[19],"behaviors.":[20],"Unfortunately,":[21],"in":[22,57,134,198,201,217],"most":[23],"cases":[24],"the":[27,54,73,95,104,117,126,155,168,214],"behavioral":[28],"equivalence":[29,215],"an":[31,49,68,162,183],"undecidable":[32],"problem.":[33],"A":[34,107],"common":[35],"way":[36],"overcome":[38],"such":[39,218],"undecidability":[40],"consider":[43,130],"a":[44,89,113,147,152,206,210],"model":[45],"of":[46,80,82,85,97,119,151,157,165,167,203],"with":[48],"abstract":[50],"semantics":[51],"based":[52,188],"on":[53,77,189],"real":[55],"one,":[56],"which":[58,135],"only":[59],"some":[60],"simple":[61],"properties":[62,81,139],"are":[63,92,140,149],"captured,":[64],"and":[65,90,100,122,137,175],"provide":[67],"efficient":[69],"equivalence-checking":[70,184],"algorithm":[71,185,196],"for":[72,112,146,186,213],"model.":[74],"We":[75,129,181],"focus":[76],"two":[78],"kinds":[79],"data-modifying":[83],"statements":[84],"imperative":[86],"programs.":[87,204],"Statements":[88],"b":[91,109,123,178],"commutative,":[93],"if":[94,116],"execution":[96,118],"sequences":[98,120],"ab":[99,121,170,176],"ba":[101,172],"lead":[102,124],"same":[105,127],"result.":[106,128],"statement":[108,114,158],"(left-)absorptive":[111],"a,":[115],"propositional":[131],"models":[133],"commutativity":[136],"absorption":[138],"caprtured":[141],"(CA-models).":[142],"Formally,":[143],"data":[144],"states":[145],"CA-model":[148],"elements":[150],"monoid":[153],"over":[154],"set":[156,164],"symbols,":[159],"defined":[160],"by":[161],"arbitrary":[163],"relations":[166],"form":[169],"=":[171,177],"(for":[173,179],"commutativity)":[174],"absorption).":[180],"propose":[182],"CA-models":[187],"(what":[190],"we":[191,208],"call)":[192],"progressive":[193],"monoids.":[194],"The":[195],"terminates":[197],"time":[199],"polynomial":[200],"size":[202],"As":[205],"consequence,":[207],"polynomial-time":[211],"decidability":[212],"problem":[216],"CA-models.":[219]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}