On the public citation graph

New results on completeness and consistency of abstract data types

https://doi.org/10.1007/bfb0022525
0 signed · 21 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/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1016/0020-0190(79)90071-1openalex-snapshot
A note on simplification orderings
inferredcites →https://doi.org/10.1016/c2013-0-02156-1openalex-snapshot
Computational Problems in Abstract Algebra
inferredcites →https://doi.org/10.1109/sfcs.1977.9openalex-snapshot
Conflunt reductions: Abstract properties and applications to term rewriting systems
inferredcites →https://doi.org/10.1109/sfcs.1979.32openalex-snapshot
Orderings for term-rewriting systems
inferredcites →https://doi.org/10.1145/359138.359142openalex-snapshot
Proving termination with multiset orderings
inferredcites →https://doi.org/10.2307/2005152openalex-snapshot
Computational Problems in Abstract Algebra

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-09981-6_8openalex-snapshot
A case study of abstract implementations and their correctness
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-15984-3_291openalex-snapshot
Completeness in data type specifications
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_80openalex-snapshot
A proof system for conditional algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_97openalex-snapshot
On sufficient completeness of conditional specifications
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_75openalex-snapshot
Automatic proof methods for algebraic specifications
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/978-3-662-54434-1_6openalex-snapshot
Confluence of Graph Rewriting with Interfaces
inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot
Semantics of algorithmic languages
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90023-bopenalex-snapshot
On ground-confluence of term rewriting systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(82)80001-7openalex-snapshot
Algebraic implementation of abstract data types
inferred← citeshttps://doi.org/10.1017/s0960129522000123openalex-snapshot
String diagram rewrite theory III: Confluence with and without Frobenius
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.