On the public citation graph
Observational implementation of algebraic specifications
0 signed · 38 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-07854-1_231openalex-snapshot
Observability concepts in abstract data type specification
inferredcites →https://doi.org/10.1007/3-540-10007-5_41openalex-snapshot
The semantics of clear, a specification language
inferredcites →https://doi.org/10.1007/3-540-15198-2_20openalex-snapshot
On observational equivalence and algebraic specification
inferredcites →https://doi.org/10.1007/3-540-16442-1_26openalex-snapshot
Experiences with the RAP system — a specification interpreter combining term rewriting and resolution
inferredcites →https://doi.org/10.1007/3-540-17660-8_50openalex-snapshot
Toward formal development of programs from algebraic specifications: Implementations revisited
inferredcites →https://doi.org/10.1007/3-540-50325-0_10openalex-snapshot
Initial behaviour semantics for algebraic specifications
inferredcites →https://doi.org/10.1007/3-540-54496-8_16openalex-snapshot
Extended ML: Past, present and future
inferredcites →https://doi.org/10.1007/978-3-642-61284-8openalex-snapshot
Fundamentals of Algebraic Specification 2
inferredcites →https://doi.org/10.1007/978-3-642-69962-7openalex-snapshot
Fundamentals of Algebraic Specification 1
inferredcites →https://doi.org/10.1007/978-3-662-09691-8_10openalex-snapshot
Observational Specification: A Birkhoff-Theorem
inferredcites →https://doi.org/10.1007/bf00264293openalex-snapshot
On hierarchies of abstract data types
inferredcites →https://doi.org/10.1007/bf00283329openalex-snapshot
Toward formal development of programs from algebraic specifications: Implementations revisited
inferredcites →https://doi.org/10.1007/bfb0012770openalex-snapshot
Parameter passing commutes with implementation of parameterized data types
inferredcites →https://doi.org/10.1007/bfb0012775openalex-snapshot
Universal realization, persistent interconnection and implementation of abstract modules
inferredcites →https://doi.org/10.1007/bfb0012793openalex-snapshot
Implementation of parameterised specifications
inferredcites →https://doi.org/10.1016/0022-0000(87)90023-7openalex-snapshot
On observational equivalence and algebraic specification
inferredcites →https://doi.org/10.1016/0304-3975(84)90086-0openalex-snapshot
A systematic study of models of abstract data types
inferredcites →https://doi.org/10.1016/0304-3975(86)90051-4openalex-snapshot
Structured algebraic specifications: A Kernel language
inferredcites →https://doi.org/10.1016/s0304-3975(82)80001-7openalex-snapshot
Algebraic implementation of abstract data types
inferredcites →https://doi.org/10.1145/2166.357212openalex-snapshot
Parameterized Specifications: Parameter Passing and Implementation with Respect to Observability
inferredcites →https://doi.org/10.1145/947864.947865openalex-snapshot
Completeness of many-sorted equational logic
inferredcites →https://doi.org/10.1145/9758.10501openalex-snapshot
On the algebraic definition of programming languages
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11560647_22openalex-snapshot
Externalized and Internalized Notions of Behavioral Refinement
inferred← citeshttps://doi.org/10.1007/3-540-56379-2_36openalex-snapshot
Implementation and behavioural equivalence: A survey
inferred← citeshttps://doi.org/10.1007/978-1-4471-3558-6_2openalex-snapshot
How to Prove Observational Theorems with LP
inferred← citeshttps://doi.org/10.1007/978-1-4613-1437-0_6openalex-snapshot
Semantic Refinement of Concurrent Object Systems Based on Serializability
inferred← citeshttps://doi.org/10.1007/978-3-031-92196-4_15openalex-snapshot
Towards Automatic Structured Inference of Module Abstractions
inferred← citeshttps://doi.org/10.1007/bf01177550openalex-snapshot
Behavioural approaches to algebraic specifications
inferred← citeshttps://doi.org/10.1007/bf01185563openalex-snapshot
Two impossibility theorems on behaviour specification of abstract data types
inferred← citeshttps://doi.org/10.1007/bf01642507openalex-snapshot
Context induction: A proof principle for behavioural abstractions and algebraic implementations
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90166-dopenalex-snapshot
A semi-algorithm for algebraic implementation proofs
inferred← citeshttps://doi.org/10.1017/s0960129500000864openalex-snapshot
Algebraic implementation of abstract data types: a survey of concepts and new compositionality results
inferred← citeshttps://doi.org/10.1049/sej.1991.0040openalex-snapshot
Software testing based on formal specifications: a theory and a tool
inferred← citeshttps://doi.org/10.1109/qsic.2003.1319090openalex-snapshot
A note on test oracles and semantics of algebraic specifications
inferred← citeshttps://doi.org/10.14236/ewic/iwfm2001.4openalex-snapshot
Observation and Abstract Behaviour in Specification and Implementation of State-based 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.