On the public citation graph
Universal realization, persistent interconnection and implementation of abstract modules
0 signed · 153 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-10003-2_68openalex-snapshot
Parameterized data types in algebraic specification languages
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-10828-9_51openalex-snapshot
Algebraic theory of parameterized specifications with requirements
inferredcites →https://doi.org/10.1007/3-540-10828-9_65openalex-snapshot
Initial and terminal algebra semantics of parameterized abstract data type specifications with inequalities
inferredcites →https://doi.org/10.1007/3-540-10856-4_93openalex-snapshot
On realization and implementation
inferredcites →https://doi.org/10.1007/3-540-11490-4_21openalex-snapshot
Parameter passing in algebraic specification languages
inferredcites →https://doi.org/10.1007/bf00260922openalex-snapshot
The algebraic specification of abstract data types
inferredcites →https://doi.org/10.1007/bf00289507openalex-snapshot
Proof of correctness of data representations
inferredcites →https://doi.org/10.1007/bfb0022512openalex-snapshot
Abstract implementation of abstract data types
inferredcites →https://doi.org/10.1016/0022-0000(79)90011-4openalex-snapshot
Final algebra semantics and data type extensions
inferredcites →https://doi.org/10.1016/s0019-9958(67)90670-5openalex-snapshot
Automata in general algebras
inferredcites →https://doi.org/10.1073/pnas.50.5.869openalex-snapshot
FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
inferredcites →https://doi.org/10.1145/359657.359667openalex-snapshot
An example of hierarchical design and proof
inferredcites →https://doi.org/10.1145/361598.361623openalex-snapshot
On the criteria to be used in decomposing systems into modules
inferredcites →https://doi.org/10.1145/947864.947865openalex-snapshot
Completeness of many-sorted equational logic
inferredcites →https://doi.org/10.1145/947886.947887openalex-snapshot
Completeness of many-sorted equational logic
inferredcites →https://doi.org/10.1159/000389460openalex-snapshot
Mathematical Representation of Hierarchically Organized Systems
inferredcites →https://doi.org/10.21236/ada091271openalex-snapshot
The SRI International Hierarchical Development Handbook. Volume II. The Languages and Tools of HDM.
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/11780274_18openalex-snapshot
Proving Behavioral Refinements of COL-specifications
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_116openalex-snapshot
Characterizing composability of abstract implementations
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_122openalex-snapshot
A kernel language for algebraic specification and implementation extended abstract
inferred← citeshttps://doi.org/10.1007/3-540-13346-1_16openalex-snapshot
Partial implementations of abstract data types: A dissenting view on errors
inferred← citeshttps://doi.org/10.1007/3-540-13346-1_17openalex-snapshot
Building specifications in an arbitrary institution
inferred← citeshttps://doi.org/10.1007/3-540-13346-1_18openalex-snapshot
A proof system for verifying composability of abstract implementations
inferred← citeshttps://doi.org/10.1007/3-540-15198-2_20openalex-snapshot
On observational equivalence and algebraic specification
inferred← citeshttps://doi.org/10.1007/3-540-16442-1_9openalex-snapshot
Design and implementation of a generic, logic and functional programming language
inferred← citeshttps://doi.org/10.1007/3-540-17162-2_134openalex-snapshot
Behavioural program specification
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_50openalex-snapshot
Toward formal development of programs from algebraic specifications: Implementations revisited
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_56openalex-snapshot
Parameterized horn clause specifications: Proof theory and correctness
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_57openalex-snapshot
Partial composition and recursion of module specifications
inferred← citeshttps://doi.org/10.1007/3-540-18508-9_27openalex-snapshot
Viewing implementations as an institution
inferred← citeshttps://doi.org/10.1007/3-540-19027-9_5openalex-snapshot
Implementation of modular algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_1openalex-snapshot
Global Development via Local Observational Construction Steps
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_11openalex-snapshot
Semantics of First Order Parametric Specifications
inferred← citeshttps://doi.org/10.1007/3-540-50325-0_10openalex-snapshot
Initial behaviour semantics for algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-50325-0_9openalex-snapshot
Observing nondeterministic data types
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_139openalex-snapshot
Implementation of parameterized observational specifications
inferred← citeshttps://doi.org/10.1007/3-540-50940-2_48openalex-snapshot
Toward formal development of ML programs: Foundations and methodology
inferred← citeshttps://doi.org/10.1007/3-540-51722-7_10openalex-snapshot
Categories for the development of algebraic module specifications
inferred← citeshttps://doi.org/10.1007/3-540-51722-7_13openalex-snapshot
Semantical constructions for categories of behavioural specifications
inferred← citeshttps://doi.org/10.1007/3-540-52048-1_43openalex-snapshot
Algebraic software development concepts for module and configuration families
inferred← citeshttps://doi.org/10.1007/3-540-52513-0_2openalex-snapshot
An algebraic approach to refinement
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_108openalex-snapshot
Equational logics (birkhoff's method revisited)
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_111openalex-snapshot
Constrained equational deduction
inferred← citeshttps://doi.org/10.1007/3-540-55253-7_3openalex-snapshot
Towards an adequate notion of observation
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_112openalex-snapshot
Toward formal development of programs from algebraic specifications: Model-theoretic foundations
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_109openalex-snapshot
Verification of large software systems
inferred← citeshttps://doi.org/10.1007/3-540-56379-2_36openalex-snapshot
Implementation and behavioural equivalence: A survey
inferred← citeshttps://doi.org/10.1007/3-540-56379-2_43openalex-snapshot
Process semantics of temporal logic specification
inferred← citeshttps://doi.org/10.1007/3-540-56379-2_45openalex-snapshot
Specifications with observable formulae and observational satisfaction relation
inferred← citeshttps://doi.org/10.1007/3-540-57867-6_1openalex-snapshot
Towards an algebraic semantics for the object paradigm
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_11openalex-snapshot
Strategies in modular system design by interface rewriting
inferred← citeshttps://doi.org/10.1007/3-540-58431-5_6openalex-snapshot
Proving behavioural theorems with standard first-order logic
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_199openalex-snapshot
On behavioural abstraction and behavioural satisfaction in higher-order logic
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_211openalex-snapshot
Generated models and the ω-rule: The nondeterministic case
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_51openalex-snapshot
Proving the correctness of behavioural implementations
inferred← citeshttps://doi.org/10.1007/3-540-61629-2_53openalex-snapshot
Behavioural equivalence, bisimulation, and minimal realisation
inferred← citeshttps://doi.org/10.1007/978-0-387-35261-9_19openalex-snapshot
Objects as Abstract Machines
inferred← citeshttps://doi.org/10.1007/978-0-387-35264-0_7openalex-snapshot
Refinement of Parameterized Algebraic Specifications
inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_21openalex-snapshot
On the Correctness of Modular Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3229-5_11openalex-snapshot
The Semantics of Extended ML: A Gentle Introduction
inferred← citeshttps://doi.org/10.1007/978-3-319-15545-6_12openalex-snapshot
Abstract Constraint Data Types
inferred← citeshttps://doi.org/10.1007/978-3-319-15545-6_17openalex-snapshot
The Foundational Legacy of ASL
inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_1openalex-snapshot
José Meseguer: Scientist and Friend Extraordinaire
inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_16openalex-snapshot
Model-Checking Helena Ensembles with Spin
inferred← citeshttps://doi.org/10.1007/978-3-540-24626-8_5openalex-snapshot
Toward Component-Oriented Formal Software Development: An Algebraic Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-04164-8_4openalex-snapshot
Order-Sorted Parameterization and Induction
inferred← citeshttps://doi.org/10.1007/978-3-642-59851-7_6openalex-snapshot
Structuring and Modularity
inferred← citeshttps://doi.org/10.1007/978-3-662-09691-8_10openalex-snapshot
Observational Specification: A Birkhoff-Theorem
inferred← citeshttps://doi.org/10.1007/978-3-662-09691-8_15openalex-snapshot
Passing Compatibility is Almost Persistency
inferred← citeshttps://doi.org/10.1007/bf00263649openalex-snapshot
Non-deterministic data types: models and implementations
inferred← citeshttps://doi.org/10.1007/bf00283329openalex-snapshot
Toward formal development of programs from algebraic specifications: Implementations revisited
inferred← citeshttps://doi.org/10.1007/bf01178505openalex-snapshot
Observational implementation of algebraic specifications
inferred← citeshttps://doi.org/10.1007/bf01178578openalex-snapshot
Contextual rewriting as a sound and complete proof method for conditional LOG-specifications
inferred← citeshttps://doi.org/10.1007/bf01211084openalex-snapshot
Essential concepts of algebraic specification and program development
inferred← citeshttps://doi.org/10.1007/bf02737104openalex-snapshot
Toward formal development of programs from algebraic specifications: Implementations revisited
inferred← citeshttps://doi.org/10.1007/bfb0014314openalex-snapshot
Object-oriented implementation of abstract data type specifications
inferred← citeshttps://doi.org/10.1007/bfb0015038openalex-snapshot
Software specification by behavioural canons
inferred← citeshttps://doi.org/10.1007/bfb0015747openalex-snapshot
Operational semantics for order-sorted algebra
inferred← citeshttps://doi.org/10.1007/bfb0016234openalex-snapshot
Algebraic theory of module specifications with constraints
inferred← citeshttps://doi.org/10.1007/bfb0019445openalex-snapshot
A categorial theory of objects as observed processes
inferred← citeshttps://doi.org/10.1007/bfb0019451openalex-snapshot
Producing abstract models for object-oriented languages
inferred← citeshttps://doi.org/10.1007/bfb0022657openalex-snapshot
Inner and mutual compatibility of basic operations on module specifications
inferred← citeshttps://doi.org/10.1007/bfb0026102openalex-snapshot
Product and iteration of module specifications
inferred← citeshttps://doi.org/10.1007/bfb0028827openalex-snapshot
Continuous abstract data types: Basic machinery and results
inferred← citeshttps://doi.org/10.1007/bfb0035766openalex-snapshot
On recent trends in algebraic specification
inferred← citeshttps://doi.org/10.1007/bfb0035788openalex-snapshot
Modular system design applying graph grammars techniques
inferred← citeshttps://doi.org/10.1007/bfb0039610openalex-snapshot
On implementations of loose abstract data type specifications and their vertical composition
inferred← citeshttps://doi.org/10.1007/bfb0053063openalex-snapshot
Inheritance and cofree constructions
inferred← citeshttps://doi.org/10.1007/s00200-003-0129-1openalex-snapshot
An Object-oriented Interpretation of the EAT System
inferred← citeshttps://doi.org/10.1007/s002360050149openalex-snapshot
Modular correctness proofs of behavioural implementations
inferred← citeshttps://doi.org/10.1007/s002360050168openalex-snapshot
A complete algebraic characterization of behavioral subtyping
inferred← citeshttps://doi.org/10.1016/0004-3702(88)90052-5openalex-snapshot
Modular algebraic specification of some basic geometrical constructions
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90023-7openalex-snapshot
On observational equivalence and algebraic specification
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90028-6openalex-snapshot
Algebraic specification of modules and their basic interconnections
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90037-7openalex-snapshot
Union and actualization of module specifications: Some compatibility results
inferred← citeshttps://doi.org/10.1016/0167-6423(90)90057-kopenalex-snapshot
Behavioural correctness of data representations
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90121-9openalex-snapshot
Compatibility of parameter passing and implementation of parameterized data types
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90051-4openalex-snapshot
Structured algebraic specifications: A Kernel language
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90054-5openalex-snapshot
A characterization of passing compatibility for parameterized specifications
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90042-zopenalex-snapshot
Foundations of rule-based design of modular systems
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90302-vopenalex-snapshot
Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00207-yopenalex-snapshot
On the correctness of modular systems
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00039-4openalex-snapshot
Behavioural theories and the proof of behavioural properties
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00068-0openalex-snapshot
On behavioural abstraction and behavioural satisfaction in higher-order logic
inferred← citeshttps://doi.org/10.1016/0890-5401(88)90008-9openalex-snapshot
Specifications in an arbitrary institution
inferred← citeshttps://doi.org/10.1016/0890-5401(88)90017-xopenalex-snapshot
Bisimulation of automata
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50018-4openalex-snapshot
Algebraic Specification
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.07.027openalex-snapshot
Behavioral abstraction is hiding information
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00162-4openalex-snapshot
Proof systems for structured specifications with observability operators
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00163-6openalex-snapshot
The definition of Extended ML: A gentle introduction
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)87172-1openalex-snapshot
The behavior-realization adjunction and generalized homomorphic relations
inferred← citeshttps://doi.org/10.1016/s1567-8326(01)00011-xopenalex-snapshot
A hidden Herbrand theorem: combining the object and logic paradigms
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80366-9openalex-snapshot
Towards Behavioral Maude
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80645-5openalex-snapshot
Inductive Behavioral Proofs by Unhiding
inferred← citeshttps://doi.org/10.1017/cbo9780511792588.003openalex-snapshot
An introduction to (co)algebra and (co)induction
inferred← citeshttps://doi.org/10.1017/s0960129500000517openalex-snapshot
An Oxford survey of order sorted algebra
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.1017/s0960129500001110openalex-snapshot
A formalism for the specification of essentially-algebraic structures in 2-categories
inferred← citeshttps://doi.org/10.1017/s0960129598002606openalex-snapshot
Abstract and behaviour module specifications
inferred← citeshttps://doi.org/10.1017/s0960129599002777openalex-snapshot
Hidden coinduction: behavioural correctness proofs for objects
inferred← citeshttps://doi.org/10.1109/ase.1997.632840openalex-snapshot
Declarative specification of software architectures
inferred← citeshttps://doi.org/10.1109/icse.1990.63624openalex-snapshot
A rule-based approach to modular system design
inferred← citeshttps://doi.org/10.1109/mc.1986.1663146openalex-snapshot
Reusing and Interconnecting Software Components
inferred← citeshttps://doi.org/10.1145/147508.147524openalex-snapshot
Institutions: abstract model theory for specification and programming
inferred← citeshttps://doi.org/10.1145/162754.162815openalex-snapshot
Parametrized programming in LILEANNA
inferred← citeshttps://doi.org/10.1145/201059.201070openalex-snapshot
A complete calculus for the multialgebraic and functional semantics of nondeterminism
inferred← citeshttps://doi.org/10.1145/2166.357212openalex-snapshot
Parameterized Specifications: Parameter Passing and Implementation with Respect to Observability
inferred← citeshttps://doi.org/10.1145/24714.24719openalex-snapshot
Remarks on remarks on many-sorted equational logic
inferred← citeshttps://doi.org/10.1145/323648.323755openalex-snapshot
Extensions and foundations of object-oriented programming
inferred← citeshttps://doi.org/10.1145/42192.42194openalex-snapshot
A mathematical approach to nondeterminism in data types
inferred← citeshttps://doi.org/10.1145/947864.947865openalex-snapshot
Completeness of many-sorted equational logic
inferred← citeshttps://doi.org/10.5555/100296.100324openalex-snapshot
A rule-based approach to modular system design
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.