Propositional dynamic logic of context-free programs and fixpoint logic with chop
From MaRDI portal
Publication:845832
DOI10.1016/J.IPL.2006.04.019zbMATH Open1185.68391OpenAlexW2121147545MaRDI QIDQ845832FDOQ845832
Recommendations
- Theoretical Aspects of Computing – ICTAC 2005
- Propositional dynamic logic with program quantifiers
- The propositional dynamic logic of deterministic, well-structured programs
- Propositional dynamic logic of nonregular programs
- Foundations of Software Science and Computation Structures
- scientific article; zbMATH DE number 139632
- Propositional dynamic logic with recursive programs
- Propositional dynamic logic for higher-order functional programs
- scientific article; zbMATH DE number 7317262
- scientific article; zbMATH DE number 2087435
Cites work
- scientific article; zbMATH DE number 3862425 (Why is no real title available?)
- scientific article; zbMATH DE number 1304336 (Why is no real title available?)
- A lattice-theoretical fixpoint theorem and its applications
- Foundations of Software Science and Computation Structures
- Model checking propositional dynamic logic with all extras
- More on nonregular PDL: Finite models and Fibonacci-like programs
- Propositional dynamic logic of nonregular programs
- Propositional dynamic logic of regular programs
- Results on the propositional \(\mu\)-calculus
- Three notes on the complexity of model checking fixpoint logic with chop
Cited in
(5)- scientific article; zbMATH DE number 7317262 (Why is no real title available?)
- Separating the expressive power of propositional dynamic and modal fixpoint logics
- Temporal Logic with Recursion.
- Theoretical Aspects of Computing – ICTAC 2005
- The complexity of model-checking tail-recursive higher-order fixpoint logic
This page was built for publication: Propositional dynamic logic of context-free programs and fixpoint logic with chop
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845832)
