On the public citation graph
Using graphs to understand PDL
0 signed · 34 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-08921-7_88openalex-snapshot
The completeness of propositional 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/s0022-0000(76)80034-7openalex-snapshot
Complexity measures for regular expressions
inferredcites →https://doi.org/10.1090/psapm/019/0235771openalex-snapshot
Assigning meanings to programs
inferredcites →https://doi.org/10.1137/0204011openalex-snapshot
Translating Program Schemas to While-Schemas
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/800141.804649openalex-snapshot
Dynamic algebras and the nature of induction
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.1994.1092openalex-snapshot
Reasoning about Infinite Computations
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_104openalex-snapshot
Propositional dynamic logic of flowcharts
inferred← citeshttps://doi.org/10.1007/3-540-15648-8_31openalex-snapshot
The taming of converse: Reasoning about two-way computations
inferred← citeshttps://doi.org/10.1007/3-540-16066-3_10openalex-snapshot
Model theory of propositional logics of programs, some open problems
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_55openalex-snapshot
A thesis for bounded concurrency
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_59openalex-snapshot
Complexity results for multi-pebble automata and their logics
inferred← citeshttps://doi.org/10.1007/978-3-319-73579-5openalex-snapshot
Dynamic Logic. New Trends and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-73579-5_10openalex-snapshot
Dynamic Logic: A Personal Perspective
inferred← citeshttps://doi.org/10.1007/978-3-662-02880-3_9openalex-snapshot
How Hard is it to Reason about Propositional Programs?
inferred← citeshttps://doi.org/10.1007/bf00370685openalex-snapshot
Dynamic algebras: Examples, constructions, applications
inferred← citeshttps://doi.org/10.1016/0022-0000(86)90026-7openalex-snapshot
Automata-theoretic techniques for modal logics of programs
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90097-xopenalex-snapshot
The propositional dynamic logic of deterministic, well-structured programs
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00095-xopenalex-snapshot
The complexity of PDL with interleaving
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50019-6openalex-snapshot
Logics of Programs
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80051-5openalex-snapshot
Temporal logic can be more expressive
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80047-4openalex-snapshot
Propositional dynamic logic of flowcharts
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00119-3openalex-snapshot
Complexity results for two-way and multi-pebble automata and their logics
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.1109/lics.1990.113770openalex-snapshot
On the power of bounded concurrency. III. Reasoning about programs
inferred← citeshttps://doi.org/10.1109/sfcs.1981.44openalex-snapshot
Temporal logic can be more expressive
inferred← citeshttps://doi.org/10.1109/sfcs.1983.51openalex-snapshot
Reasoning about infinite computation paths
inferred← citeshttps://doi.org/10.1145/800171.809617openalex-snapshot
A requirement model for the 5th generation
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.