On the public citation graph

Refinement concepts formalised in higher order logic

0 signed · 74 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-09724-4openalex-snapshot

Edinburgh LCF

inferredcites →https://doi.org/10.1007/3-540-10007-5_47openalex-snapshot

On the semantics of fair parallelism

inferredcites →https://doi.org/10.1007/3-540-51285-3_42openalex-snapshot

A method for refining atomicity in parallel algorithms

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-51305-1_8openalex-snapshot

A lattice-theoretical basis for a specification language

inferredcites →https://doi.org/10.1007/3-540-52559-9_60openalex-snapshot

Refinement calculus, part I: Sequential nondeterministic programs

inferredcites →https://doi.org/10.1007/978-1-4471-3273-8openalex-snapshot

On the Refinement Calculus

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-4612-3658-0_9openalex-snapshot

Automating Recursive Type Definitions in Higher Order Logic

inferredcites →https://doi.org/10.1007/978-1-4612-5983-1openalex-snapshot

The Science of Programming

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/bf00268074openalex-snapshot

A simple fixpoint argument without the restriction to continuity

inferredcites →https://doi.org/10.1007/bf00291051openalex-snapshot

A calculus of refinements for program derivations

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.1145/9758.11326openalex-snapshot

Soundness of Hoare's logic: an automated proof using LCF

inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot

A lattice-theoretical fixpoint theorem and its applications

What points at this work

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

inferred← citeshttps://doi.org/10.1002/smr.4360070606openalex-snapshot

A definition of abstraction

inferred← citeshttps://doi.org/10.1007/11768173_13openalex-snapshot

Mechanising a Unifying Theory

inferred← citeshttps://doi.org/10.1007/3-540-48256-3_16openalex-snapshot

Representing WP Semantics in Isabelle/ZF

inferred← citeshttps://doi.org/10.1007/3-540-55092-5_23openalex-snapshot

TAM: A formal framework for the development of distributed real-time systems

inferred← citeshttps://doi.org/10.1007/3-540-56496-9_6openalex-snapshot

Using a theorem prover for reasoning about concurrent algorithms

inferred← citeshttps://doi.org/10.1007/3-540-56596-5_26openalex-snapshot

Predicate transformers and higher order logic

inferred← citeshttps://doi.org/10.1007/3-540-57182-5_60openalex-snapshot

Real-time refinement: Semantics and application

inferred← citeshttps://doi.org/10.1007/3-540-58027-1_11openalex-snapshot

A predicative semantics for the refinement of real-time systems

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-60117-1_8openalex-snapshot

Exploring summation and product operators in the refinement calculus

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/978-1-4471-3240-0_7openalex-snapshot

Program Refinement by Theorem Prover

inferred← citeshttps://doi.org/10.1007/978-1-4471-3550-0_12openalex-snapshot

A Window Inference Tool for Refinement

inferred← citeshttps://doi.org/10.1007/978-1-4471-3550-0_14openalex-snapshot

A Tactic Driven Refinement Tool

inferred← citeshttps://doi.org/10.1007/978-1-4471-3756-6_7openalex-snapshot

Refinement Diagrams

inferred← citeshttps://doi.org/10.1007/978-3-319-29604-3_3openalex-snapshot

From Proposition to Program

inferred← citeshttps://doi.org/10.1007/978-3-540-39893-6_23openalex-snapshot

A Refinement Tool for Z

inferred← citeshttps://doi.org/10.1007/bf01211455openalex-snapshot

Theories for mechanical proofs of imperative programs

inferred← citeshttps://doi.org/10.1007/bf01213532openalex-snapshot

Real-time refinement in Manna and Pnueli's temporal logic

inferred← citeshttps://doi.org/10.1007/bf01383984openalex-snapshot

Mechanizing some advanced refinement concepts

inferred← citeshttps://doi.org/10.1007/bfb0015470openalex-snapshot

Traverdi — Transformation and verification of distributed systems

inferred← citeshttps://doi.org/10.1007/bfb0028394openalex-snapshot

Refining reactive systems in HOL using action systems

inferred← citeshttps://doi.org/10.1007/bfb0105399openalex-snapshot

Program derivation using the refinement calculator

inferred← citeshttps://doi.org/10.1007/bfb0105413openalex-snapshot

