Nondeterministic program schemata and their relation to dynamic logic

DOI10.1007/BF01132079MaRDI QIDQ3034804zbMATH OpenOpenAlexFDO

Authors V. A. Nepomnyashchij, Nikolay V. Shilov

Publication date 1988

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01132079

zbMATH Keywords

algorithmdecidabilityYanov schema

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25)

Recommendations

• Publication:3483264
• scientific article; zbMATH DE number 3983144
• Program schemata technique to solve propositional program logics revised
• Program schemata technique for propositional program logics: a 30-year history
• scientific article; zbMATH DE number 3848600

Cites work

• scientific article; zbMATH DE number 3974280 (Why is no real title available?)
• Propositional dynamic logic of looping and converse is elementarily decidable
• Simple program schemes and formal languages

Cited in

(6)

• Program schemata technique for propositional program logics: a 30-year history
• The totality problem for program schemas
• scientific article; zbMATH DE number 4154413 (Why is no real title available?)
• scientific article; zbMATH DE number 4113946 (Why is no real title available?)
• scientific article; zbMATH DE number 3983144 (Why is no real title available?)
• Program schemata technique to solve propositional program logics revised

This page was built for publication: Nondeterministic program schemata and their relation to dynamic logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3034804)