On the public citation graph

Deciding Properties of Nonregular Programs

0 signed · 38 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1994.1073openalex-snapshot
Deciding Emptiness for Stack Automata on Infinite Trees
inferredcites →https://doi.org/10.1007/3-540-12896-4_369openalex-snapshot
There exist decidable context free propositonal dynamic logics
inferredcites →https://doi.org/10.1007/3-540-51486-4_91openalex-snapshot
Pushdown automata on infinite trees and omega-Kleene closure of context-free tree sets
inferredcites →https://doi.org/10.1007/978-1-4613-9595-9openalex-snapshot
An Introduction to Formal Language Theory
inferredcites →https://doi.org/10.1007/978-94-009-6259-0_10openalex-snapshot
Dynamic Logic
inferredcites →https://doi.org/10.1016/0022-0000(79)90046-1openalex-snapshot
Propositional dynamic logic of regular programs
inferredcites →https://doi.org/10.1016/0022-0000(80)90061-6openalex-snapshot
A near-optimal method for reasoning about action
inferredcites →https://doi.org/10.1016/0022-0000(83)90014-4openalex-snapshot
Propositional dynamic logic of nonregular programs
inferredcites →https://doi.org/10.1016/0022-0000(84)90005-9openalex-snapshot
Undecidability of PDL with L = {a2i |; i ⩾ 0}
inferredcites →https://doi.org/10.1016/0022-0000(86)90026-7openalex-snapshot
Automata-theoretic techniques for modal logics of programs
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50019-6openalex-snapshot
Logics of Programs
inferredcites →https://doi.org/10.1016/s0019-9958(82)91258-xopenalex-snapshot
Propositional dynamic logic of looping and converse is elementarily decidable
inferredcites →https://doi.org/10.1016/s0019-9958(85)80047-4openalex-snapshot
Propositional dynamic logic of flowcharts
inferredcites →https://doi.org/10.1017/cbo9781107325630.008openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1145/321356.321364openalex-snapshot
On Context-Free Languages

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.1996.0066openalex-snapshot
More on Nonregular PDL: Finite Models and Fibonacci-like Programs
inferred← citeshttps://doi.org/10.1007/11690634_20openalex-snapshot
Propositional Dynamic Logic with Recursive Programs
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_60openalex-snapshot
On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
inferred← citeshttps://doi.org/10.1007/978-3-031-43619-2_21openalex-snapshot
Beyond $$\mathcal {ALC}_{\textsf {reg}}$$: Exploring Non-Regular Extensions of PDL with Description Logics Features
inferred← citeshttps://doi.org/10.1007/978-3-319-46750-4_25openalex-snapshot
Propositional Dynamic Logic for Petri Nets with Iteration
inferred← citeshttps://doi.org/10.1007/978-3-642-24288-5_6openalex-snapshot
Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics
inferred← citeshttps://doi.org/10.1007/978-94-017-0456-4_2openalex-snapshot
Dynamic Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.10.014openalex-snapshot
Propositional Dynamic Logic with Program Quantifiers
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.06.002openalex-snapshot
Bisimilar and Logically Equivalent Programs in PDL
inferred← citeshttps://doi.org/10.1016/j.jlap.2006.11.003openalex-snapshot
Propositional dynamic logic with recursive programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.02.037openalex-snapshot
Bisimilar and logically equivalent programs in PDL with parallel operator
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.01.007openalex-snapshot
Towards reasoning about Petri nets: A Propositional Dynamic Logic based approach
inferred← citeshttps://doi.org/10.1023/a:1008345113376openalex-snapshot
Timing Diagrams: Formalization and Algorithmic Verification
inferred← citeshttps://doi.org/10.1093/jigpal/jzu010openalex-snapshot
Propositional dynamic logic for Petri nets
inferred← citeshttps://doi.org/10.1093/logcom/11.6.933openalex-snapshot
The Complexity of Regularity in Grammar Logics and Related Modal Logics
inferred← citeshttps://doi.org/10.1093/logcom/exu001openalex-snapshot
Propositional dynamic logics for communicating concurrent programs with CCS's parallel operator
inferred← citeshttps://doi.org/10.1109/istcs.1995.377037openalex-snapshot
More on nonregular PDL: expressive power, finite models, Fibonacci programs
inferred← citeshttps://doi.org/10.1109/lics.2007.9openalex-snapshot
A Robust Class of Context-Sensitive Languages
inferred← citeshttps://doi.org/10.1201/9781315167671-37openalex-snapshot
Computational Complexity
inferred← citeshttps://doi.org/10.46298/lmcs-20(2:7)2024openalex-snapshot
Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features
inferred← citeshttps://doi.org/10.48550/arxiv.0707.0562openalex-snapshot
On a Non-Context-Free Extension of PDL
inferred← citeshttps://doi.org/10.48550/arxiv.0904.0034openalex-snapshot
CCS-Based Dynamic Logics for Communicating Concurrent Programs
inferred← citeshttps://doi.org/10.5282/edoc.11677openalex-snapshot
Verification of Non-Regular Program Properties
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.