On the public citation graph

Logics of Programs

https://doi.org/10.1007/bfb0025769
0 signed · 20 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.1007/bfb0025776openalex-snapshot
Correctness of programs with function procedures
inferredcites →https://doi.org/10.1007/bfb0025777openalex-snapshot
A formalism for reasoning about fair termination
inferredcites →https://doi.org/10.1007/bfb0025779openalex-snapshot
Further results on propositional dynamic logic of nonregular programs
inferredcites →https://doi.org/10.1007/bfb0025780openalex-snapshot
Some observations on compositional semantics
inferredcites →https://doi.org/10.1007/bfb0025781openalex-snapshot
Some connections between iterative programs, recursive programs, and first-order logic
inferredcites →https://doi.org/10.1007/bfb0025787openalex-snapshot
A note on equivalences among logics of programs
inferredcites →https://doi.org/10.1007/bfb0025792openalex-snapshot
Using graphs to understand PDL

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-12896-4_375openalex-snapshot
Hoare's logic for programs with procedures — What has been achieved?
inferred← citeshttps://doi.org/10.1007/3-540-36384-x_16openalex-snapshot
Lifting Temporal Proofs through Abstractions
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_7openalex-snapshot
The Hybrid μ-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_5openalex-snapshot
An Efficiently Checkable, Proof-Based Formulation of Vacuity in Model Checking
inferred← citeshttps://doi.org/10.1109/32.879819openalex-snapshot
Handling of irregularities in human centered systems: a unified framework for data and processes
inferred← citeshttps://doi.org/10.1109/5.871305openalex-snapshot
Logics for hybrid systems
inferred← citeshttps://doi.org/10.1109/lics.1998.705674openalex-snapshot
Linear vs. branching time: a complexity-theoretic perspective
inferred← citeshttps://doi.org/10.1109/lics.2002.1029843openalex-snapshot
Description logics: foundations for class-based knowledge representation
inferred← citeshttps://doi.org/10.1109/rtcsa.2012.21openalex-snapshot
Real-Time Scheduling of Energy Harvesting Embedded Systems with Timed Automata
inferred← citeshttps://doi.org/10.1145/2392987.2393014openalex-snapshot
The scheduling problem of self-suspending periodic real-time tasks
inferred← citeshttps://doi.org/10.3390/jmse13061058openalex-snapshot
Towards Hazard Analysis Result Verification for Autonomous Ships: A Formal Verification Method Based on Timed Automata
inferred← citeshttps://doi.org/10.3390/math12244008openalex-snapshot
A Finite Representation of Durational Action Timed Automata Semantics
inferred← citeshttps://doi.org/10.4204/eptcs.126.4openalex-snapshot
Infinitary Axiomatization of the Equational Theory of Context-Free Languages
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.