Using lattice theory in higher order logic

inferred← citeshttps://doi.org/10.1007/s00165-003-0003-8openalex-snapshot

ArcAngel: a Tactic Language for Refinement

inferred← citeshttps://doi.org/10.1007/s001650050006openalex-snapshot

A Program Refinement Tool

inferred← citeshttps://doi.org/10.1007/s001650050046openalex-snapshot

Formalising a Value-Passing Calculus in HOL

inferred← citeshttps://doi.org/10.1007/s002360050148openalex-snapshot

Fusion and simultaneous execution in the refinement calculus

inferred← citeshttps://doi.org/10.1016/0304-3975(94)90096-5openalex-snapshot

A specification-oriented semantics for the refinement of real-time systems

inferred← citeshttps://doi.org/10.1016/0950-5849(95)98300-5openalex-snapshot

Transformational data refinement and VDM

inferred← citeshttps://doi.org/10.1016/b978-0-444-89880-7.50026-7openalex-snapshot

Mechanising some Advanced Refinement Concepts

inferred← citeshttps://doi.org/10.1016/j.entcs.2007.03.015openalex-snapshot

Mechanised Refinement of Procedures

inferred← citeshttps://doi.org/10.1016/j.entcs.2008.06.010openalex-snapshot

ArcAngelC: a Refinement Tactic Language for

inferred← citeshttps://doi.org/10.1016/j.scico.2004.03.007openalex-snapshot

Pigs from sausages? Reengineering from assembler to C via FermaT transformations

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.1016/j.scico.2017.04.003openalex-snapshot

Embedding the refinement calculus in Coq

inferred← citeshttps://doi.org/10.1016/j.scico.2020.102510openalex-snapshot

Unifying semantic foundations for automated verification tools in Isabelle/UTP

inferred← citeshttps://doi.org/10.1093/comjnl/42.8.650openalex-snapshot

Recursion Removal/Introduction by Formal Transformation: An Aid to Program Development and Program Comprehension

inferred← citeshttps://doi.org/10.1109/32.541437openalex-snapshot

Derivation of data intensive algorithms by formal transformation: the Schnorr-Waite graph marking algorithm

inferred← citeshttps://doi.org/10.1109/cmpsac.2002.1045029openalex-snapshot

Program slicing via FermaT transformations

inferred← citeshttps://doi.org/10.1109/compsac.2005.107openalex-snapshot

MetaWSL and Meta-Transformations in the FermaT Transformation System

inferred← citeshttps://doi.org/10.1109/emwrt.1992.637482openalex-snapshot

The refinement of real-time systems

inferred← citeshttps://doi.org/10.1109/hol.1991.596282openalex-snapshot

Mechanizing The Temporal Logic Of Actions In HOL

inferred← citeshttps://doi.org/10.1109/hol.1991.596288openalex-snapshot

Mechanizing Program Verification in HOL

inferred← citeshttps://doi.org/10.1109/hol.1991.596289openalex-snapshot

Proof Of Program Transformations

inferred← citeshttps://doi.org/10.1109/hol.1991.596290openalex-snapshot

Program Transformations And Refinements In HOL

inferred← citeshttps://doi.org/10.1109/scam.2001.972680openalex-snapshot

The formal transformation approach to source code analysis and manipulation

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.1109/snpd.2007.406openalex-snapshot

Web Marine Spatial Information Service Based on Electronic Nautical Charts

inferred← citeshttps://doi.org/10.1109/tse.2010.13openalex-snapshot

Deriving a Slicing Algorithm via FermaT Transformations

inferred← citeshttps://doi.org/10.1145/1216374.1216375openalex-snapshot

Slicing as a program transformation

inferred← citeshttps://doi.org/10.1145/3009837.3009883openalex-snapshot

Ogre and Pythia: an invariance proof method for weak consistency models

inferred← citeshttps://doi.org/10.1145/3093333.3009883openalex-snapshot

Ogre and Pythia: an invariance proof method for weak consistency models

inferred← citeshttps://doi.org/10.1145/3704905openalex-snapshot

Automated Program Refinement: Guide and Verify Code Large Language Model with Refinement Calculus

inferred← citeshttps://doi.org/10.14236/ewic/rw1996.3openalex-snapshot

A Tool for Developing Correct Programs by Refinement

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.