Program Schemata Technique to Solve Propositional Program Logics Revised

DOI10.1007/978-3-319-41579-6_19zbMath1461.68059OpenAlexW2506909121MaRDI QIDQ3179178

N. V. Shilov

Publication date: 21 December 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-41579-6_19

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

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

Cites Work

• Results on the propositional \(\mu\)-calculus
• Program schemata vs. automata for decidability of program logics
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• A lattice-theoretical fixpoint theorem and its applications
• The Complexity of Tree Automata and Logics of Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Program Schemata Technique to Solve Propositional Program Logics Revised