Nondeterministic program schemata and their relation to dynamic logic

DOI10.1007/BF01132079zbMATH Open0692.68012OpenAlexW4254082568MaRDI QIDQ3034804FDOQ3034804

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

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

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)

Cites Work

• Propositional dynamic logic of looping and converse is elementarily decidable
• Simple program schemes and formal languages
• Title not available (Why is that?)

Cited In (6)

• Program schemata technique for propositional program logics: a 30-year history
• The totality problem for program schemas
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)