Program schemata vs. automata for decidability of program logics

DOI10.1016/S0304-3975(96)00168-5MaRDI QIDQ1392141zbMATH OpenFDO

Authors Nikolay V. Shilov

Publication date 23 July 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(96)00168-5

zbMATH Keywords

decidabilitymu-calculusprogram logics

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)

Cites work

• An automata theoretic decision procedure for the propositional mu- calculus
• Decidability of Second-Order Theories and Automata on Infinite Trees
• scientific article; zbMATH DE number 3848600 (Why is no real title available?)
• scientific article; zbMATH DE number 4201593 (Why is no real title available?)
• scientific article; zbMATH DE number 4154413 (Why is no real title available?)
• scientific article; zbMATH DE number 1499083 (Why is no real title available?)
• On model checking for the -calculus and its fragments
• Propositional dynamic logic of regular programs
• Results on the propositional \(\mu\)-calculus
• Symbolic model checking: \(10^{20}\) states and beyond
• The complementation problem for Büchi automata with applications to temporal logic
• Theory of program structures: Schemes, semantics, verification

Cited in

(3)

• Program schemata technique for propositional program logics: a 30-year history
• Program schemata technique to solve propositional program logics revised
• Propositional dynamic logic with program quantifiers

This page was built for publication: Program schemata vs. automata for decidability of program logics

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