On the public citation graph
Program refinement in fair transition systems
0 signed · 43 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-51285-3_42openalex-snapshot
A method for refining atomicity in parallel algorithms
inferredcites →https://doi.org/10.1007/3-540-52559-9_60openalex-snapshot
Refinement calculus, part I: Sequential nondeterministic programs
inferredcites →https://doi.org/10.1007/3-540-52559-9_61openalex-snapshot
Refinement calculus, part II: Parallel and reactive programs
inferredcites →https://doi.org/10.1007/3-540-54152-7_62openalex-snapshot
Program refinement in fair transition systems
inferredcites →https://doi.org/10.1007/3-540-55599-4_78openalex-snapshot
A decompositional approach to the design of efficient parallel programs
inferredcites →https://doi.org/10.1007/978-1-4471-3273-8_7openalex-snapshot
Data Refinement by Calculation
inferredcites →https://doi.org/10.1007/978-3-642-59412-0_24openalex-snapshot
Proof of Correctness of Data Representations
inferredcites →https://doi.org/10.1007/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1007/bf00288730openalex-snapshot
Automatic correction of syntax-errors in programming languages
inferredcites →https://doi.org/10.1007/bf00289507openalex-snapshot
Proof of correctness of data representations
inferredcites →https://doi.org/10.1007/bf01381718openalex-snapshot
Derivation of efficient parallel programs: An example from genetic sequence analysis
inferredcites →https://doi.org/10.1007/bf01660034openalex-snapshot
Compiling communicating processes into delay-insensitive VLSI circuits
inferredcites →https://doi.org/10.1007/bf01898402openalex-snapshot
Eliminating the substitution axiom from UNITY logic
inferredcites →https://doi.org/10.1016/0011-684x(86)90240-6openalex-snapshot
Systematic software development using VDM
inferredcites →https://doi.org/10.1016/0141-9331(89)90152-xopenalex-snapshot
Parallel program design: a foundation
inferredcites →https://doi.org/10.1016/0167-6423(84)90003-0openalex-snapshot
Adequate proof principles for invariance and liveness properties of concurrent programs
inferredcites →https://doi.org/10.1016/0167-6423(90)90069-popenalex-snapshot
Stepwise refinement of parallel algorithms
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1049/ip-i-1.1981.0010openalex-snapshot
Introduction to V.L.S.I. Systems
inferredcites →https://doi.org/10.1109/lics.1988.5115openalex-snapshot
The existence of refinement mappings
inferredcites →https://doi.org/10.1109/tse.1984.5010246openalex-snapshot
Protocol Verification via Projections
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/41840.41852openalex-snapshot
Hierarchical correctness proofs for distributed algorithms
inferredcites →https://doi.org/10.1145/4904.4999openalex-snapshot
“Sometimes” and “not never” revisited
inferredcites →https://doi.org/10.1145/567067.567082openalex-snapshot
How to cook a temporal proof system for your pet language
inferredcites →https://doi.org/10.1145/63238.63240openalex-snapshot
A simple approach to specifying concurrent systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10722010_9openalex-snapshot
On Guarded Commands with Fair Choice
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_78openalex-snapshot
A decompositional approach to the design of efficient parallel programs
inferred← citeshttps://doi.org/10.1007/3-540-60117-1_24openalex-snapshot
ImpUNITY: UNITY with procedures and local variables
inferred← citeshttps://doi.org/10.1007/3-540-61052-9_42openalex-snapshot
Towards a compositional method for coordinating Gamma programs
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_745openalex-snapshot
Tailoring UNITY to distributed program design
inferred← citeshttps://doi.org/10.1007/978-3-642-39718-9_19openalex-snapshot
Finitary Fairness in Action Systems
inferred← citeshttps://doi.org/10.1007/bfb0024440openalex-snapshot
The RPC-memory specification problem: UNITY + refinement calculus
inferred← citeshttps://doi.org/10.1007/s002360050115openalex-snapshot
Data refinement of mixed specifications
inferred← citeshttps://doi.org/10.1007/s002360050116openalex-snapshot
Refinement of fair action systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.06.004openalex-snapshot
An Algebraic Approach to Refinement with Fair Choice
inferred← citeshttps://doi.org/10.1109/32.368135openalex-snapshot
A decompositional approach to the design of parallel programs
inferred← citeshttps://doi.org/10.1142/s0129626499000402openalex-snapshot
THE OBSERVATION: AN ABSTRACT COMMUNICATION MECHANISM
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.