On the public citation graph

IIV: An Invisible Invariant Verifier

0 signed · 26 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-36384-x_2openalex-snapshot
Model-Checking and Abstraction to the Aid of Parameterized Systems
inferredcites →https://doi.org/10.1007/3-540-44585-4_19openalex-snapshot
Parameterized Verification with Automatically Computed Inductive Assertions?
inferredcites →https://doi.org/10.1007/3-540-45319-9_7openalex-snapshot
Automatic Deductive Verification with Invisible Invariants
inferredcites →https://doi.org/10.1007/978-1-4612-4222-2openalex-snapshot
Temporal Verification of Reactive Systems
inferredcites →https://doi.org/10.1007/978-3-540-24622-0_19openalex-snapshot
Liveness with Invisible Ranking
inferredcites →https://doi.org/10.1007/978-3-540-24622-0_23openalex-snapshot
Analysis of Recursive Game Graphs Using Data Flow Equations
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_35openalex-snapshot
A Temporal Logic of Nested Calls and Returns
inferredcites →https://doi.org/10.1016/j.cl.2004.02.006openalex-snapshot
Model checking and abstraction to the aid of parameterized systems (a survey)

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11787006_45openalex-snapshot
Invisible Safety of Distributed Protocols
inferred← citeshttps://doi.org/10.1007/11888116_26openalex-snapshot
Liveness by Invisible Invariants
inferred← citeshttps://doi.org/10.1007/978-3-030-76384-8_9openalex-snapshot
On Symmetry and Quantification: A New Approach to Verify Distributed Protocols
inferred← citeshttps://doi.org/10.1007/978-3-031-75380-0_21openalex-snapshot
SAT-Based Quantified Symmetric Minimization of the Reachable States of Distributed Protocols: An Update
inferred← citeshttps://doi.org/10.1007/978-3-319-41528-4_16openalex-snapshot
Proving Parameterized Systems Safe by Generalizing Clausal Proofs of Small Instances
inferred← citeshttps://doi.org/10.1007/978-3-540-69738-1_22openalex-snapshot
Symmetry and Completeness in the Analysis of Parameterized Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_58openalex-snapshot
VS3: SMT Solvers for Program Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_18openalex-snapshot
Jtlv: A Framework for Developing Verification Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-23702-7_20openalex-snapshot
Invisible Invariants and Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-642-30793-5_2openalex-snapshot
A Small Model Theorem for Rectangular Hybrid Automata Networks
inferred← citeshttps://doi.org/10.1007/s10703-008-0063-8openalex-snapshot
Local proofs for global safety properties
inferred← citeshttps://doi.org/10.1007/s11334-022-00460-8openalex-snapshot
Regularity and quantification: a new approach to verify distributed protocols
inferred← citeshttps://doi.org/10.1109/memcod.2008.4547709openalex-snapshot
Specification and Verification of LambdaRAM¿ A Wide-area Distributed Cache for High Performance Computing
inferred← citeshttps://doi.org/10.1145/2908080.2908129openalex-snapshot
Cardinalities and universal quantifiers for verifying parameterized systems
inferred← citeshttps://doi.org/10.1145/2980983.2908129openalex-snapshot
Cardinalities and universal quantifiers for verifying parameterized systems
inferred← citeshttps://doi.org/10.2168/lmcs-6(4:10)2010openalex-snapshot
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
inferred← citeshttps://doi.org/10.2514/6.2013-4811openalex-snapshot
Invariant Synthesis for Verification of Parameterized Cyber-Physical Systems with Applications to Aerospace Systems
inferred← citeshttps://doi.org/10.34727/2021/isbn.978-3-85448-046-4_20openalex-snapshot
Towards an Automatic Proof of Lamport's Paxos
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.