当前位置: X-MOL 学术Moscow Univ. Comput. Math. Cybern. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Efficient Equivalence-Checking Algorithms for Procedural Programs in Progressive Semigroup Gateway Models
Moscow University Computational Mathematics and Cybernetics Pub Date : 2019-12-10 , DOI: 10.3103/s0278641919040071
V. V. Podymov

The problem of program equivalence, checking whether programs have the same (equivalent) behavior in a given model, is investigated. The considered models of programs with “gateway” procedures were proposed somewhat recently, and almost nothing is known about solving the problem of equivalence for them. An approach is proposed to solving the problem of the consistent halting of programs without procedures. Based on known results, it allows to state decidability and polynomial decidability for the equivalence problem with procedures in many gateway models, and the corresponding decision algorithms to be constructed.

中文翻译:

渐进半群网关模型中程序程序的等效检查算法

研究程序等效性的问题,即检查程序在给定模型中是否具有相同(等效)行为。带有“网关”程序的程序模型是最近才提出的,而解决它们的等价问题几乎一无所知。提出了一种解决没有程序的程序一致停止问题的方法。基于已知结果,它允许用许多网关模型中的过程陈述对等问题的可判定性和多项式可判定性,并构造相应的判定算法。
更新日期:2019-12-10
down
wechat
bug