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
Authors: Martin Lange, Rafał Somla 
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.04.019
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
- Propositional dynamic logic of regular programs
- A lattice-theoretical fixpoint theorem and its applications
- Model checking propositional dynamic logic with all extras
- Results on the propositional \(\mu\)-calculus
- Propositional dynamic logic of nonregular programs
- Foundations of Software Science and Computation Structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- More on nonregular PDL: Finite models and Fibonacci-like programs
- Three notes on the complexity of model checking fixpoint logic with chop
Cited In (5)
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)
