A polynomial algorithm for checking the equivalence in models of programs with commutation and vast operators

In this paper we study the equivalence problem in the model of sequential programs which assumes that some instructions are commutative and absorbing. Two instructions are commutative if the result of their executions does not depend on an order of their execution. An instruction b absorbs an instru...

Popoln opis

Bibliografske podrobnosti
Main Authors: V. V. Podymov, V. A. Zakharov
Format: Article
Jezik:English
Izdano: Ivannikov Institute for System Programming of the Russian Academy of Sciences 2018-10-01
Serija:Труды Института системного программирования РАН
Teme:
Online dostop:https://ispranproceedings.elpub.ru/jour/article/view/809