{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T19:26:20Z","timestamp":1725391580437},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We introduce a first-order model of imperative sequential programs and set up formally the unification problem in this model: given a pair of programs \u03c0&amp;lt;sub&amp;gt;1&amp;lt;\/sub&amp;gt; and \u03c0&amp;lt;sub&amp;gt;2&amp;lt;\/sub&amp;gt; find a pair of substitutions (\u03b8&amp;lt;sub&amp;gt;1&amp;lt;\/sub&amp;gt;,\u03b8&amp;lt;sub&amp;gt;2&amp;lt;\/sub&amp;gt;) such that the instances \u03c0&amp;lt;sub&amp;gt;1&amp;lt;\/sub&amp;gt;\u03b8&amp;lt;sub&amp;gt;1&amp;lt;\/sub&amp;gt; and \u03c0&amp;lt;sub&amp;gt;2&amp;lt;\/sub&amp;gt;\u03b8&amp;lt;sub&amp;gt;2&amp;lt;\/sub&amp;gt; of these programs are equivalent, i.e. compute the same function. Since functional equivalence of programs is undecidable, we choose its decidable approximation --- a strong equivalence, --- which is well-known in theory of program schemata. Our main result is a polynomial time unification algorithm for sequential programs w.r.t. strong equivalence of programs.<\/jats:p>","DOI":"10.29007\/77z3","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T22:59:07Z","timestamp":1516748347000},"page":"35-23","source":"Crossref","is-referenced-by-count":0,"title":["Is it possible to unify sequential programs?"],"prefix":"10.29007","volume":"19","author":[{"given":"Tatyana","family":"Novikova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Zakharov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"11545","event":{"name":"UNIF 2013. 27th International Workshop on Unification"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T23:00:08Z","timestamp":1516748408000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/J4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/77z3","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}