On the public citation graph

A Refinement Calculus for Shared-Variable Parallel and Distributed Programming

0 signed · 67 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.1006/inco.1996.0056openalex-snapshot
Full Abstraction for a Shared-Variable Parallel Language
inferredcites →https://doi.org/10.1007/3-540-10007-5_47openalex-snapshot
On the semantics of fair parallelism
inferredcites →https://doi.org/10.1007/3-540-56596-5openalex-snapshot
Semantics: Foundations and Applications
inferredcites →https://doi.org/10.1007/3-540-56596-5_48openalex-snapshot
On the relation between unity properties and sequences of states
inferredcites →https://doi.org/10.1007/3-540-56610-4_58openalex-snapshot
A case study in transformational design of concurrent systems
inferredcites →https://doi.org/10.1007/3-540-57208-2_24openalex-snapshot
Two fully abstract models for UNITY
inferredcites →https://doi.org/10.1007/3-540-60043-4_64openalex-snapshot
Logical foundations for compositional verification and development of concurrent programs in UNITY
inferredcites →https://doi.org/10.1007/3-540-61604-7_85openalex-snapshot
Modular verification for shared-variable concurrent programs
inferredcites →https://doi.org/10.1007/3-540-63383-9_89openalex-snapshot
Approximating unity
inferredcites →https://doi.org/10.1007/978-1-4419-8596-5openalex-snapshot
A Practical Theory of Programming
inferredcites →https://doi.org/10.1007/978-1-4471-3756-6_15openalex-snapshot
A Theory of State-based Parallel Programming: Part 1
inferredcites →https://doi.org/10.1007/978-1-4757-3851-3_11openalex-snapshot
The Essence of Parallel Algol
inferredcites →https://doi.org/10.1007/978-1-4757-4376-0openalex-snapshot
Verification of Sequential and Concurrent Programs
inferredcites →https://doi.org/10.1007/978-3-642-58049-9_16openalex-snapshot
Graphical Support for Parallel Debugging
inferredcites →https://doi.org/10.1007/978-3-642-58049-9_4openalex-snapshot
Software Tools for Developing and Porting Parallel Programs
inferredcites →https://doi.org/10.1007/978-3-642-58049-9_8openalex-snapshot
FORGE 90 and High Performance Fortran (HPF)
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_5openalex-snapshot
In Transition From Global to Modular Temporal Reasoning about Programs
inferredcites →https://doi.org/10.1007/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1007/bf00289074openalex-snapshot
A proof method for cyclic programs
inferredcites →https://doi.org/10.1007/bf00289507openalex-snapshot
Proof of correctness of data representations
inferredcites →https://doi.org/10.1007/bf01214554openalex-snapshot
Specification and refinement of networks of asynchronously communicating agents using the assumption/commitment paradigm
inferredcites →https://doi.org/10.1007/bfb0015763openalex-snapshot
A context dependent equivalence between processes
inferredcites →https://doi.org/10.1007/bfb0022461openalex-snapshot
Modal logic of concurrent nondeterministic programs
inferredcites →https://doi.org/10.1007/bfb0027049openalex-snapshot
Concepts for concurrent programming
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(83)90004-7openalex-snapshot
Proof rules and transformations dealing with fairness
inferredcites →https://doi.org/10.1016/0167-6423(87)90011-6openalex-snapshot
A theoretical basis for stepwise refinement and the programming calculus
inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/0304-3975(86)90040-xopenalex-snapshot
A theory for nondeterminism, parallelism, communication, and concurrency
inferredcites →https://doi.org/10.1016/0304-3975(87)90007-7openalex-snapshot
A context dependent equivalence between processes
inferredcites →https://doi.org/10.1016/0304-3975(88)90033-3openalex-snapshot
A generalization of Owicki-Gries's Hoare logic for a concurrent while language
inferredcites →https://doi.org/10.1016/0304-3975(91)90224-popenalex-snapshot
The existence of refinement mappings
inferredcites →https://doi.org/10.1016/s0049-237x(08)71948-7openalex-snapshot
Processes: A Mathematical Model of Computing Agents
inferredcites →https://doi.org/10.1016/s1571-0661(05)80169-0openalex-snapshot
Idealized CSP: Combining Procedures With Communicating Processes
inferredcites →https://doi.org/10.1017/cbo9780511526589openalex-snapshot
Nets, Terms and Formulas
inferredcites →https://doi.org/10.1049/sej.1989.0006openalex-snapshot
An introduction to Z and formal specifications
inferredcites →https://doi.org/10.1109/88.242459openalex-snapshot
The Enterprise model for developing distributed applications
inferredcites →https://doi.org/10.1145/151646.151649openalex-snapshot
Composing specifications
inferredcites →https://doi.org/10.1145/3749740.3749753openalex-snapshot
A Bridging Model for Parallel Computation
inferredcites →https://doi.org/10.1145/44501.44503openalex-snapshot
The specification statement
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
inferredcites →https://doi.org/10.1184/r1/6610514openalex-snapshot
The Craft of Programming
inferredcites →https://doi.org/10.25405/ncl.34131210openalex-snapshot
Development methods for computer programs including a notion of interference
inferredcites →https://doi.org/10.82444/warw.33641377openalex-snapshot
A semantic model for UNITY

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-31038-7_9openalex-snapshot
Developing an Algebra for Rely/Guarantee Concurrency: Design Decisions and Challenges
inferred← citeshttps://doi.org/10.1007/978-3-031-40436-8_5openalex-snapshot
Specifying and Reasoning About Shared-Variable Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-031-67114-2_3openalex-snapshot
Clarifying Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-319-06410-9_6openalex-snapshot
Algebraic Principles for Rely-Guarantee Style Concurrency Verification Tools
inferred← citeshttps://doi.org/10.1007/978-3-319-19797-5_2openalex-snapshot
On Rely-Guarantee Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-33826-7_1openalex-snapshot
Abstraction as a Unifying Link for Formal Approaches to Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_43openalex-snapshot
An Event Structure Model for Probabilistic Concurrent Kleene Algebra
inferred← citeshttps://doi.org/10.1007/s00165-008-0092-5openalex-snapshot
Trace-based derivation of a scalable lock-free stack algorithm
inferred← citeshttps://doi.org/10.1007/s00165-014-0310-2openalex-snapshot
Balancing expressiveness in formal approaches to concurrency
inferred← citeshttps://doi.org/10.1007/s00165-016-0384-0openalex-snapshot
Generalised rely-guarantee concurrency: an algebraic foundation
inferred← citeshttps://doi.org/10.1007/s00165-017-0416-4openalex-snapshot
Designing a semantic model for a wide-spectrum language with concurrency
inferred← citeshttps://doi.org/10.1007/s00236-006-0016-xopenalex-snapshot
Compositional Analysis of C/C++ Programs with VeriSoft
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.01.016openalex-snapshot
Probabilistic rely-guarantee calculus
inferred← citeshttps://doi.org/10.1109/formalise58978.2023.00019openalex-snapshot
Using cylindric algebra to support local variables in rely/guarantee concurrency
inferred← citeshttps://doi.org/10.1145/2442992.2442998openalex-snapshot
A pattern-supported parallelization approach
inferred← citeshttps://doi.org/10.1145/3656399openalex-snapshot
Compositional Semantics for Shared-Variable Concurrency
inferred← citeshttps://doi.org/10.1145/3801150openalex-snapshot
Reasoning about expression evaluation under interference
inferred← citeshttps://doi.org/10.25405/ncl.34187382openalex-snapshot
Refining rely-guarantee thinking
inferred← citeshttps://doi.org/10.25405/ncl.34217220openalex-snapshot
Abstracting Interference in Postconditions
inferred← citeshttps://doi.org/10.25405/ncl.34231149openalex-snapshot
Laws and semantics for rely-guarantee refinement
inferred← citeshttps://doi.org/10.25949/19430699openalex-snapshot
Algebraic verification of probabilistic and concurrent systems
inferred← citeshttps://doi.org/10.48550/arxiv.1907.04005openalex-snapshot
Handling localisation in rely/guarantee concurrency: An algebraic approach
inferred← citeshttps://doi.org/10.48550/arxiv.2103.15292openalex-snapshot
Deriving Laws for Developing Concurrent Programs in a Rely-Guarantee Style
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.