On the public citation graph

Formal Systems Specification

https://doi.org/10.1007/bfb0024423
0 signed · 22 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-10256-6_6openalex-snapshot
The implementation of the language
inferredcites →https://doi.org/10.1007/3-540-11490-4_23openalex-snapshot
A specification language
inferredcites →https://doi.org/10.1007/3-540-58867-1_62openalex-snapshot
Symbolic Timing Diagrams
inferredcites →https://doi.org/10.1007/bfb0024432openalex-snapshot
Applying a temporal logic to the RPC-memory specification problem
inferredcites →https://doi.org/10.1007/bfb0024435openalex-snapshot
A case study in verification based on trace abstractions
inferredcites →https://doi.org/10.1007/bfb0024437openalex-snapshot
The methodology of modal constraints
inferredcites →https://doi.org/10.1007/bfb0024440openalex-snapshot
The RPC-memory specification problem: UNITY + refinement calculus

What points at this work

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

inferred← citeshttps://doi.org/10.1007/0-306-47003-9_13openalex-snapshot
Implementing a Modal Logic Over Data and Processes Using XTL
inferred← citeshttps://doi.org/10.1007/978-3-030-38800-3_1openalex-snapshot
Formal Methods
inferred← citeshttps://doi.org/10.1007/978-3-540-27815-3_35openalex-snapshot
Expressing Iterative Properties Logically in a Symbolic Setting
inferred← citeshttps://doi.org/10.1007/978-3-540-39979-7_10openalex-snapshot
Combating Infinite State Using Ergo
inferred← citeshttps://doi.org/10.1007/978-3-540-49020-3_6openalex-snapshot
JTN: A Java-Targeted Graphic Formal Notation for Reactive and Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-60858-2_20openalex-snapshot
Mathematical Methods in System and Software Engineering
inferred← citeshttps://doi.org/10.1007/bfb0014556openalex-snapshot
Data refinement of remote procedures
inferred← citeshttps://doi.org/10.1007/pl00003935openalex-snapshot
Data Refinement of Remote Procedures
inferred← citeshttps://doi.org/10.1007/s001650300001openalex-snapshot
IEEE 1394 Tree Identify Protocol: Introduction to the Case Study
inferred← citeshttps://doi.org/10.1007/s10009-015-0396-8openalex-snapshot
VerifyThis 2012
inferred← citeshttps://doi.org/10.1016/j.scico.2010.03.007openalex-snapshot
Formal specification of MPI 2.0: Case study in specifying a practical concurrent programming API
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.11.008openalex-snapshot
A high-level modular definition of the semantics of C♯
inferred← citeshttps://doi.org/10.1016/s0950-5849(99)00068-3openalex-snapshot
Software technology—formal methods and scientific foundations
inferred← citeshttps://doi.org/10.1145/296333.296345openalex-snapshot
Specification and verification of pipelining in the ARM2 RISC microprocessor
inferred← citeshttps://doi.org/10.5445/ir/1000077160openalex-snapshot
VerifyThis 2017 : A Program Verification Competition
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.