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...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2004-01-01
|
Series: | Труды Института системного программирования РАН |
Online Access: | https://www.ispras.ru/en/proceedings/isp_6_2004/isp_6_2004_179/ |