scientific article; zbMATH DE number 4154413

MaRDI QIDQ3483264zbMATH OpenFDO

Authors V. A. Nepomniaschy, Nikolay V. Shilov

Publication date 1987

zbMATH Keywords

decidabilitypropositional dynamic logicvalidity problemcomplexity of the halting problem for nondeterministic Yanov schemata

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

Recommendations

• Nondeterministic program schemata and their relation to dynamic logic
• Program schemata technique to solve propositional program logics revised
• Propositional dynamic logic of nonregular programs
• Some open questions in the theory of program schemes and dynamic logics
• scientific article; zbMATH DE number 3848600

Cited in

(6)

• Program schemata technique to solve propositional program logics revised
• Nondeterministic program schemata and their relation to dynamic logic
• Some open questions in the theory of program schemes and dynamic logics
• scientific article; zbMATH DE number 1794691 (Why is no real title available?)
• Program schemata technique for propositional program logics: a 30-year history
• Program schemata vs. automata for decidability of program logics

This page was built for publication:

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