Foundations of Software Science and Computation Structures
From MaRDI portal
Publication:5899095
DOI10.1007/11690634zbMATH Open1180.03034OpenAlexW2504714231MaRDI QIDQ5899095FDOQ5899095
Authors: Christof Löding, Olivier Serre 
Publication date: 2 May 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11690634
Recommendations
Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)
Cited In (26)
- Title not available (Why is that?)
- Visibly linear temporal logic
- A note on an extension of PDL
- Title not available (Why is that?)
- PDL with negation of atomic programs
- Propositional dynamic logic of context-free programs and fixpoint logic with chop
- Propositional dynamic logic for higher-order functional programs
- The propositional dynamic logic of deterministic, well-structured programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A practical decision method for propositional dynamic logic (preliminary report)
- A probabilistic PDL
- Propositional dynamic logic with local assignments
- Reasoning with recursive loops under the PLP framework
- Propositional dynamic logic with program quantifiers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Propositional dynamic logic with recursive programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Separating the expressive power of propositional dynamic and modal fixpoint logics
- Title not available (Why is that?)
- Deciding Properties of Nonregular Programs
- Automated Reasoning
- PDL with data constants
- Branching-time logics with path relativisation
This page was built for publication: Foundations of Software Science and Computation Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899095)
