Email this article Program schemata technique for propositional program logics: A 30-year history
- Authors: Shilov N.V.1, Shilova S.O.1, Bernshtein A.Y.2
-
Affiliations:
- Ershov Institute of Informatics Systems
- Novosibirsk State University
- Issue: Vol 42, No 4 (2016)
- Pages: 239-256
- Section: Article
- URL: https://journal-vniispk.ru/0361-7688/article/view/176443
- DOI: https://doi.org/10.1134/S036176881604006X
- ID: 176443
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
N. V. Shilov
Ershov Institute of Informatics Systems
Author for correspondence.
Email: shilov@iis.nsk.su
Russian Federation, pr. Akademika Lavrent’eva 6, Novosibirsk
S. O. Shilova
Ershov Institute of Informatics Systems
Email: shilov@iis.nsk.su
Russian Federation, pr. Akademika Lavrent’eva 6, Novosibirsk
A. Yu. Bernshtein
Novosibirsk State University
Email: shilov@iis.nsk.su
Russian Federation, ul. Pirogova 2, Novosibirsk
Supplementary files
