On the public citation graph

Correctness analysis for class of asynchronous communication mechanisms

https://doi.org/10.1049/ip-e.1992.0006

0 signed · 39 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-10235-3openalex-snapshot

A Calculus of Communicating Systems

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

Verification of concurrent programs: Temporal proof principles

inferredcites →https://doi.org/10.1016/0378-4754(83)90038-1openalex-snapshot

The correctness problem in computer science

inferredcites →https://doi.org/10.1049/ip-e.1990.0002openalex-snapshot

Four-slot fully asynchronous communication mechanism

inferredcites →https://doi.org/10.1049/piee.1976.0212openalex-snapshot

Synchronisation and arbitration circuits in digital systems

inferredcites →https://doi.org/10.1109/4.16314openalex-snapshot

Metastability behavior of CMOS ASIC flip-flops in theory and test

inferredcites →https://doi.org/10.1109/40.16792openalex-snapshot

Distributed fault-tolerant real-time systems: the Mars approach

inferredcites →https://doi.org/10.1109/jrproc.1953.274333openalex-snapshot

An Analog-to-Digital Converter for Serial Computing Machines

inferredcites →https://doi.org/10.1109/tc.1981.6312173openalex-snapshot

General theory of metastable operation

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

A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables

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

Hierarchical correctness proofs for distributed algorithms

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

Constructing two-writer atomic registers

inferredcites →https://doi.org/10.21236/ada106750openalex-snapshot

Verification of Concurrent Programs. Part I. The Temporal Framework,

inferredcites →https://doi.org/10.21236/ada116035openalex-snapshot

Verification of Concurrent Programs. Part II. Temporal Proof Principles.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11823285_85openalex-snapshot

Competitive Freshness Algorithms for Wait-Free Data Objects

inferred← citeshttps://doi.org/10.1007/3-540-45614-7_20openalex-snapshot

The Formal Classification and Verification of Simpson’s 4-Slot Asynchronous Communication Mechanism

inferred← citeshttps://doi.org/10.1007/3-540-47884-1_17openalex-snapshot

The Design of a Tool-Supported Graphical Notation for Timed CSP

inferred← citeshttps://doi.org/10.1007/978-1-4471-3548-7_4openalex-snapshot

An Architecture for HCI in Real-time Systems

inferred← citeshttps://doi.org/10.1007/978-1-4757-3143-9_2openalex-snapshot

Complementing Role Models with Petri Nets in Studying Asynchronous Data Communications

inferred← citeshttps://doi.org/10.1007/978-1-4757-6656-1_4openalex-snapshot

Towards Synthesis of Asynchronous Communication Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-319-06200-6_12openalex-snapshot

Using Lightweight Theorem Proving in an Asynchronous Systems Context

inferred← citeshttps://doi.org/10.1007/978-3-540-45236-2_15openalex-snapshot

Proving the Correctness of Simpson’s 4-Slot ACM Using an Assertional Rely-Guarantee Proof Method

inferred← citeshttps://doi.org/10.1007/s00165-004-0042-9openalex-snapshot

Ramifications of metastability in bit variables explored via Simpson’s 4-slot mechanism

inferred← citeshttps://doi.org/10.1007/s00165-009-0141-8openalex-snapshot

Inter-process buffers in separation logic with rely-guarantee

inferred← citeshttps://doi.org/10.1007/s00165-011-0213-4openalex-snapshot

Explanation of two non-blocking shared-variable communication algorithms

inferred← citeshttps://doi.org/10.1049/ip-cdt:19971218openalex-snapshot

New algorithms for asynchronous communication

inferred← citeshttps://doi.org/10.1049/ip-cdt:19971219openalex-snapshot

Role model analysis of an asynchronous communication mechanism

inferred← citeshttps://doi.org/10.1049/ip-cdt:19971220openalex-snapshot

Multireader and multiwriter asynchronous communication mechanisms

inferred← citeshttps://doi.org/10.1049/ip-cdt:20030419openalex-snapshot

Protocols for process interaction

inferred← citeshttps://doi.org/10.1049/sej.1995.0014openalex-snapshot

Structuring the semantic definitions of graphical design notations

inferred← citeshttps://doi.org/10.1109/async.2000.836997openalex-snapshot

Asynchronous communication mechanisms using self-timed circuits

inferred← citeshttps://doi.org/10.1109/ecbs.1994.331683openalex-snapshot

Architecture for computer based systems

inferred← citeshttps://doi.org/10.1109/ecbs.1997.581893openalex-snapshot

Layered architecture(s): principles and practice in concurrent and distributed systems

inferred← citeshttps://doi.org/10.1109/emwrt.1992.637486openalex-snapshot

Absolute and relative temporal constraints in hard real-time databases

inferred← citeshttps://doi.org/10.1109/tc.2006.42openalex-snapshot

Metastability in asynchronous wait-free protocols

inferred← citeshttps://doi.org/10.1109/tii.2007.898439openalex-snapshot

A New Time Independent Asynchronous Protocol and Its Applications

inferred← citeshttps://doi.org/10.14236/ewic/fa1996.3openalex-snapshot

Analysis of the Four-slot Mechanism

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

Complementing the Role Model Method with Petri Net Techniques in Studying Issues of Data Freshness of the Four-slot Mechanism

inferred← citeshttps://doi.org/10.25439/rmt.27351075openalex-snapshot

2-wire time independent asynchronous communications

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.