{"id":"https://openalex.org/W2293936217","doi":"https://doi.org/10.29007/77z3","title":"Is it possible to unify sequential programs?","display_name":"Is it possible to unify sequential programs?","publication_year":2018,"publication_date":"2018-01-23","ids":{"openalex":"https://openalex.org/W2293936217","doi":"https://doi.org/10.29007/77z3","mag":"2293936217"},"language":"en","primary_location":{"id":"doi:10.29007/77z3","is_oa":true,"landing_page_url":"https://doi.org/10.29007/77z3","pdf_url":"https://easychair.org/publications/open/J4","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/J4","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102491545","display_name":"\u0422.\u0410. \u041d\u043e\u0432\u0438\u043a\u043e\u0432\u0430","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tatyana Novikova","raw_affiliation_strings":["Kazakhstan Branch of Lomonosov Moscow State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kazakhstan Branch of Lomonosov Moscow State University","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062447638","display_name":"\u0412. \u0410. \u0417\u0430\u0445\u0430\u0440\u043e\u0432","orcid":"https://orcid.org/0000-0002-3794-9565"},"institutions":[{"id":"https://openalex.org/I19880235","display_name":"Lomonosov Moscow State University","ror":"https://ror.org/010pmpe69","country_code":"RU","type":"education","lineage":["https://openalex.org/I19880235"]},{"id":"https://openalex.org/I4210150146","display_name":"Moscow State University","ror":"https://ror.org/050a13t43","country_code":"TJ","type":"education","lineage":["https://openalex.org/I4210150146"]}],"countries":["RU","TJ"],"is_corresponding":false,"raw_author_name":"Vladimir Zakharov","raw_affiliation_strings":["Lomonosov Moscow State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lomonosov Moscow State University","institution_ids":["https://openalex.org/I19880235","https://openalex.org/I4210150146"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":null,"first_page":"35","last_page":"23"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9995999932289124,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9995999932289124,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9990000128746033,"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.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/undecidable-problem","display_name":"Undecidable problem","score":0.6004977226257324},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5252642035484314},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.47053179144859314},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.316737562417984},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3131612539291382}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.6004977226257324},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5252642035484314},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.47053179144859314},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.316737562417984},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3131612539291382}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.29007/77z3","is_oa":true,"landing_page_url":"https://doi.org/10.29007/77z3","pdf_url":"https://easychair.org/publications/open/J4","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.432.9191","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.432.9191","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.easychair.org/publications/?page=948509829","raw_type":"text"}],"best_oa_location":{"id":"doi:10.29007/77z3","is_oa":true,"landing_page_url":"https://doi.org/10.29007/77z3","pdf_url":"https://easychair.org/publications/open/J4","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2293936217.pdf","grobid_xml":"https://content.openalex.org/works/W2293936217.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W1542742023","https://openalex.org/W1562307676","https://openalex.org/W1569963244","https://openalex.org/W1598890912","https://openalex.org/W1977115070","https://openalex.org/W2010927194","https://openalex.org/W2034764251","https://openalex.org/W2038945974","https://openalex.org/W2042133273","https://openalex.org/W2339224764","https://openalex.org/W4256524356","https://openalex.org/W4285719527"],"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/W4297670065","https://openalex.org/W1618267488","https://openalex.org/W1563786920","https://openalex.org/W2056142535"],"abstract_inverted_index":{"We":[0],"introduce":[1],"a":[2,20,28,63,79],"first-order":[3],"model":[4],"of":[5,22,30,40,53,72,90],"imperative":[6],"sequential":[7,85],"programs":[8,23,42,54,86],"and":[9,25,38],"set":[10],"up":[11],"formally":[12],"the":[13,35,47],"unification":[14,82],"problem":[15],"in":[16,70],"this":[17],"model:":[18],"given":[19],"pair":[21,29],"\u03c0&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;":[24],"\u03c0&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;":[26],"find":[27],"substitutions":[31],"(\u03b8&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;,\u03b8&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;)":[32],"such":[33],"that":[34],"instances":[36],"\u03c0&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;\u03b8&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;":[37],"\u03c0&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;\u03b8&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;":[39],"these":[41],"are":[43],"equivalent,":[44],"i.e.":[45],"compute":[46],"same":[48],"function.":[49],"Since":[50],"functional":[51],"equivalence":[52,89],"is":[55,68,78],"undecidable,":[56],"we":[57],"choose":[58],"its":[59],"decidable":[60],"approximation":[61],"---":[62,66],"strong":[64,88],"equivalence,":[65],"which":[67],"well-known":[69],"theory":[71],"program":[73],"schemata.":[74],"Our":[75],"main":[76],"result":[77],"polynomial":[80],"time":[81],"algorithm":[83],"for":[84],"w.r.t.":[87],"programs.":[91]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}
