On the public citation graph

Partial abstract types

https://doi.org/10.1007/bf00625280
0 signed · 177 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-07854-1_231openalex-snapshot
Observability concepts in abstract data type specification
inferredcites →https://doi.org/10.1007/3-540-08921-7_53openalex-snapshot
The algebraic semantics of recursive program schemes
inferredcites →https://doi.org/10.1007/3-540-08921-7_57openalex-snapshot
Synthesis of communicating behaviour
inferredcites →https://doi.org/10.1007/3-540-08921-7_58openalex-snapshot
Programming languages as mathematical objects
inferredcites →https://doi.org/10.1007/3-540-09981-6_20openalex-snapshot
A model-theoretic approach to specification, extension, and implementation
inferredcites →https://doi.org/10.1007/3-540-10003-2_61openalex-snapshot
A characterisation of computable data types by means of a finite equational specification method
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-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-10003-2_80openalex-snapshot
Terminal algebra semantics and retractions for abstract data types
inferredcites →https://doi.org/10.1007/3-540-10699-5_101openalex-snapshot
On the algebraic extensions of abstract data types
inferredcites →https://doi.org/10.1007/3-540-10828-9_61openalex-snapshot
On the algebraic specification of nondeterministic programming languages
inferredcites →https://doi.org/10.1007/3-540-10856-4_85openalex-snapshot
On the power of algebraic specifications
inferredcites →https://doi.org/10.1007/978-3-662-05654-7openalex-snapshot
Algorithmische Sprache und Programmentwicklung
inferredcites →https://doi.org/10.1007/978-3-662-05656-1openalex-snapshot
Algorithmische Sprache und Programmentwicklung
inferredcites →https://doi.org/10.1007/978-94-009-7893-5_12openalex-snapshot
An Analysis of Semantic Models for Algebraic Specifications
inferredcites →https://doi.org/10.1007/bf00264293openalex-snapshot
On hierarchies of abstract data types
inferredcites →https://doi.org/10.1007/bfb0022510openalex-snapshot
A term model for CCS
inferredcites →https://doi.org/10.1016/0020-0190(80)90009-5openalex-snapshot
Transformational semantics for concurrent programs
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/0304-3975(77)90053-6openalex-snapshot
Fully abstract models of typed λ-calculi
inferredcites →https://doi.org/10.1145/567446.567459openalex-snapshot
Final data type specifications
inferredcites →https://doi.org/10.1145/567752.567769openalex-snapshot
Specifying programming language semantics

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/0471028959.sof410openalex-snapshot
Broy, Manfred
inferred← citeshttps://doi.org/10.1006/jcss.1996.0011openalex-snapshot
A Free Construction of Dynamic Terms
inferred← citeshttps://doi.org/10.1006/jsco.1998.0253openalex-snapshot
A Framework for Operational Equational Specifications with Pre-defined Structures
inferred← citeshttps://doi.org/10.1007/3-540-12727-5_1openalex-snapshot
Generalized heterogeneous algebras and partial interpretations
inferred← citeshttps://doi.org/10.1007/3-540-12925-1_39openalex-snapshot
Un systeme d'aide a la preuve de compilateurs
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_8openalex-snapshot
Algebraic specification of exception handling and error recovery by means of declarations and equations
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-15198-2_2openalex-snapshot
Specification and top down design of distributed systems
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-15198-2_22openalex-snapshot
On the parameterized algebraic specification of concurrent systems
inferred← citeshttps://doi.org/10.1007/3-540-15199-0_14openalex-snapshot
A theory of abstract data types for program development: Bridging the gap?
inferred← citeshttps://doi.org/10.1007/3-540-15199-0_16openalex-snapshot
ASSPEGIQUE: An integrated environment for algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-16047-7_44openalex-snapshot
On the specification of the firing squad problem
inferred← citeshttps://doi.org/10.1007/3-540-16442-1_13openalex-snapshot
Algebraic semantics of exception handling
inferred← citeshttps://doi.org/10.1007/3-540-16444-8_16openalex-snapshot
The algorithmic specification method of abstract data types: An overview
inferred← citeshttps://doi.org/10.1007/3-540-17162-2_133openalex-snapshot
Extended ML: An institution-independent framework for formal program development
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_55openalex-snapshot
SMoLCS-driven concurrent calculi
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_45openalex-snapshot
Partial algebras flow from algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-18341-8_18openalex-snapshot
The SMoLCS approach to the formal semantics of programming languages
inferred← citeshttps://doi.org/10.1007/3-540-18419-8_11openalex-snapshot
An outline of the SMoLCS approach
inferred← citeshttps://doi.org/10.1007/3-540-18508-9_26openalex-snapshot
Good functors ... are those preserving philosophy!
inferred← citeshttps://doi.org/10.1007/3-540-19027-9_3openalex-snapshot
Algebraic formalisation of program development by transformation
inferred← citeshttps://doi.org/10.1007/3-540-19027-9_8openalex-snapshot
A theory of software reusability
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_49openalex-snapshot
A Total Approach to Partial Algebraic Specification
inferred← citeshttps://doi.org/10.1007/3-540-50325-0_1openalex-snapshot
The stratified loose approach: A generalization of initial and loose semantics
inferred← citeshttps://doi.org/10.1007/3-540-50325-0_11openalex-snapshot
Partial algebras, subsorting, and dependent types
inferred← citeshttps://doi.org/10.1007/3-540-50325-0_7openalex-snapshot
The specification language of OBSCURE
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_56openalex-snapshot
Nondeterministic algebraic specifications and nonconfluent term rewriting
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_125openalex-snapshot
On the existence of initial models for partial (higher-order) conditional specifications
inferred← citeshttps://doi.org/10.1007/3-540-50940-2_26openalex-snapshot
Algebraic specification and functionals for transformational program and meta program development
inferred← citeshttps://doi.org/10.1007/3-540-50940-2_45openalex-snapshot
Specification and verification of TCSP systems by means of partial abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-52048-1_39openalex-snapshot
An algebraic compositional semantics of an object oriented notation with concurrency
inferred← citeshttps://doi.org/10.1007/3-540-52531-9_128openalex-snapshot
A theory for program and data type specification
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_8openalex-snapshot
Non-strict don't care algebras and specifications
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_50openalex-snapshot
Partial higher-order specifications
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_53openalex-snapshot
Abstract dynamic data types: A temporal logic approach
inferred← citeshttps://doi.org/10.1007/3-540-54496-8_13openalex-snapshot
Entities: An institution for dynamic systems
inferred← citeshttps://doi.org/10.1007/3-540-54496-8_16openalex-snapshot
Extended ML: Past, present and future
inferred← citeshttps://doi.org/10.1007/3-540-54496-8_8openalex-snapshot
A notion of implementation for the specification language OBSCURE
inferred← citeshttps://doi.org/10.1007/3-540-54834-3_7openalex-snapshot
Combining transformation and posit-and-prove in a VDM development
inferred← citeshttps://doi.org/10.1007/3-540-54834-3_9openalex-snapshot
A model-oriented method for algebraic specifications using COLD-1 as notation
inferred← citeshttps://doi.org/10.1007/3-540-55253-7_6openalex-snapshot
Compositional refinements in multiple blackboard systems
inferred← citeshttps://doi.org/10.1007/3-540-56379-2_33openalex-snapshot
Algebraic specification of concurrency
inferred← citeshttps://doi.org/10.1007/3-540-56379-2_34openalex-snapshot
Objects and their specification
inferred← citeshttps://doi.org/10.1007/3-540-56379-2_35openalex-snapshot
The use of sorts in algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-56379-2_37openalex-snapshot
Relationships between logical frameworks
inferred← citeshttps://doi.org/10.1007/3-540-56379-2_38openalex-snapshot
Label algebras: A systematic use of terms
inferred← citeshttps://doi.org/10.1007/3-540-56379-2_40openalex-snapshot
Bounded implementation of algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-56379-2_47openalex-snapshot
A soft stairway to institutions
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_74openalex-snapshot
A technique for specifying and refining TCSP processes by using guards and liveness conditions
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_80openalex-snapshot
Exception handling and term labelling
inferred← citeshttps://doi.org/10.1007/3-540-56733-x_168openalex-snapshot
Annotated bibliography of the PROSPECTRA project
inferred← citeshttps://doi.org/10.1007/3-540-56992-8_12openalex-snapshot
Reasoning with higher order partial functions
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_184openalex-snapshot
A decade of TAPSOFT
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_188openalex-snapshot
Testing can be formal, too
inferred← citeshttps://doi.org/10.1007/3-540-60973-3_88openalex-snapshot
Data reification without explicit abstraction functions
inferred← citeshttps://doi.org/10.1007/3-540-61629-2_59openalex-snapshot
Moving between logical systems
inferred← citeshttps://doi.org/10.1007/3-540-64299-4_40openalex-snapshot
Open maps as a bridge between algebraic observational equivalence and bisimilarity
inferred← citeshttps://doi.org/10.1007/3-540-64299-4_45openalex-snapshot
Towards the one-tiered design of data types and transition systems
inferred← citeshttps://doi.org/10.1007/978-3-319-03998-5_18openalex-snapshot
Extending Floyd-Hoare Logic for Partial Pre- and Postconditions
inferred← citeshttps://doi.org/10.1007/978-3-319-15545-6_1openalex-snapshot
A Homage to Martin Wirsing
inferred← citeshttps://doi.org/10.1007/978-3-642-46490-4_18openalex-snapshot
Algebraic Methods for Program Construction: The Project CIP
inferred← citeshttps://doi.org/10.1007/978-3-642-46490-4_22openalex-snapshot
Exception Handling: Formal Specification and Systematic Program Construction Extended Abstract
inferred← citeshttps://doi.org/10.1007/978-3-642-69032-7_2openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/978-3-642-72822-8_19openalex-snapshot
Types and Modules for Net Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-84524-6_5openalex-snapshot
Types and Modules for Net Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-87374-4_8openalex-snapshot
Equational Specification of Partial Higher Order Algebras
inferred← citeshttps://doi.org/10.1007/978-94-009-1063-8_25openalex-snapshot
Algebraic Specification with Functionals in Program Development by Transformation
inferred← citeshttps://doi.org/10.1007/978-94-009-7893-5_12openalex-snapshot
An Analysis of Semantic Models for Algebraic Specifications
inferred← citeshttps://doi.org/10.1007/bf00263649openalex-snapshot
Non-deterministic data types: models and implementations
inferred← citeshttps://doi.org/10.1007/bf00263650openalex-snapshot
Minimal coverings for incompletely specified sequential machines
inferred← citeshttps://doi.org/10.1007/bf00264250openalex-snapshot
A logic covering undefinedness in program proofs
inferred← citeshttps://doi.org/10.1007/bf00264293openalex-snapshot
On hierarchies of abstract data types
inferred← citeshttps://doi.org/10.1007/bf00268076openalex-snapshot
Acceptable functional programming systems
inferred← citeshttps://doi.org/10.1007/bf00271641openalex-snapshot
A set-theoretic semantics for Clear
inferred← citeshttps://doi.org/10.1007/bf00283329openalex-snapshot
Toward formal development of programs from algebraic specifications: Implementations revisited
inferred← citeshttps://doi.org/10.1007/bf01213078openalex-snapshot
Compositional refinements in multiple blackboard systems
inferred← citeshttps://doi.org/10.1007/bf01786252openalex-snapshot
Semantics of finite and infinite networks of concurrent communicating agents
inferred← citeshttps://doi.org/10.1007/bf02737104openalex-snapshot
Toward formal development of programs from algebraic specifications: Implementations revisited
inferred← citeshttps://doi.org/10.1007/bfb0014313openalex-snapshot
A formal framework for modules with state
inferred← citeshttps://doi.org/10.1007/bfb0014422openalex-snapshot
From abstract data types to logical frameworks
inferred← citeshttps://doi.org/10.1007/bfb0014423openalex-snapshot
Algebraic specification languages: An overview
inferred← citeshttps://doi.org/10.1007/bfb0014446openalex-snapshot
Implementation of data structures in an imperative framework
inferred← citeshttps://doi.org/10.1007/bfb0015035openalex-snapshot
How to make algebraic specifications more understandable?
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.1007/bfb0016232openalex-snapshot
Partial interpretations of higher order algebraic types
inferred← citeshttps://doi.org/10.1007/bfb0016244openalex-snapshot
Relational specifications and observational semantics
inferred← citeshttps://doi.org/10.1007/bfb0018267openalex-snapshot
Transformational meta program development
inferred← citeshttps://doi.org/10.1007/bfb0019451openalex-snapshot
Producing abstract models for object-oriented languages
inferred← citeshttps://doi.org/10.1007/bfb0028827openalex-snapshot
Continuous abstract data types: Basic machinery and results
inferred← citeshttps://doi.org/10.1007/bfb0028972openalex-snapshot
A first order logic for partial functions
inferred← citeshttps://doi.org/10.1007/bfb0029619openalex-snapshot
A first-order logic for partial recursive functions
inferred← citeshttps://doi.org/10.1007/bfb0030588openalex-snapshot
Conservative extensions, interpretations between theories and all that!
inferred← citeshttps://doi.org/10.1007/bfb0030623openalex-snapshot
Protective interface specifications
inferred← citeshttps://doi.org/10.1007/bfb0035846openalex-snapshot
Generalized bisimulation in relational specifications
inferred← citeshttps://doi.org/10.1007/bfb0039062openalex-snapshot
A temporal approach to algebraic specifications
inferred← citeshttps://doi.org/10.1007/bfb0039611openalex-snapshot
Are homomorphisms sufficient for behavioural implementations of deterministic and nondeterministic data types?
inferred← citeshttps://doi.org/10.1007/bfb0039615openalex-snapshot
Comparing direct and continuation semantics styles for concurrent languages
inferred← citeshttps://doi.org/10.1007/pl00003926openalex-snapshot
Protective Interface Specifications
inferred← citeshttps://doi.org/10.1007/pl00013308openalex-snapshot
Labelled transition logic: an outline
inferred← citeshttps://doi.org/10.1007/s00165-007-0026-7openalex-snapshot
Specification and verification challenges for sequential object-oriented programs
inferred← citeshttps://doi.org/10.1016/0022-0000(86)90057-7openalex-snapshot
Quasi-varieties in abstract algebraic institutions
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)90026-2openalex-snapshot
Specification and top-down design of distributed systems
inferred← citeshttps://doi.org/10.1016/0167-6423(86)90004-3openalex-snapshot
Algebraic implementations preserve program correctness
inferred← citeshttps://doi.org/10.1016/0167-6423(89)90026-9openalex-snapshot
How to make algebraic specifications more understandable: An experiment with the pluss specification language
inferred← citeshttps://doi.org/10.1016/0167-6423(90)90057-kopenalex-snapshot
Behavioural correctness of data representations
inferred← citeshttps://doi.org/10.1016/0167-6423(94)00021-2openalex-snapshot
Label algebras and exception handling
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90086-0openalex-snapshot
A systematic study of models of abstract data types
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90027-1openalex-snapshot
On the Herbrand-Kleene universe for nondeterministic computations
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90094-5openalex-snapshot
On the existence of free models in abstract algebraic institutions
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90019-8openalex-snapshot
Abstract data types with exception handling: An initial approach based on a distinction between exceptions and errors
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)90114-9openalex-snapshot
On flowchart theories: Part II. The nondeterministic case
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90123-xopenalex-snapshot
Algebraic specifications of computable and semicomputable data types
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90162-4openalex-snapshot
Equational specification of partial higher-order algebras
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90005-3openalex-snapshot
A first order logic for partial functions
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90118-2openalex-snapshot
Equational type logic
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90169-gopenalex-snapshot
A theory for program and data type specification
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90303-wopenalex-snapshot
Data types with errors and exceptions
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90026-yopenalex-snapshot
Nondeterministic algebraic specifications and nonconfluent term rewriting
inferred← citeshttps://doi.org/10.1016/0890-5401(88)90008-9openalex-snapshot
Specifications in an arbitrary institution
inferred← citeshttps://doi.org/10.1016/b978-0-12-046370-1.50007-3openalex-snapshot
Bisimulation in Algebraic Specifications11Work partially supported by the ESPRIT-project METEOR and by CNR (Italy).
inferred← citeshttps://doi.org/10.1016/b978-0-12-046371-8.50016-xopenalex-snapshot
Order-Sorted Equational Computation
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50018-4openalex-snapshot
Algebraic Specification
inferred← citeshttps://doi.org/10.1016/b978-0-7506-0813-8.50029-0openalex-snapshot
Algebraic specifications
inferred← citeshttps://doi.org/10.1016/j.jlamp.2022.100797openalex-snapshot
Partial arithmetical data types of rational numbers and their equational specification
inferred← citeshttps://doi.org/10.1016/j.scico.2007.04.002openalex-snapshot
Engineering and theoretical underpinnings of retrenchment
inferred← citeshttps://doi.org/10.1016/s0252-9602(18)30168-1openalex-snapshot
SOME PROBLEMS IN PARTIAL ABSTRACT DATA TYPE
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00171-7openalex-snapshot
Swinging types=functions+relations+transition systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00165-xopenalex-snapshot
Specification of abstract dynamic-data types: A temporal logic approach
inferred← citeshttps://doi.org/10.1017/s0960129500000712openalex-snapshot
Equivalence and difference between institutions: simulating Horn Clause Logic with based algebras
inferred← citeshttps://doi.org/10.1017/s0960129500000888openalex-snapshot
Non-strict don't care algebras and specifications
inferred← citeshttps://doi.org/10.1017/s0960129500001432openalex-snapshot
A new approach to abstract data types, I Informal development
inferred← citeshttps://doi.org/10.1051/ita/1983170201371openalex-snapshot
Algebraic definition of a functional programming language and its semantic models
inferred← citeshttps://doi.org/10.1093/comjnl/35.5.451openalex-snapshot
The Role of Data Reification in Program Refinement: Origins, Synthesis and Appraisal
inferred← citeshttps://doi.org/10.1109/32.21743openalex-snapshot
Formal program construction by transformations-computer-aided, intuition-guided programming
inferred← citeshttps://doi.org/10.1109/icse.1989.714417openalex-snapshot
Stepwise Refinement Process With Modularity: An Algebraic Approach
inferred← citeshttps://doi.org/10.1109/seke.1992.227918openalex-snapshot
Correctness of full first-order specifications
inferred← citeshttps://doi.org/10.1109/tse.1985.232484openalex-snapshot
Completeness of Proof Systems for Equational Specifications
inferred← citeshttps://doi.org/10.1145/103418.103423openalex-snapshot
Separating concurrent languages with categories of language embeddings
inferred← citeshttps://doi.org/10.1145/29873.30399openalex-snapshot
Algorithmic specifications: a constructive specification method for abstract data types
inferred← citeshttps://doi.org/10.1145/318593.318614openalex-snapshot
Program specification and development in standard ML
inferred← citeshttps://doi.org/10.1145/66083.66085openalex-snapshot
AUTO STAR—a software development system
inferred← citeshttps://doi.org/10.1145/74587.74611openalex-snapshot
Stepwise refinement process with modularity
inferred← citeshttps://doi.org/10.1145/9758.10501openalex-snapshot
On the algebraic definition of programming languages
inferred← citeshttps://doi.org/10.1147/rd.315.0512openalex-snapshot
Direct semantics of concurrent languages in the SMoLCS approach
inferred← citeshttps://doi.org/10.22028/d291-26433openalex-snapshot
The specification language of OBSCURE
inferred← citeshttps://doi.org/10.3233/fi-1996-263409openalex-snapshot
DEFINING OPERATIONAL BEHAVIOR OF OBJECT SPECIFICATIONS BY ATTRIBUTED GRAPH TRANSFORMATIONS
inferred← citeshttps://doi.org/10.3233/fi-1998-33301openalex-snapshot
An Efficient Parser for a Class of Contextual Languages
inferred← citeshttps://doi.org/10.3233/fun-2004-63404openalex-snapshot
Applying term rewriting to partial algebra theory
inferred← citeshttps://doi.org/10.5555/41765.41778openalex-snapshot
SEGRAS—a formal and semigraphical language combining Petri nets and abstract data types for the specification of distributed systems
inferred← citeshttps://doi.org/10.7146/dpb.v21i416.6729openalex-snapshot
The Use of Sorts in Algebraic Specifications
inferred← citeshttps://doi.org/10.9746/sicetr1965.30.79openalex-snapshot
Algebraic Specification of Discrete Event System Models and Their Refinements
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.