On the public citation graph
Checking verifications of protocols and distributed systems by computer
0 signed · 88 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-49135-x_2openalex-snapshot
Inductive Analysis of the Internet Protocol TLS
inferredcites →https://doi.org/10.1007/3-540-55092-5_12openalex-snapshot
Mechanical verification of a generalized protocol for Byzantine fault tolerant clock synchronization
inferredcites →https://doi.org/10.1007/3-540-56496-9_5openalex-snapshot
Mechanical verification of concurrent systems with TLA
inferredcites →https://doi.org/10.1007/3-540-56496-9_6openalex-snapshot
Using a theorem prover for reasoning about concurrent algorithms
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_23openalex-snapshot
Verification of real-time systems using PVS
inferredcites →https://doi.org/10.1007/3-540-56922-7_24openalex-snapshot
The formal verification of an algorithm for interactive consistency under a hybrid fault model
inferredcites →https://doi.org/10.1007/3-540-56922-7_25openalex-snapshot
Computer-assisted simulation proofs
inferredcites →https://doi.org/10.1007/3-540-57887-0_95openalex-snapshot
A computer-checked verification of Milner's scheduler
inferredcites →https://doi.org/10.1007/3-540-58085-9_75openalex-snapshot
Proof-checking a data link protocol
inferredcites →https://doi.org/10.1007/3-540-58468-4_165openalex-snapshot
Verification of an audio control protocol
inferredcites →https://doi.org/10.1007/3-540-60630-0_1openalex-snapshot
Combining model checking and deduction for I/O- automata
inferredcites →https://doi.org/10.1007/3-540-60688-2_54openalex-snapshot
Formalizing inductive proofs of network algorithms
inferredcites →https://doi.org/10.1007/3-540-60692-0_43openalex-snapshot
Verifying part of the ACCESS.bus protocol using PVS
inferredcites →https://doi.org/10.1007/3-540-60973-3_113openalex-snapshot
Experiments in theorem proving and model checking for protocol verification
inferredcites →https://doi.org/10.1007/3-540-61780-9_67openalex-snapshot
An application of co-inductive types in Coq: Verification of the alternating bit protocol
inferredcites →https://doi.org/10.1007/3-540-63533-5_21openalex-snapshot
A TLA solution to the specification and verification of the RLP1 retransmission protocol
inferredcites →https://doi.org/10.1007/978-0-387-34878-0_19openalex-snapshot
Verifying Timing Properties of Concurrent Algorithms
inferredcites →https://doi.org/10.1007/978-0-387-34945-9_7openalex-snapshot
Formal Verification of a Protocol for Communications over faulty channels
inferredcites →https://doi.org/10.1007/978-0-387-35079-0_2openalex-snapshot
Computer-Assisted Verification of an Algorithm for Concurrent Timestamps
inferredcites →https://doi.org/10.1007/978-1-4471-2120-6_2openalex-snapshot
The Syntax and Semantics of μCRL
inferredcites →https://doi.org/10.1007/978-1-4612-2704-5openalex-snapshot
Larch: Languages and Tools for Formal Specification
inferredcites →https://doi.org/10.1007/978-3-540-48654-1_30openalex-snapshot
Invariants in Process Algebra with Data
inferredcites →https://doi.org/10.1007/bf00709156openalex-snapshot
Verification of a multiprocessor cache protocol using simulation relations and higher-order logic
inferredcites →https://doi.org/10.1007/bf01211081openalex-snapshot
A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol
inferredcites →https://doi.org/10.1007/bf01211305openalex-snapshot
A mechanically verified incremental garbage collector
inferredcites →https://doi.org/10.1007/bf01211619openalex-snapshot
A mechanical proof of Segall's PIF algorithm
inferredcites →https://doi.org/10.1007/bf01212523openalex-snapshot
Formalizing process algebraic verifications in the calculus of constructions
inferredcites →https://doi.org/10.1007/bfb0000476openalex-snapshot
Verification of distributed real-time and fault-tolerant protocols
inferredcites →https://doi.org/10.1007/bfb0014338openalex-snapshot
A bounded retransmission protocol for large data packets
inferredcites →https://doi.org/10.1007/bfb0014724openalex-snapshot
Verifying hybrid systems modeled as timed automata: A case study
inferredcites →https://doi.org/10.1007/bfb0027243openalex-snapshot
Proving safety properties of the steam boiler controller
inferredcites →https://doi.org/10.1007/bfb0027249openalex-snapshot
Assertional specification and verification using PVS of the steam boiler control system
inferredcites →https://doi.org/10.1007/bfb0030627openalex-snapshot
Traces of I/O-automata in Isabelle/HOLCF
inferredcites →https://doi.org/10.1007/bfb0032002openalex-snapshot
Forward and backward simulations for timing-based systems
inferredcites →https://doi.org/10.1007/bfb0035176openalex-snapshot
Concurrent Timestamping made simple
inferredcites →https://doi.org/10.1007/s001650050035openalex-snapshot
The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract
inferredcites →https://doi.org/10.1016/0141-9331(89)90152-xopenalex-snapshot
Parallel program design: a foundation
inferredcites →https://doi.org/10.1016/0378-4754(83)90038-1openalex-snapshot
The correctness problem in computer science
inferredcites →https://doi.org/10.1016/0378-4754(89)90181-xopenalex-snapshot
A computational logic handbook
inferredcites →https://doi.org/10.1016/c2013-0-10412-6openalex-snapshot
A Computational Logic Handbook
inferredcites →https://doi.org/10.1016/s1567-8326(01)00010-8openalex-snapshot
Focus points and convergent process operators: a proof strategy for protocol verification
inferredcites →https://doi.org/10.1016/s1571-0661(05)80429-3openalex-snapshot
Abstraction of parameterized networks
inferredcites →https://doi.org/10.1109/32.58787openalex-snapshot
Mechanically verifying concurrent programs with the Boyer-Moore prover
inferredcites →https://doi.org/10.1109/32.588534openalex-snapshot
An industrial strength theorem prover for a logic based on Common Lisp
inferredcites →https://doi.org/10.1109/32.663997openalex-snapshot
Formal verification of concurrent programs using the Larch prover
inferredcites →https://doi.org/10.1109/cmpass.1996.507872openalex-snapshot
ACL2: an industrial strength version of Nqthm
inferredcites →https://doi.org/10.1109/cmpass.1996.507873openalex-snapshot
Comparing verification systems: interactive consistency in ACL2
inferredcites →https://doi.org/10.1109/cmpass.1997.613201openalex-snapshot
On the formal verification of delegation in SESAME
inferredcites →https://doi.org/10.1109/real.1994.342724openalex-snapshot
The generalized railroad crossing: a case study in formal verification of real-time systems
inferredcites →https://doi.org/10.1109/rttas.1996.509536openalex-snapshot
Mechanical verification of timed automata: a case study
inferredcites →https://doi.org/10.1137/s0097539790192647openalex-snapshot
Bounded Concurrent Time-Stamping
inferredcites →https://doi.org/10.1142/9789812708472_0005openalex-snapshot
Focus Points and Convergent Process Operators
inferredcites →https://doi.org/10.1145/2455.2457openalex-snapshot
Synchronizing clocks in the presence of faults
inferredcites →https://doi.org/10.1145/263699.263747openalex-snapshot
Automatic verification of parameterized linear networks of processes
inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot
A Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.1145/3788687openalex-snapshot
An Introduction to Input/Output Automata
inferredcites →https://doi.org/10.17863/cam.23640openalex-snapshot
ISABELLE - THE NEXT 700 THEOREM PROVERS
inferredcites →https://doi.org/10.21236/ada106750openalex-snapshot
Verification of Concurrent Programs. Part I. The Temporal Framework,
inferredcites →https://doi.org/10.3176/eng.1998.2.02openalex-snapshot
FORMAL VERIFICATION OF THE BINARY EXPONENTIAL BACKOFF PROTOCOL
inferredcites →https://doi.org/10.3233/jcs-1998-61-205openalex-snapshot
The inductive approach to verifying cryptographic protocols
inferredcites →https://doi.org/10.48456/tr-432openalex-snapshot
On two formal analyses of the Yahalom protocol
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-36576-1_17openalex-snapshot
Cones and Foci for Protocol Verification Revisited
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_23openalex-snapshot
µCRL: A Toolset for Analysing Algebraic Specifications
inferred← citeshttps://doi.org/10.1007/3-540-49019-1_3openalex-snapshot
Reasoning about Concurrent Systems Using Types
inferred← citeshttps://doi.org/10.1007/978-3-540-30469-2_42openalex-snapshot
Checking Asynchronously Communicating Components Using Symbolic Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-73770-4_5openalex-snapshot
Testing and Proving Distributed Algorithms in Constructive Type Theory
inferred← citeshttps://doi.org/10.1007/pl00008930openalex-snapshot
An algorithm for the asynchronous Write-All problem based on process collision
inferred← citeshttps://doi.org/10.1007/s10009-009-0110-9openalex-snapshot
Solving scheduling problems by untimed model checking
inferred← citeshttps://doi.org/10.1007/s10703-006-0004-3openalex-snapshot
Cones and foci: A mechanical framework for protocol verification
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50035-7openalex-snapshot
Algebraic Process Verification
inferred← citeshttps://doi.org/10.1016/j.jlap.2005.05.001openalex-snapshot
Analyzing a χ model of a turntable system using Spin, CADP and Uppaal
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00215-0openalex-snapshot
The cones and foci proof technique for timed transition systems
inferred← citeshttps://doi.org/10.1023/a:1008770222354openalex-snapshot
Planning Proofs of Equations in CCS
inferred← citeshttps://doi.org/10.1109/iceccs.2005.51openalex-snapshot
From χt to µCRL: Combining Performance and Functional Analysis
inferred← citeshttps://doi.org/10.1109/iceccs.2007.13openalex-snapshot
Achieving Discrete Relative Timing with Untimed Process Algebra
inferred← citeshttps://doi.org/10.1109/icraie47735.2019.9037782openalex-snapshot
Proof of Properties of a Syntax Analyzer of Robotic Mission Plans
inferred← citeshttps://doi.org/10.1109/oceanse.2005.1513174openalex-snapshot
Embedded intelligent supervision and piloting for oceanographic AUV
inferred← citeshttps://doi.org/10.1109/oceanse.2005.1513177openalex-snapshot
Investigation of safety mechanisms for oceanographic AUV missions programming
inferred← citeshttps://doi.org/10.1145/1081180.1081188openalex-snapshot
Solving scheduling problems by untimed model checking
inferred← citeshttps://doi.org/10.25046/aj0601116openalex-snapshot
Formal Proof of Properties of a Syntax-Oriented Editor of Robotic Missions Plans
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.