On the public citation graph

Automated verification of Szymanski's algorithm

https://doi.org/10.1007/bfb0054187
0 signed · 48 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.1002/spe.4380180203openalex-snapshot
An improved protocol reachability analysis technique
inferredcites →https://doi.org/10.1007/3-540-52148-8_6openalex-snapshot
Verifying properties of large sets of processes with network invariants
inferredcites →https://doi.org/10.1007/3-540-56922-7_14openalex-snapshot
Verification of a multiplier: 64 bits and beyond
inferredcites →https://doi.org/10.1007/3-540-56922-7_6openalex-snapshot
Reliable hashing without collision detection
inferredcites →https://doi.org/10.1007/3-540-60045-0_39openalex-snapshot
Verifying safety properties of a class of infinite-state distributed algorithms
inferredcites →https://doi.org/10.1007/3-540-60045-0_41openalex-snapshot
CAVEAT: technique and tool for computer aided verification and transformation
inferredcites →https://doi.org/10.1007/3-540-60299-2_37openalex-snapshot
Automatic generation of invariants and intermediate assertions
inferredcites →https://doi.org/10.1007/3-540-61474-5_64openalex-snapshot
Mechanically verifying a family of multiplier circuits
inferredcites →https://doi.org/10.1007/3-540-61474-5_65openalex-snapshot
Verifying systems with replicated components in murϕ
inferredcites →https://doi.org/10.1007/3-540-61474-5_69openalex-snapshot
Verifying invariants using theorem proving
inferredcites →https://doi.org/10.1007/3-540-61474-5_80openalex-snapshot
Powerful techniques for the automatic generation of invariants
inferredcites →https://doi.org/10.1007/3-540-61474-5_93openalex-snapshot
Symbolic model checking
inferredcites →https://doi.org/10.1007/978-1-4615-3190-6openalex-snapshot
Symbolic Model Checking
inferredcites →https://doi.org/10.1007/bf01211305openalex-snapshot
A mechanically verified incremental garbage collector
inferredcites →https://doi.org/10.1007/bf03180564openalex-snapshot
A verification system for concurrent programs based on the Boyer-Moore prover
inferredcites →https://doi.org/10.1007/bfb0014321openalex-snapshot
Preprocessing for invariant validation
inferredcites →https://doi.org/10.1007/bfb0035380openalex-snapshot
Space efficient reachability analysis through use of pseudo-root states
inferredcites →https://doi.org/10.1016/0020-0190(86)90071-2openalex-snapshot
Limits for automatic verification of finite-state concurrent systems
inferredcites →https://doi.org/10.1016/0141-9331(89)90152-xopenalex-snapshot
Parallel program design: a foundation
inferredcites →https://doi.org/10.1016/0167-6423(83)90014-xopenalex-snapshot
An assertional correctness proof of a distributed algorithm
inferredcites →https://doi.org/10.1016/0167-6423(93)90007-copenalex-snapshot
Concurrency without toil: a systematic method for parallel program design
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1016/s0304-3975(96)00191-0openalex-snapshot
Automatic generation of invariants and intermediate assertions
inferredcites →https://doi.org/10.1109/32.58787openalex-snapshot
Mechanically verifying concurrent programs with the Boyer-Moore prover
inferredcites →https://doi.org/10.1109/sfcs.1977.25openalex-snapshot
Program invariants as fixed points
inferredcites →https://doi.org/10.1145/512760.512770openalex-snapshot
Automatic discovery of linear restraints among variables of a program
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
inferredcites →https://doi.org/10.1145/55364.55425openalex-snapshot
A simple solution to Lamport's concurrent programming problem with linear wait
inferredcites →https://doi.org/10.21236/ada324036openalex-snapshot
STeP: The Stanford Temporal Prover,
inferredcites →https://doi.org/10.2172/10129052openalex-snapshot
OTTER 3.0 reference manual and guide

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10722167_26openalex-snapshot
Liveness and Acceleration in Parameterized Verification
inferred← citeshttps://doi.org/10.1007/10722167_31openalex-snapshot
Regular Model Checking
inferred← citeshttps://doi.org/10.1007/11888116_26openalex-snapshot
Liveness by Invisible Invariants
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_19openalex-snapshot
Parameterized Verification with Automatically Computed Inductive Assertions?
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_7openalex-snapshot
Automatic Deductive Verification with Invisible Invariants
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_9openalex-snapshot
Liveness with (0,1, ∞)- Counter Abstraction
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_18openalex-snapshot
System Description Using OBDD’s for the Validationof Skolem Verification Conditions
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_14openalex-snapshot
Handling Global Conditions in Parametrized System Verification
inferred← citeshttps://doi.org/10.1007/978-3-031-98668-0_10openalex-snapshot
$$\textsf{HornStr}$$: Invariant Synthesis for Regular Model Checking as Constrained Horn Clauses
inferred← citeshttps://doi.org/10.1007/978-3-319-04921-2_32openalex-snapshot
Ordered Counter-Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-540-24622-0_19openalex-snapshot
Liveness with Invisible Ranking
inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_36openalex-snapshot
Liveness with Incomprehensible Ranking
inferred← citeshttps://doi.org/10.1007/978-3-642-02138-1_3openalex-snapshot
Approximated Context-Sensitive Analysis for Parameterized Verification
inferred← citeshttps://doi.org/10.1007/s10009-005-0193-xopenalex-snapshot
Liveness with invisible ranking
inferred← citeshttps://doi.org/10.1007/s10009-011-0212-zopenalex-snapshot
Regular model checking for LTL(MSO)
inferred← citeshttps://doi.org/10.1007/s10009-011-0213-yopenalex-snapshot
A lightweight regular model checking approach for parameterized systems
inferred← citeshttps://doi.org/10.1007/s10009-011-0216-8openalex-snapshot
Regular model checking
inferred← citeshttps://doi.org/10.1016/j.cl.2004.02.006openalex-snapshot
Model checking and abstraction to the aid of parameterized systems (a survey)
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.