Program schemata technique for propositional program logics: a 30-year history

DOI10.1134/S036176881604006XzbMath1452.68004OpenAlexW2484558358MaRDI QIDQ2216719

N. V. Shilov, S. O. Shilova, A. Yu. Bernshtein

Publication date: 16 December 2020

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s036176881604006x

Mathematics Subject Classification ID

Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) History of computer science (68-03)

Cites Work

• Results on the propositional \(\mu\)-calculus
• Automata-theoretic techniques for modal logics of programs
• Tableau-based model checking in the propositional mu-calculus
• Program schemata as automata. I
• Propositional dynamic logic of regular programs
• Program schemata vs. automata for decidability of program logics
• Deterministic propositional dynamic logic: finite models, complexity, and completeness
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• A lattice-theoretical fixpoint theorem and its applications
• Program Schemata Technique to Solve Propositional Program Logics Revised
• Propositional dynamic logic of looping and converse is elementarily decidable
• Some open questions in the theory of program schemes and dynamic logics
• Decision complexity of variants of propositional dynamic logic
• The Complexity of Tree Automata and Logics of Programs
• Decidability of Second-Order Theories and Automata on Infinite Trees
• On Ianov's Program Schemata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Program schemata technique for propositional program logics: a 30-year history