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...
Main Authors: | V. V. Podymov, V. A. Zakharov |
---|---|
Format: | Article |
Language: | English |
Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2018-10-01
|
Series: | Труды Института системного программирования РАН |
Subjects: | |
Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/809 |
Similar Items
-
On the application of equivalence checking algorithms for program minimization
by: V. A. Zakharov, et al.
Published: (2018-10-01) -
Polynomial time algorithm for checking strong equivalence of program
by: V. A. Zakharov, et al.
Published: (2018-10-01) -
Polynomial time algorithm for checking strong equivalence of program
by: T. A. Novikova, et al.
Published: (2018-10-01) -
Finite state automata in the theory of algebraic program schemata
by: R. I. Podlovchenko
Published: (2018-10-01) -
Modeling and analysis of the behavior of successive reactive programs
by: V. A. Zakharov
Published: (2018-10-01)