Program schemata vs. automata for decidability of program logics

DOI10.1016/S0304-3975(96)00168-5zbMath0895.03012MaRDI QIDQ1392141

N. V. Shilov

Publication date: 23 July 1998

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

zbMATH Keywords

decidabilitymu-calculusprogram logics

Mathematics Subject Classification ID

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

Related Items (3)

Program Schemata Technique to Solve Propositional Program Logics Revised ⋮ Program schemata technique for propositional program logics: a 30-year history ⋮ Propositional Dynamic Logic with Program Quantifiers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• The complementation problem for Büchi automata with applications to temporal logic
• An automata theoretic decision procedure for the propositional mu- calculus
• Symbolic model checking: \(10^{20}\) states and beyond
• Theory of program structures: Schemes, semantics, verification
• Propositional dynamic logic of regular programs
• Decidability of Second-Order Theories and Automata on Infinite Trees
• On model checking for the \(\mu\)-calculus and its fragments

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