On the public citation graph

A simple class of algorithmic specifications for abstract software modules

0 signed · 15 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-08860-1_16openalex-snapshot

Stepwise specification and implementation of abstract data types

inferredcites →https://doi.org/10.1007/3-540-08921-7_64openalex-snapshot

Extensions and implementations of abstract data type specifications

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

Data type specification

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-10699-5_101openalex-snapshot

On the algebraic extensions of abstract data types

inferred← citeshttps://doi.org/10.1007/3-540-10699-5_109openalex-snapshot

The development of an interpreter by means of abstract algebraic software specifications

inferred← citeshttps://doi.org/10.1007/3-540-10843-2_11openalex-snapshot

Algorithmic specifications of abstract data types

inferred← citeshttps://doi.org/10.1007/3-540-11490-4_18openalex-snapshot

Recursive definitions of operations in universal algebras

inferred← citeshttps://doi.org/10.1007/978-1-4613-8928-6_35openalex-snapshot

Recursive Definition and Complexity of Functions Over Arbitrary Data Structures

inferred← citeshttps://doi.org/10.1007/978-3-642-69009-9_15openalex-snapshot

Bibliographie

inferred← citeshttps://doi.org/10.1007/978-3-642-69032-7_2openalex-snapshot

Bibliography

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

Semantics of algorithmic languages

inferred← citeshttps://doi.org/10.1016/0020-0190(82)90091-6openalex-snapshot

A simple transfer lemma for algebraic specifications

inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50018-4openalex-snapshot

Algebraic Specification

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

Parameterized Specifications: Parameter Passing and Implementation with Respect to Observability

inferred← citeshttps://doi.org/10.1147/rd.276.0558openalex-snapshot

SLAN-4: A Language for the Specification and Design of Large Software 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.