On the public citation graph

Completing the temporal picture

https://doi.org/10.1007/bfb0035782
0 signed · 33 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/3-540-09237-4openalex-snapshot
First-Order Dynamic Logic
inferredcites →https://doi.org/10.1007/3-540-10843-2_22openalex-snapshot
Impartiality, justice and fairness: The ethics of concurrent termination
inferredcites →https://doi.org/10.1007/3-540-15648-8_16openalex-snapshot
The glory of the past
inferredcites →https://doi.org/10.1007/978-1-4612-4886-6openalex-snapshot
Fairness
inferredcites →https://doi.org/10.1007/978-3-642-71549-5openalex-snapshot
Temporal Logic of Programs
inferredcites →https://doi.org/10.1007/bfb0013024openalex-snapshot
The anchored version of the temporal framework
inferredcites →https://doi.org/10.1007/bfb0027047openalex-snapshot
Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends
inferredcites →https://doi.org/10.1016/0167-6423(84)90003-0openalex-snapshot
Adequate proof principles for invariance and liveness properties of concurrent programs
inferredcites →https://doi.org/10.1016/s0019-9958(81)90663-xopenalex-snapshot
A combinatorial approach to the theory of ω-automata
inferredcites →https://doi.org/10.1137/0207005openalex-snapshot
Soundness and Completeness of an Axiom System for Program Verification
inferredcites →https://doi.org/10.1145/357146.357150openalex-snapshot
Ten Years of Hoare's Logic: A Survey—Part I
inferredcites →https://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferredcites →https://doi.org/10.1145/41625.41626openalex-snapshot
Specification and verification of concurrent programs by A ∀ automata
inferredcites →https://doi.org/10.1145/567067.567082openalex-snapshot
How to cook a temporal proof system for your pet language
inferredcites →https://doi.org/10.1145/59287.62028openalex-snapshot
Verifying temporal properties without temporal logic

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11921240_17openalex-snapshot
Proving ATL* Properties of Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_24openalex-snapshot
MightyPPL: Model Checking MITL with Past and Pnueli Modalities
inferred← citeshttps://doi.org/10.1007/978-94-015-9586-5_7openalex-snapshot
Deductive Verification of Parameterized Fault-Tolerant Systems: A Case Study
inferred← citeshttps://doi.org/10.1007/bf02252682openalex-snapshot
Verification of distributed programs using representative interleaving sequences
inferred← citeshttps://doi.org/10.1007/bfb0055625openalex-snapshot
Axioms for real-time logics
inferred← citeshttps://doi.org/10.1007/s00165-008-0075-6openalex-snapshot
Deductive verification of alternating systems
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90041-yopenalex-snapshot
Completing the temporal picture
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90009-4openalex-snapshot
Proving partial order properties
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50020-2openalex-snapshot
Methods and Logics for Proving Programs
inferred← citeshttps://doi.org/10.1016/j.ic.2009.01.005openalex-snapshot
On fairness and randomness
inferred← citeshttps://doi.org/10.1109/fscs.1990.89589openalex-snapshot
Tight bounds on the complexity of cascaded decomposition of automata
inferred← citeshttps://doi.org/10.1109/isads.1995.398993openalex-snapshot
Towards an enterprise modelling method for CSCW systems
inferred← citeshttps://doi.org/10.1109/jcit.1990.128359openalex-snapshot
A temporal proof methodology for reactive systems
inferred← citeshttps://doi.org/10.1145/3329125openalex-snapshot
Progress, Justness, and Fairness
inferred← citeshttps://doi.org/10.11606/t.45.2016.tde-23122015-094748openalex-snapshot
Geração de propriedades sobre programas Java a partir de objetivos de teste
inferred← citeshttps://doi.org/10.18260/1-2--5809openalex-snapshot
An Experiment To Evaluate An Approach To Teaching Formal Specifications Using Model Checking
inferred← citeshttps://doi.org/10.4204/eptcs.147.7openalex-snapshot
Automated Mapping of UML Activity Diagrams to Formal Specifications for Supporting Containment Checking
inferred← citeshttps://doi.org/10.4204/eptcs.54.13openalex-snapshot
Reactive Safety
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.