电邮这篇文章 Program schemata technique for propositional program logics: A 30-year history
- 作者: Shilov N.V.1, Shilova S.O.1, Bernshtein A.Y.2
-
隶属关系:
- Ershov Institute of Informatics Systems
- Novosibirsk State University
- 期: 卷 42, 编号 4 (2016)
- 页面: 239-256
- 栏目: Article
- URL: https://journals.rcsi.science/0361-7688/article/view/176443
- DOI: https://doi.org/10.1134/S036176881604006X
- ID: 176443
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
A survey is presented of the so-called program schemata technique for proving the decidability of propositional program logics. This method is based on the reduction to versions of the problem of relative totality for nondeterministic Yanov schemata.
作者简介
N. Shilov
Ershov Institute of Informatics Systems
编辑信件的主要联系方式.
Email: shilov@iis.nsk.su
俄罗斯联邦, pr. Akademika Lavrent’eva 6, Novosibirsk
S. Shilova
Ershov Institute of Informatics Systems
Email: shilov@iis.nsk.su
俄罗斯联邦, pr. Akademika Lavrent’eva 6, Novosibirsk
A. Bernshtein
Novosibirsk State University
Email: shilov@iis.nsk.su
俄罗斯联邦, ul. Pirogova 2, Novosibirsk
补充文件
