On the public citation graph

Prenex Universal First-Order Safety Properties

https://doi.org/10.2139/ssrn.4623116
0 signed · 14 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/978-3-030-65474-0_6openalex-extracted
Stratified Guarded First-Order Transition Systems
inferredcites →https://doi.org/10.1007/bf01211865openalex-extracted
Safety, liveness and fairness in temporal logic
inferredcites →https://doi.org/10.1007/s10703-022-00404-9openalex-extracted
Stratified guarded first-order transition systems
inferredcites →https://doi.org/10.1023/a:1011254632723openalex-extracted
Model Checking of Safety Properties
inferredcites →https://doi.org/10.1109/csf.2018.00025openalex-extracted
Inductive Invariants for Noninterference in Multi-agent Workflows
inferredcites →https://doi.org/10.1109/iccad.2005.1560185openalex-extracted
Efficient LTL compilation for SAT-based model checking
inferredcites →https://doi.org/10.1109/sfcs.1977.32openalex-extracted
The temporal logic of programs
inferredcites →https://doi.org/10.1145/2594291.2594317openalex-extracted
VeriCon
inferredcites →https://doi.org/10.1145/2676726.2676990openalex-extracted
Decentralizing SDN Policies
inferredcites →https://doi.org/10.1145/2908080.2908118openalex-extracted
Ivy: safety verification by interactive generalization
inferredcites →https://doi.org/10.1145/3133956.3134080openalex-extracted
Verifying Security Policies in Multi-agent Workflows with Loops
inferredcites →https://doi.org/10.1145/3140568openalex-extracted
Paxos made EPR: decidable reasoning about distributed protocols
inferredcites →https://doi.org/10.1145/3158114openalex-extracted
Reducing liveness to safety in first-order logic
inferredcites →https://doi.org/10.5555/1129601.1129725openalex-extracted
Efficient LTL compilation for SAT-based model checking
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.