On the public citation graph

Algebraic Methods: Theory, Tools and Applications

https://doi.org/10.1007/bfb0015032
0 signed · 33 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/bfb0015050openalex-snapshot
An algebraic specification of process algebra, including two examples

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.sof047openalex-snapshot
Cold
inferred← citeshttps://doi.org/10.1002/cpe.1757openalex-snapshot
Simulating Taverna workflows using stochastic process algebras
inferred← citeshttps://doi.org/10.1006/jcss.1996.0011openalex-snapshot
A Free Construction of Dynamic Terms
inferred← citeshttps://doi.org/10.1007/3-540-19242-5_7openalex-snapshot
A compiler for a class of conditional term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-46562-6_3openalex-snapshot
Algebraic Imperative Specifications
inferred← citeshttps://doi.org/10.1007/3-540-51635-2_30openalex-snapshot
MENU - an example for the systematic reuse of specifications
inferred← citeshttps://doi.org/10.1007/3-540-53912-3_27openalex-snapshot
A process specification formalism based on static COLD
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-59293-8_223openalex-snapshot
Mechanized inductive proof of properties of a simple code optimizer
inferred← citeshttps://doi.org/10.1007/978-1-4471-3016-1_13openalex-snapshot
MON: An Object Relationship Model Incorporating Roles, Classification, Publicity and Assertions
inferred← citeshttps://doi.org/10.1007/978-1-4471-3229-5_2openalex-snapshot
An Overview of the Development of COLD
inferred← citeshttps://doi.org/10.1007/978-1-4471-3229-5_4openalex-snapshot
The Static Part of the Design Language COLD-K
inferred← citeshttps://doi.org/10.1007/978-1-4471-3554-8_5openalex-snapshot
A Semantic Model for Dynamic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-59048-1_7openalex-snapshot
Timed Rewriting Logic for the Specification of Time-Sensitive Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-76677-0_19openalex-snapshot
Proofs in Structured Specifications
inferred← citeshttps://doi.org/10.1007/bfb0014423openalex-snapshot
Algebraic specification languages: An overview
inferred← citeshttps://doi.org/10.1007/bfb0017136openalex-snapshot
Reusable specification components
inferred← citeshttps://doi.org/10.1007/bfb0018269openalex-snapshot
A formal method for the systematic reuse of specification components
inferred← citeshttps://doi.org/10.1007/s10586-009-0099-6openalex-snapshot
Analysing scientific workflows with Computational Tree Logic
inferred← citeshttps://doi.org/10.1016/0096-0551(93)90004-kopenalex-snapshot
Optimizing structural recursion in functional programs
inferred← citeshttps://doi.org/10.1016/0141-9331(90)90038-wopenalex-snapshot
Formal specification of the ProCoS/safemos instruction set
inferred← citeshttps://doi.org/10.1016/0168-0072(94)00038-5openalex-snapshot
The data type variety of stack algebras
inferred← citeshttps://doi.org/10.1016/j.jlamp.2023.100858openalex-snapshot
Decomposing monolithic processes in a process algebra with multi-actions
inferred← citeshttps://doi.org/10.1016/j.scico.2015.09.001openalex-snapshot
Global consensus through local synchronization: A formal basis for partially-distributed coordination
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.07.021openalex-snapshot
A linear process-algebraic format with data for probabilistic automata
inferred← citeshttps://doi.org/10.1016/s0164-1212(97)10020-6openalex-snapshot
History, principles and application of the SPRINT method
inferred← citeshttps://doi.org/10.1016/s0169-023x(98)00047-0openalex-snapshot
Modal Change Logic (MCL): Specifying the reasoning of knowledge-based systems
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.1017/s0960129500000256openalex-snapshot
Program specification and data refinement in type theory
inferred← citeshttps://doi.org/10.1017/s0960129500000736openalex-snapshot
D-oids: a model for dynamic data-types
inferred← citeshttps://doi.org/10.1049/sej.1992.0022openalex-snapshot
Specification of interfering programs based on interconditions
inferred← citeshttps://doi.org/10.1109/asr.1993.291704openalex-snapshot
Experiences from software reuse in industrial process control applications
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.