Program schemata technique for propositional program logics: A 30-year history
- Autores: Shilov N.V.1, Shilova S.O.1, Bernshtein A.Y.2
-
Afiliações:
- Ershov Institute of Informatics Systems
- Novosibirsk State University
- Edição: Volume 42, Nº 4 (2016)
- Páginas: 239-256
- Seção: Article
- URL: https://journal-vniispk.ru/0361-7688/article/view/176443
- DOI: https://doi.org/10.1134/S036176881604006X
- ID: 176443
Citar
Resumo
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.
Sobre autores
N. Shilov
Ershov Institute of Informatics Systems
Autor responsável pela correspondência
Email: shilov@iis.nsk.su
Rússia, pr. Akademika Lavrent’eva 6, Novosibirsk
S. Shilova
Ershov Institute of Informatics Systems
Email: shilov@iis.nsk.su
Rússia, pr. Akademika Lavrent’eva 6, Novosibirsk
A. Bernshtein
Novosibirsk State University
Email: shilov@iis.nsk.su
Rússia, ul. Pirogova 2, Novosibirsk
Arquivos suplementares
