On the public citation graph

do considered od: A contribution to the programming calculus

https://doi.org/10.1007/bf00289091
0 signed · 54 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.1145/356635.356640openalex-snapshot
Structured Programming with go to Statements
inferredcites →https://doi.org/10.1145/360933.360975openalex-snapshot
Guarded commands, nondeterminacy and formal derivation of programs
inferredcites →https://doi.org/10.1145/361219.361222openalex-snapshot
A genealogy of control structures
inferredcites →https://doi.org/10.1145/362575.362577openalex-snapshot
Program development by stepwise refinement
inferredcites →https://doi.org/10.26153/tsw/52882openalex-snapshot
A short introduction to the art of programming

What points at this work

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

inferred← citeshttps://doi.org/10.1002/stvr.4370020304openalex-snapshot
Structured inspections of code
inferred← citeshttps://doi.org/10.1007/11589976_19openalex-snapshot
A Fixpoint Semantics of Event Systems With and Without Fairness Assumptions
inferred← citeshttps://doi.org/10.1007/11767589_1openalex-snapshot
Invariant Based Programming
inferred← citeshttps://doi.org/10.1007/11768173_1openalex-snapshot
Retrospective and Prospective for Unifying Theories of Programming
inferred← citeshttps://doi.org/10.1007/3-540-51305-1_8openalex-snapshot
A lattice-theoretical basis for a specification language
inferred← citeshttps://doi.org/10.1007/978-0-387-35264-0_16openalex-snapshot
Predicative Semantics of Loops
inferred← citeshttps://doi.org/10.1007/978-1-4419-8596-5openalex-snapshot
A Practical Theory of Programming
inferred← citeshttps://doi.org/10.1007/978-1-4419-8596-5_11openalex-snapshot
Reference
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_30openalex-snapshot
Invariants in Process Algebra with Data
inferred← citeshttps://doi.org/10.1007/978-3-642-67600-0_6openalex-snapshot
Exception Handling with Multi-Exit Statements
inferred← citeshttps://doi.org/10.1007/bf00244290openalex-snapshot
On the role of automated theorem proving in the compile-time derivation of concurrency
inferred← citeshttps://doi.org/10.1007/bf00259469openalex-snapshot
Duality in specification languages: a lattice-theoretical approach
inferred← citeshttps://doi.org/10.1007/bf00264318openalex-snapshot
On removing the machine from the language
inferred← citeshttps://doi.org/10.1007/bf00276020openalex-snapshot
Predicate-transformer semantics of general recursion
inferred← citeshttps://doi.org/10.1007/bf00289263openalex-snapshot
Proving total correctness of nondeterministic programs in infinitary logic
inferred← citeshttps://doi.org/10.1007/bf00291051openalex-snapshot
A calculus of refinements for program derivations
inferred← citeshttps://doi.org/10.1007/bf01211249openalex-snapshot
Proof rules for recursive procedures
inferred← citeshttps://doi.org/10.1007/bf01213603openalex-snapshot
The weakest precondition calculus: Recursion and duality
inferred← citeshttps://doi.org/10.1007/bfb0105115openalex-snapshot
On language constructs for concurrent programs
inferred← citeshttps://doi.org/10.1007/bfb0105123openalex-snapshot
A methodology for programming with concurrency
inferred← citeshttps://doi.org/10.1007/s00165-008-0070-yopenalex-snapshot
Invariant based programming: basic approach and teaching experiences
inferred← citeshttps://doi.org/10.1007/s00165-009-0137-4openalex-snapshot
An elementary and unified approach to program correctness
inferred← citeshttps://doi.org/10.1007/s00165-011-0195-2openalex-snapshot
Invariant diagrams with data refinement
inferred← citeshttps://doi.org/10.1016/0020-0190(80)90009-5openalex-snapshot
Transformational semantics for concurrent programs
inferred← citeshttps://doi.org/10.1016/0096-0551(85)90007-4openalex-snapshot
The design of Apple—A language for modular programs
inferred← citeshttps://doi.org/10.1016/0167-6423(82)90002-8openalex-snapshot
A methodology for programming with concurrency: An informal presentation
inferred← citeshttps://doi.org/10.1016/0167-6423(82)90003-xopenalex-snapshot
A methodology for programming with concurrency: the formalism
inferred← citeshttps://doi.org/10.1016/0167-6423(84)90016-9openalex-snapshot
A systematic approach to language constructs for concurrent programs
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.1016/s1571-0661(05)82567-8openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1049/sej.1992.0023openalex-snapshot
Refinement methods and refinement calculi
inferred← citeshttps://doi.org/10.1080/03155986.1980.11731794openalex-snapshot
On The Design Of Concurrent Programs
inferred← citeshttps://doi.org/10.1093/comjnl/30.6.512openalex-snapshot
Derivation of Sorting Algorithms from a Specification
inferred← citeshttps://doi.org/10.1109/32.4619openalex-snapshot
Systematic program development
inferred← citeshttps://doi.org/10.1145/1639950.1640070openalex-snapshot
Agile specifications
inferred← citeshttps://doi.org/10.1145/1982185.1982532openalex-snapshot
Semantics and proof rules of invariant based programs
inferred← citeshttps://doi.org/10.1145/2933575.2935317openalex-snapshot
Reasoning about Recursive Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3477355.3477369openalex-snapshot
Hoare and He’s Unifying Theories of Programming
inferred← citeshttps://doi.org/10.1145/357084.357085openalex-snapshot
And/Or Programs: A New Approach to Structured Programming
inferred← citeshttps://doi.org/10.1145/69558.69559openalex-snapshot
A generalization of Dijkstra's calculus
inferred← citeshttps://doi.org/10.1145/947631.947635openalex-snapshot
"do considered od" considered odder than "do considered ob"
inferred← citeshttps://doi.org/10.1145/947800.947803openalex-snapshot
do considered reflectively
inferred← citeshttps://doi.org/10.1145/947800.947804openalex-snapshot
do considered obviously odd in three dimensions
inferred← citeshttps://doi.org/10.1145/954127.954136openalex-snapshot
Structured programming with loop statements
inferred← citeshttps://doi.org/10.1201/9781420064872-10openalex-snapshot
Refinement of Parallel Algorithms
inferred← citeshttps://doi.org/10.1201/9781420064872.ch3openalex-snapshot
Refinement of Parallel Algorithms
inferred← citeshttps://doi.org/10.14236/ewic/rw1996.6openalex-snapshot
Procedures in the Refinement Calculus: A New Approach?
inferred← citeshttps://doi.org/10.14264/106784openalex-snapshot
Towards an object-oriented refinement calculus
inferred← citeshttps://doi.org/10.48550/arxiv.1603.02922openalex-snapshot
Reasoning about Recursive Probabilistic 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.