Propositional dynamic logic with recursive programs

DOI10.1016/J.JLAP.2006.11.003zbMATH Open1123.03017OpenAlexW1974572624MaRDI QIDQ2643333FDOQ2643333

Olivier Serre, Carsten Lutz, Christof Löding

Publication date: 23 August 2007

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2006.11.003

Recommendations

• Foundations of Software Science and Computation Structures
• The propositional dynamic logic of deterministic, well-structured programs
• scientific article
• Deciding Properties of Nonregular Programs
• Propositional dynamic logic of nonregular programs

zbMATH Keywords

propositional dynamic logicvisibly pushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)

Cites Work

• Title not available (Why is that?)
• Propositional dynamic logic of regular programs
• Visibly pushdown languages
• Title not available (Why is that?)
• Alternation
• Title not available (Why is that?)
• Deciding Properties of Nonregular Programs
• Propositional dynamic logic of looping and converse is elementarily decidable
• Parenthesis Grammars
• Automata-theoretic techniques for modal logics of programs
• Title not available (Why is that?)
• Propositional dynamic logic of nonregular programs
• Tools and Algorithms for the Construction and Analysis of Systems
• A fixpoint calculus for local and global program flows
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Languages of Nested Trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finiteness is mu-ineffable
• More on nonregular PDL: Finite models and Fibonacci-like programs

Cited In (28)

• Title not available (Why is that?)
• A note on an extension of PDL
• Exploring non-regular extensions of propositional dynamic logic with description-logics features
• 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?)
• Temporal logics with language parameters
• Title not available (Why is that?)
• Temporal Logic with Recursion.
• Bisimilar and logically equivalent programs in PDL with parallel operator
• Reasoning with recursive loops under the PLP framework
• Title not available (Why is that?)
• Decision complexity of variants of propositional dynamic logic
• Title not available (Why is that?)
• Temporal logic with recursion
• Towards reasoning about Petri nets: a propositional dynamic logic based approach
• Separating the expressive power of propositional dynamic and modal fixpoint logics
• Temporal logics with language parameters
• Title not available (Why is that?)
• Deciding Properties of Nonregular Programs
• Propositional Dynamic Logic for Petri Nets with Iteration
• Propositional dynamic logic of nonregular programs
• Beyond \(\mathcal{ALC}_{\textsf{reg}} \): exploring non-regular extensions of PDL with description logics features
• PDL with data constants
• Branching-time logics with path relativisation

This page was built for publication: Propositional dynamic logic with recursive programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643333)