Propositional dynamic logics of programs: A survey

This publication has 30 references indexed in Scilit:

• An elementary proof of the completeness of PDL
  Theoretical Computer Science, 1981
• Equations between regular terms and an application to process logic
  Published by Association for Computing Machinery (ACM) ,1981
• Finite models for deterministic propositional dynamic logic
  Lecture Notes in Computer Science, 1981
• Two results on process logic
  Information Processing Letters, 1979
• A completeness technique for d-axiomatizable semantics
  Published by Association for Computing Machinery (ACM) ,1979
• Weak monadic second order theory of succesor is not elementary-recursive
  Lecture Notes in Mathematics, 1975
• Lectures on Boolean Algebras
  Published by Springer Nature ,1974
• An axiomatic basis for computer programming
  Communications of the ACM, 1969
• Algorithmic properties of structures
  Theory of Computing Systems, 1967
• Two Complete Axiom Systems for the Algebra of Regular Events
  Journal of the ACM, 1966