On the public citation graph

Design and verification of fault tolerant systems with CSP

0 signed · 42 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-1-4684-5775-9_5openalex-snapshot

Reliable programming in standard languages

inferredcites →https://doi.org/10.1007/978-3-322-96753-4openalex-snapshot

The Foundations of Program Verification

inferredcites →https://doi.org/10.1007/978-3-642-59412-0_33openalex-snapshot

Structured Analysis and System Specification

inferredcites →https://doi.org/10.1007/bf01784887openalex-snapshot

Fault tolerant processes

inferredcites →https://doi.org/10.1007/bf01786251openalex-snapshot

Algebraic specification and proof of a distributed recovery algorithm

inferredcites →https://doi.org/10.1007/bf01887197openalex-snapshot

Development methods for trusted computer systems

inferredcites →https://doi.org/10.1016/0011-684x(86)90240-6openalex-snapshot

Systematic software development using VDM

inferredcites →https://doi.org/10.1016/0020-0190(87)90001-9openalex-snapshot

Two normal form theorems for CSP programs

inferredcites →https://doi.org/10.1016/0141-9331(86)90196-1openalex-snapshot

Communicating sequential processes

inferredcites →https://doi.org/10.1016/0378-4754(86)90097-2openalex-snapshot

The foundations of program verification.

inferredcites →https://doi.org/10.1145/357103.357110openalex-snapshot

A Proof System for Communicating Sequential Processes

inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot

An axiomatic basis for computer programming

inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot

An axiomatic basis for computer programming

inferredcites →https://doi.org/10.1145/5956.6000openalex-snapshot

Correctness proofs of distributed termination algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1002/stvr.258openalex-snapshot

Model checking fault tolerant systems

inferred← citeshttps://doi.org/10.1007/11423348_19openalex-snapshot

Applied Formal Methods – From CSP to Executable Hybrid Specifications

inferred← citeshttps://doi.org/10.1007/3-540-49366-2_6openalex-snapshot

Semantics and Logic for Provable Fault-Tolerance, A Tutorial

inferred← citeshttps://doi.org/10.1007/3-540-56891-3_16openalex-snapshot

Trace-based compositional reasoning about fault tolerant systems

inferred← citeshttps://doi.org/10.1007/3-540-58426-9_125openalex-snapshot

Formal reasoning on fault coverage of fault tolerant techniques: A case study

inferred← citeshttps://doi.org/10.1007/3-540-58468-4_174openalex-snapshot

Fault-tolerant bisimulation and process transformations

inferred← citeshttps://doi.org/10.1007/978-0-387-34878-0_42openalex-snapshot

Stepwise Transformations for Fault-Tolerant Design of CCS Processes

inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_6openalex-snapshot

Exception Handling in Process Algebra

inferred← citeshttps://doi.org/10.1007/978-1-4471-3240-0_2openalex-snapshot

Formal Semantics for Ward & Mellor’s Transformation Schemas

inferred← citeshttps://doi.org/10.1007/978-1-4615-3220-0_7openalex-snapshot

CSP, Formal Software Engineering and the Development of Fault-Tolerant Systems

inferred← citeshttps://doi.org/10.1007/978-3-319-23506-6_10openalex-snapshot

Translating Testing Theories for Concurrent Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-78486-6_60openalex-snapshot

Formale Spezifikation generischer ITSEC-Funktionalitätsklassen

inferred← citeshttps://doi.org/10.1007/978-3-7091-4009-3_3openalex-snapshot

Design for Dependability

inferred← citeshttps://doi.org/10.1007/978-3-7091-4009-3_4openalex-snapshot

Tracing Fault Tolerance

inferred← citeshttps://doi.org/10.1007/bfb0000478openalex-snapshot

On bisimulation, fault-monotonicity and provable fault-tolerance

inferred← citeshttps://doi.org/10.1016/0304-3975(94)90167-8openalex-snapshot

A trace-based compositional proof theory for fault tolerant distributed systems

inferred← citeshttps://doi.org/10.1016/0951-8320(94)90065-5openalex-snapshot

Critical system properties: survey and taxonomy

inferred← citeshttps://doi.org/10.1016/j.micpro.2004.07.005openalex-snapshot

Formal verification of fault-tolerant software design: the CSP approach

inferred← citeshttps://doi.org/10.1016/s1474-6670(17)44867-1openalex-snapshot

Formally Specify Evolutionary Complex Systems

inferred← citeshttps://doi.org/10.1023/a:1022997110855openalex-snapshot

Design and Verification of Distributed Recovery Blocks with CSP

inferred← citeshttps://doi.org/10.1093/comjnl/43.3.191openalex-snapshot

Formally Verifying Fault Tolerant System Designs

inferred← citeshttps://doi.org/10.1109/apaqs.2001.990023openalex-snapshot

Incremental fault-tolerant design in an object-oriented setting

inferred← citeshttps://doi.org/10.1109/etfa.2005.1612616openalex-snapshot

An Approach to Modelling and Analysis of Coordinated Atomic Actions

inferred← citeshttps://doi.org/10.1109/iceccs.1995.479356openalex-snapshot

Formal specification of real-time dependable systems

inferred← citeshttps://doi.org/10.1109/isorc.1998.666809openalex-snapshot

Validating the design of dependable systems

inferred← citeshttps://doi.org/10.1109/reldis.1993.393475openalex-snapshot

A compositional proof theory for fault tolerant real-time distributed systems

inferred← citeshttps://doi.org/10.1145/2063239.2063240openalex-snapshot

Feasibility of Stepwise Design of Multitolerant Programs

inferred← citeshttps://doi.org/10.25405/ncl.34197366openalex-snapshot

A Method for Rigorous Development of Fault-Tolerant Systems

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.