On the public citation graph

Recursive assertions and parallel programs

https://doi.org/10.1007/bf00289262
0 signed · 30 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-09526-8_8openalex-snapshot
Full abstraction for a simple parallel programming language
inferredcites →https://doi.org/10.1007/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1016/0304-3975(79)90058-6openalex-snapshot
Recursive assertions are not enough - or are they?
inferredcites →https://doi.org/10.1109/tse.1977.229904openalex-snapshot
Proving the Correctness of Multiprocess Programs
inferredcites →https://doi.org/10.1137/0207005openalex-snapshot
Soundness and Completeness of an Axiom System for Program Verification
inferredcites →https://doi.org/10.1145/800113.803634openalex-snapshot
A consistent and complete deductive system for the verification of parallel programs

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-10843-2_29openalex-snapshot
Algebraically specified programming systems and Hoare's logic
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_90openalex-snapshot
A compositional reformulation of Owicki-Gries's partial correctness logic for a concurrent while language
inferred← citeshttps://doi.org/10.1007/3-540-18419-8_10openalex-snapshot
Designing equivalent semantic models for process creation
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_17openalex-snapshot
Concurrent Programs as Strategies in Games
inferred← citeshttps://doi.org/10.1007/978-3-031-73887-6_19openalex-snapshot
Three Ways of Proving Termination of Loops
inferred← citeshttps://doi.org/10.1007/978-3-031-97439-7_15openalex-snapshot
Beyond Concurrent Separation Logic: Who is Afraid of Completeness Proofs?
inferred← citeshttps://doi.org/10.1007/978-3-319-30734-3_16openalex-snapshot
Effectively Eliminating Auxiliaries
inferred← citeshttps://doi.org/10.1007/bf01211617openalex-snapshot
The rely-guarantee method for verifying shared variable concurrent programs
inferred← citeshttps://doi.org/10.1007/bfb0027040openalex-snapshot
Contrasting themes in the semantics of imperative concurrency
inferred← citeshttps://doi.org/10.1007/bfb0032058openalex-snapshot
Proving partial order liveness properties
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90026-8openalex-snapshot
Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
inferred← citeshttps://doi.org/10.1016/0164-1212(93)90023-qopenalex-snapshot
Tracing the execution of distributed programs
inferred← citeshttps://doi.org/10.1016/0168-0072(88)90024-3openalex-snapshot
On the programs-as-formulas interpretation of parallel programs in peano arithmetic
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90033-3openalex-snapshot
A generalization of Owicki-Gries's Hoare logic for a concurrent while language
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90048-5openalex-snapshot
Designing equivalent semantic models for process creation
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90009-4openalex-snapshot
Proving partial order properties
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90005-mopenalex-snapshot
Towards a foundation for semantics in complete metric spaces
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50020-2openalex-snapshot
Methods and Logics for Proving Programs
inferred← citeshttps://doi.org/10.1109/ipdps.2001.925138openalex-snapshot
Completeness of the owicki-gries system for parameterized parallel programs
inferred← citeshttps://doi.org/10.1145/22145.22174openalex-snapshot
Transition systems, infinitary languages and the semantics of uniform concurrency
inferred← citeshttps://doi.org/10.1145/322358.322372openalex-snapshot
Formal Justification of a Proof System for Communicating Sequential Processes
inferred← citeshttps://doi.org/10.1145/357103.357110openalex-snapshot
A Proof System for Communicating Sequential Processes
inferred← citeshttps://doi.org/10.1145/4472.4473openalex-snapshot
The denotational semantics of dynamic networks of processes
inferred← citeshttps://doi.org/10.1145/512644.512662openalex-snapshot
Operational semantics of a parallel object-oriented language
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.