On the public citation graph

Mechanizing some advanced refinement concepts

https://doi.org/10.1007/bf01383984
0 signed · 48 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-51305-1_7openalex-snapshot
Stepwise refinement of action systems
inferredcites →https://doi.org/10.1007/3-540-52559-9_61openalex-snapshot
Refinement calculus, part II: Parallel and reactive programs
inferredcites →https://doi.org/10.1007/3-540-52559-9_71openalex-snapshot
On decomposing and refining specifications of distributed systems
inferredcites →https://doi.org/10.1007/3-540-56496-9_5openalex-snapshot
Mechanical verification of concurrent systems with TLA
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/978-1-4471-3550-0_14openalex-snapshot
A Tactic Driven Refinement Tool
inferredcites →https://doi.org/10.1007/978-1-4612-3228-5openalex-snapshot
Predicate Calculus and Program Semantics
inferredcites →https://doi.org/10.1007/978-1-4612-3658-0_10openalex-snapshot
Mechanizing Programming Logics in Higher Order Logic
inferredcites →https://doi.org/10.1007/978-1-4613-2007-4_3openalex-snapshot
HOL: A Proof Generating System for Higher-Order Logic
inferredcites →https://doi.org/10.1007/978-1-4613-9668-0_6openalex-snapshot
Parallel Program Design
inferredcites →https://doi.org/10.1007/bf00276019openalex-snapshot
Laws of data refinement
inferredcites →https://doi.org/10.1007/bf00291051openalex-snapshot
A calculus of refinements for program derivations
inferredcites →https://doi.org/10.1007/bf01888227openalex-snapshot
Refinement concepts formalised in higher order logic
inferredcites →https://doi.org/10.1016/0020-0190(87)90224-9openalex-snapshot
Prespecification in data refinement
inferredcites →https://doi.org/10.1016/0020-0190(88)90147-0openalex-snapshot
Data refinement by miracles
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/0304-3975(91)90029-2openalex-snapshot
Data refinement of predicate transformers
inferredcites →https://doi.org/10.1016/0304-3975(92)90309-4openalex-snapshot
Combining angels, demons and miracles in program specifications
inferredcites →https://doi.org/10.1016/0965-9978(92)90070-vopenalex-snapshot
Structured programming
inferredcites →https://doi.org/10.1016/b978-0-444-89402-1.50044-8openalex-snapshot
Superposition Refinement of Parallel Algorithms
inferredcites →https://doi.org/10.1109/32.58786openalex-snapshot
Mechanizing CSP trace theory in higher order logic
inferredcites →https://doi.org/10.1109/hicss.1989.47997openalex-snapshot
Changing data representation in the refinement calculus
inferredcites →https://doi.org/10.1109/hol.1991.596288openalex-snapshot
Mechanizing Program Verification in HOL
inferredcites →https://doi.org/10.1109/hol.1991.596290openalex-snapshot
Program Transformations And Refinements In HOL
inferredcites →https://doi.org/10.1145/73560.73581openalex-snapshot
A compositional approach to superimposition
inferredcites →https://doi.org/10.1145/75199.75221openalex-snapshot
Software development using models
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types

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-48167-2_10openalex-snapshot
Metatheory of Verification Calculi in LEGO
inferred← citeshttps://doi.org/10.1007/3-540-58450-1_52openalex-snapshot
A HOL formalisation of the Temporal Logic of Actions
inferred← citeshttps://doi.org/10.1007/3-540-60275-5_69openalex-snapshot
TkWinHOL: A tool for Window Inference in HOL
inferred← citeshttps://doi.org/10.1007/3-540-60275-5_78openalex-snapshot
A hierarchical method for reasoning about distributed programming languages
inferred← citeshttps://doi.org/10.1007/978-1-4471-3240-0_7openalex-snapshot
Program Refinement by Theorem Prover
inferred← citeshttps://doi.org/10.1007/978-3-319-76168-8_3openalex-snapshot
Extended Floyd-Hoare Logic over Relational Nominative Data
inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_26openalex-snapshot
A Verification Environment for Sequential Imperative Programs in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-540-39893-6_23openalex-snapshot
A Refinement Tool for Z
inferred← citeshttps://doi.org/10.1007/978-3-540-49020-3_13openalex-snapshot
Owicki/Gries in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/bfb0000475openalex-snapshot
Floating point verification in HOL light: The exponential function
inferred← citeshttps://doi.org/10.1007/bfb0055136openalex-snapshot
Formalizing Dijkstra
inferred← citeshttps://doi.org/10.1007/bfb0105399openalex-snapshot
Program derivation using the refinement calculator
inferred← citeshttps://doi.org/10.1007/s00165-003-0003-8openalex-snapshot
ArcAngel: a Tactic Language for Refinement
inferred← citeshttps://doi.org/10.1016/b978-0-444-89880-7.50027-9openalex-snapshot
Deriving Correctness Properties of Compiled Code
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.03.015openalex-snapshot
Mechanised Refinement of Procedures
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.09.065openalex-snapshot
State Spaces — The Locale Way
inferred← citeshttps://doi.org/10.1016/j.scico.2010.11.012openalex-snapshot
A tactic language for refinement of state-rich concurrent specifications
inferred← citeshttps://doi.org/10.1023/a:1008712907154openalex-snapshot
Floating Point Verification in HOL Light: The Exponential Function
inferred← citeshttps://doi.org/10.1109/sefm.2004.1347535openalex-snapshot
Refine and gabriel: support for refinement and tactics
inferred← citeshttps://doi.org/10.1109/sefm.2004.37openalex-snapshot
Refine and gabriel: support for refinement and tactics
inferred← citeshttps://doi.org/10.55056/ceur-ws.org/vol-1844/10000504.pdfopenalex-snapshot
An Approach To Formalization of an Extension of Floyd-Hoare Logic
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.