On the public citation graph

Modular system design applying graph grammars techniques

https://doi.org/10.1007/bfb0035788
0 signed · 35 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-15198-2_17openalex-snapshot
Amalgamation of graph transformations with applications to synchronization
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-17660-8_57openalex-snapshot
Partial composition and recursion of module specifications
inferredcites →https://doi.org/10.1007/3-540-18771-5openalex-snapshot
Graph-Grammars and Their Application to Computer Science
inferredcites →https://doi.org/10.1007/978-3-642-69962-7openalex-snapshot
Fundamentals of Algebraic Specification 1
inferredcites →https://doi.org/10.1007/bf00283329openalex-snapshot
Toward formal development of programs from algebraic specifications: Implementations revisited
inferredcites →https://doi.org/10.1007/bf00289616openalex-snapshot
Deriving graphs from graphs by applying a production
inferredcites →https://doi.org/10.1007/bf01752403openalex-snapshot
Transformations of structures: An algebraic approach
inferredcites →https://doi.org/10.1007/bfb0000094openalex-snapshot
Graph-Grammars and Their Application to Computer Science
inferredcites →https://doi.org/10.1007/bfb0012775openalex-snapshot
Universal realization, persistent interconnection and implementation of abstract modules
inferredcites →https://doi.org/10.1007/bfb0016234openalex-snapshot
Algebraic theory of module specifications with constraints
inferredcites →https://doi.org/10.1007/bfb0025714openalex-snapshot
Introduction to the algebraic theory of graph grammars (a survey)
inferredcites →https://doi.org/10.1007/bfb0025715openalex-snapshot
A tutorial and bibliographical survey on graph grammars
inferredcites →https://doi.org/10.1007/bfb0026102openalex-snapshot
Product and iteration of module specifications
inferredcites →https://doi.org/10.1016/0022-0000(87)90028-6openalex-snapshot
Algebraic specification of modules and their basic interconnections
inferredcites →https://doi.org/10.1016/0022-0000(87)90037-7openalex-snapshot
Union and actualization of module specifications: Some compatibility results
inferredcites →https://doi.org/10.1016/0304-3975(80)90016-xopenalex-snapshot
Parallelism and concurrency of graph manipulations
inferredcites →https://doi.org/10.1017/s0140525x0002063xopenalex-snapshot
On artificial intelligence
inferredcites →https://doi.org/10.1109/swat.1973.11openalex-snapshot
Graph-grammars: An algebraic approach
inferredcites →https://doi.org/10.3233/fi-1986-9103openalex-snapshot
Concurrent Transformations of Relational Structures

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-53832-1_52openalex-snapshot
Algebraic approach to graph transformation based on single pushout derivations
inferred← citeshttps://doi.org/10.1007/3-540-54496-8_5openalex-snapshot
A match operation for rule-based modular system design
inferred← citeshttps://doi.org/10.1007/3-540-56402-0_52openalex-snapshot
Single vs. double pushout derivations of graphs
inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_22openalex-snapshot
Interaction between Algebraic Specification Grammars and Modular System Design
inferred← citeshttps://doi.org/10.1007/978-3-642-77449-2_3openalex-snapshot
From Parallel to Distributed Derivations of Graphs in the Single-Pushout-Approach
inferred← citeshttps://doi.org/10.1007/bf00872984openalex-snapshot
Categorical principles, techniques and results for high-level-replacement systems in computer science
inferred← citeshttps://doi.org/10.1007/bfb0017395openalex-snapshot
From graph grammars to high level replacement systems
inferred← citeshttps://doi.org/10.1007/bfb0017396openalex-snapshot
Algebraic specification grammars: A junction between module specifications and graph grammars
inferred← citeshttps://doi.org/10.1007/bfb0017422openalex-snapshot
Computing by graph transformation: Overall aims and new results
inferred← citeshttps://doi.org/10.1017/s0960129500001353openalex-snapshot
Parallelism and concurrency in high-level replacement systems
inferred← citeshttps://doi.org/10.1017/s0960129512000357openalex-snapshot
-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
inferred← citeshttps://doi.org/10.1109/icse.1990.63624openalex-snapshot
A rule-based approach to modular system design
inferred← citeshttps://doi.org/10.48550/arxiv.1906.05170openalex-snapshot
Efficient Graph Rewriting
inferred← citeshttps://doi.org/10.48550/arxiv.1911.12884openalex-snapshot
Efficient Recognition of Graph Languages
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.