On the equivalence-checking problem for polysemantic models of sequential programs.
We introduce a new propositional model of computation for sequential computer programs. A distinctive feature of this model is that program runs and the results of computations are defined by means of two independent operational semantics. One of them can be regarded as an internal semantics that is used for routing runs in the control-flow graph of a program. The other one can be viewed as an observational semantics which is used for interpreting the results of a program execution. We show that some conventional models of sequential and recursive programs can be embedded into our model. We consider the equivalence-checking problem for the presented model and develop a uniform approach to the design of efficient equivalence-checking algorithms.
Труды Института системного программирования РАН, том 6, 2004, стр. 179-198.
ISSN 2220-6426 (Online), ISSN 2079-8156 (Print).