On the public citation graph

Program derivation using the refinement calculator

https://doi.org/10.1007/bfb0105399
0 signed · 29 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-57826-9_129openalex-snapshot
A proof development system for the HOL theorem prover
inferredcites →https://doi.org/10.1007/3-540-60275-5openalex-snapshot
Higher Order Logic Theorem Proving and Its Applications
inferredcites →https://doi.org/10.1007/3-540-60275-5_69openalex-snapshot
TkWinHOL: A tool for Window Inference in HOL
inferredcites →https://doi.org/10.1007/3-540-60275-5_74openalex-snapshot
A new interface for HOL — Ideas, issues and implementation
inferredcites →https://doi.org/10.1007/978-1-4471-3240-0_7openalex-snapshot
Program Refinement by Theorem Prover
inferredcites →https://doi.org/10.1007/978-1-4471-3550-0_12openalex-snapshot
A Window Inference Tool for Refinement
inferredcites →https://doi.org/10.1007/bf00291051openalex-snapshot
A calculus of refinements for program derivations
inferredcites →https://doi.org/10.1007/bf01383984openalex-snapshot
Mechanizing some advanced refinement concepts
inferredcites →https://doi.org/10.1007/bf01888227openalex-snapshot
Refinement concepts formalised in higher order logic
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.1093/logcom/3.1.47openalex-snapshot
Formalizing a Hierarchical Structure of Practical Mathematical Reasoning
inferredcites →https://doi.org/10.1109/32.58786openalex-snapshot
Mechanizing CSP trace theory in higher order logic
inferredcites →https://doi.org/10.1109/hol.1991.596285openalex-snapshot
Window Inference In The HOL System
inferredcites →https://doi.org/10.14236/ewic/rw1996.3openalex-snapshot
A Tool for Developing Correct Programs by Refinement

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-32409-4_19openalex-snapshot
A Mechanized Theory of Program Refinement
inferred← citeshttps://doi.org/10.1007/978-3-319-10181-1_13openalex-snapshot
Automated Theorem Prover Assisted Program Calculations
inferred← citeshttps://doi.org/10.1007/978-3-319-27436-2_15openalex-snapshot
Combining Top-Down and Bottom-Up Techniques in Program Derivation
inferred← citeshttps://doi.org/10.1007/bfb0028394openalex-snapshot
Refining reactive systems in HOL using action systems
inferred← citeshttps://doi.org/10.1007/bfb0105392openalex-snapshot
Theorem Proving in Higher Order Logics
inferred← citeshttps://doi.org/10.1007/s00165-016-0395-xopenalex-snapshot
Assumption propagation through annotated programs
inferred← citeshttps://doi.org/10.1007/s001650050006openalex-snapshot
A Program Refinement Tool
inferred← citeshttps://doi.org/10.1007/s00236-006-0029-5openalex-snapshot
Verification conditions are code
inferred← citeshttps://doi.org/10.1007/s002360050116openalex-snapshot
Refinement of fair action systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.03.015openalex-snapshot
Mechanised Refinement of Procedures
inferred← citeshttps://doi.org/10.1109/sefm.2004.1347533openalex-snapshot
Heuristics for refinement relations
inferred← citeshttps://doi.org/10.1109/sefm.2004.24openalex-snapshot
Heuristics for refinement relations
inferred← citeshttps://doi.org/10.1145/2983990.2983993openalex-snapshot
Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations
inferred← citeshttps://doi.org/10.1145/3022671.2983993openalex-snapshot
Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations
inferred← citeshttps://doi.org/10.4204/eptcs.187.1openalex-snapshot
Building an IDE for the Calculational Derivation of Imperative 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.