On the public citation graph

Specification and implementation of concurrently accessed data structures: An abstract data type approach

https://doi.org/10.1007/bfb0039609
0 signed · 33 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-06859-7_145openalex-snapshot
First version of a data flow procedure language
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-12689-9_122openalex-snapshot
A kernel language for algebraic specification and implementation extended abstract
inferredcites →https://doi.org/10.1007/3-540-15198-2_2openalex-snapshot
Specification and top down design of distributed systems
inferredcites →https://doi.org/10.1007/3-540-15198-2_22openalex-snapshot
On the parameterized algebraic specification of concurrent systems
inferredcites →https://doi.org/10.1007/3-540-15198-2_26openalex-snapshot
A LISP compiler for FP language and its proof via algebraic semantics
inferredcites →https://doi.org/10.1007/3-540-15670-4_10openalex-snapshot
Lectures on a calculus for communicating systems
inferredcites →https://doi.org/10.1007/3-540-16078-7_80openalex-snapshot
Abstract implementations and correctness proofs
inferredcites →https://doi.org/10.1007/bfb0014668openalex-snapshot
Specifications and proofs for abstract data types in concurrent programs
inferredcites →https://doi.org/10.1016/0167-6423(85)90010-3openalex-snapshot
Top-down design and the algebra of communicating processes
inferredcites →https://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferredcites →https://doi.org/10.1109/mc.1982.1653938openalex-snapshot
Data Flow Languages
inferredcites →https://doi.org/10.1109/tse.1975.6312816openalex-snapshot
Specification techniques for data abstractions
inferredcites →https://doi.org/10.1145/1041490.1041493openalex-snapshot
Data-dependent concurrency control and recovery
inferredcites →https://doi.org/10.1145/3318.3319openalex-snapshot
Implementation of resilient, atomic data types
inferredcites →https://doi.org/10.1145/357195.357202openalex-snapshot
Final Data Types and Their Specification
inferredcites →https://doi.org/10.1145/359576.359579openalex-snapshot
Can programming be liberated from the von Neumann style?
inferredcites →https://doi.org/10.1145/390016.808426openalex-snapshot
Specification techniques for data abstractions
inferredcites →https://doi.org/10.1145/567446.567459openalex-snapshot
Final data type specifications
inferredcites →https://doi.org/10.1145/69622.357193openalex-snapshot
On the Development of the Algebra of Functional Programs
inferredcites →https://doi.org/10.1145/69624.357207openalex-snapshot
Specifying Concurrent Program Modules

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-50403-6_38openalex-snapshot
Data in a concurrent environment
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_69openalex-snapshot
Transformation of combined data type and process specifications using projection algebras
inferred← citeshttps://doi.org/10.1007/3-540-53912-3_30openalex-snapshot
From an ERAE requirements specification to a PLUSS algebraic specification: A case study
inferred← citeshttps://doi.org/10.1007/3-540-56379-2_33openalex-snapshot
Algebraic specification of concurrency
inferred← citeshttps://doi.org/10.1007/978-1-4471-3534-0_20openalex-snapshot
Temporal Specifications Directed by Grammar and Design of Process Networks
inferred← citeshttps://doi.org/10.1007/978-1-4612-4476-9_10openalex-snapshot
On Bounded Buffers: Modularity, Robustness, and Reliability in Reactive Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-74127-2_3openalex-snapshot
Spezifikation und Entwurf komplexer, kausal vernetzter Systeme
inferred← citeshttps://doi.org/10.1007/bf02276638openalex-snapshot
Algebraic and functional specification of an interactive serializable database interface
inferred← citeshttps://doi.org/10.1007/bfb0015037openalex-snapshot
An integrated algebraic approach to the specification of data types, processes and objects
inferred← citeshttps://doi.org/10.1016/0167-6423(88)90065-2openalex-snapshot
Views of queues
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50018-4openalex-snapshot
Algebraic Specification
inferred← citeshttps://doi.org/10.1109/ftdcs.1988.26695openalex-snapshot
Requirements and design specification of distributed systems: the lift problem
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.