On the public citation graph
Proving correctness of coroutines without history variables
0 signed · 25 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/bf00264034openalex-snapshot
Consistent and complementary formal theories of the semantics of programming languages
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.1016/s0022-0000(75)80056-0openalex-snapshot
On the completeness of the inductive assertion method
inferredcites →https://doi.org/10.1090/psapm/019openalex-snapshot
Mathematical Aspects of Computer Science
inferredcites →https://doi.org/10.1109/sfcs.1977.25openalex-snapshot
Program invariants as fixed points
inferredcites →https://doi.org/10.1145/321592.321606openalex-snapshot
Formalization of Properties of Functional Programs
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/512950.512952openalex-snapshot
Programming language constructs for which it is impossible to obtain good hoare-like axiom systems
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-10003-2_65openalex-snapshot
Semantic analysis of communicating sequential processes
inferred← citeshttps://doi.org/10.1007/978-1-4757-2714-2_4openalex-snapshot
Disjoint Parallel Programs
inferred← citeshttps://doi.org/10.1007/978-1-4757-4376-0_5openalex-snapshot
Disjoint Parallel Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-30734-3_16openalex-snapshot
Effectively Eliminating Auxiliaries
inferred← citeshttps://doi.org/10.1007/978-3-319-77935-5_5openalex-snapshot
Simpler Specifications and Easier Proofs of Distributed Algorithms Using History Variables
inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_1openalex-snapshot
The Birth of Model Checking
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.1145/357146.357150openalex-snapshot
Ten Years of Hoare's Logic: A Survey—Part I
inferred← citeshttps://doi.org/10.1145/800017.800516openalex-snapshot
Temporal verification of carrier-sense local area network protocols
inferred← citeshttps://doi.org/10.2478/v10129-010-0013-7openalex-snapshot
Threat to arable weeds in poland in the light of national and regional red lists
inferred← citeshttps://doi.org/10.2478/v10129-010-0019-1openalex-snapshot
Protection of segetal flora and vegetation in Poland (historical outline)
inferred← citeshttps://doi.org/10.71548/18425openalex-snapshot
A Unifying Theory of Multi-Exit Programs
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.