On the public citation graph
Program proving: Jumps and functions
0 signed · 120 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/bfb0059689openalex-snapshot
Symposium on Semantics of Algorithmic Languages
inferredcites →https://doi.org/10.1016/0020-0190(71)90018-4openalex-snapshot
Notes on avoiding “go to” statements
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/362929.362947openalex-snapshot
Letters to the editor: go to statement considered harmful
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/363744.363749openalex-snapshot
Correspondence between ALGOL 60 and Church's Lambda-notation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1099-1689(199906)9:2<85::aid-stvr178>3.0.co;2-2openalex-snapshot
Towards a transformational approach to program verification
inferred← citeshttps://doi.org/10.1002/spe.4380100204openalex-snapshot
Leave and recall: Primitives for procedural programming
inferred← citeshttps://doi.org/10.1002/spe.4380120410openalex-snapshot
Two examples of block structuring
inferred← citeshttps://doi.org/10.1002/spe.4380140504openalex-snapshot
Exception handling—A static approach
inferred← citeshttps://doi.org/10.1007/11609773_6openalex-snapshot
A Compositional Logic for Control Flow
inferred← citeshttps://doi.org/10.1007/3-540-06859-7_133openalex-snapshot
A control statement for natural top-down structured programming
inferred← citeshttps://doi.org/10.1007/3-540-46428-x_20openalex-snapshot
Java Program Verification via a Hoare Logic with Abrupt Termination
inferred← citeshttps://doi.org/10.1007/978-1-4419-5998-0_6openalex-snapshot
Connecting Different Proof Styles
inferred← citeshttps://doi.org/10.1007/978-1-84882-912-1_1openalex-snapshot
Insight, Inspiration and Collaboration
inferred← citeshttps://doi.org/10.1007/978-3-030-02928-9_6openalex-snapshot
Challenges for Formal Semantic Description: Responses from the Main Approaches
inferred← citeshttps://doi.org/10.1007/978-3-030-54997-8_3openalex-snapshot
Reasoning About Shared-Variable Concurrency: Interactions Between Research Threads
inferred← citeshttps://doi.org/10.1007/978-3-030-58768-0_11openalex-snapshot
Hoare-Style Logic for Unstructured Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-88701-8_20openalex-snapshot
On Algebra of Program Correctness and Incorrectness
inferred← citeshttps://doi.org/10.1007/978-3-642-11623-0_11openalex-snapshot
Program Logics for Sequential Higher-Order Control
inferred← citeshttps://doi.org/10.1007/978-3-642-15057-9_4openalex-snapshot
A Rely-Guarantee Proof System for x86-TSO
inferred← citeshttps://doi.org/10.1007/978-3-642-59412-0_22openalex-snapshot
Assertions: A Personal Perspective
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/978-3-642-67881-3_7openalex-snapshot
Correctness of Software — An Overview
inferred← citeshttps://doi.org/10.1007/978-3-642-77968-8_10openalex-snapshot
Programs: Correctness and Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-80732-9_12openalex-snapshot
A Hierarchy of Control Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-82470-8_21openalex-snapshot
Process Structuring, Synchronization, and Recovery Using Atomic Actions
inferred← citeshttps://doi.org/10.1007/978-3-642-83608-4_10openalex-snapshot
Programme: Korrektheit und Verifikation
inferred← citeshttps://doi.org/10.1007/978-3-642-95289-0_10openalex-snapshot
Program Proving: Exit and Return Jumps in Structured Programs
inferred← citeshttps://doi.org/10.1007/bf00264536openalex-snapshot
Goto statements: semantics and deduction systems
inferred← citeshttps://doi.org/10.1007/bf00288541openalex-snapshot
Hierarchical program specification and verification ? a many-sorted logical approach
inferred← citeshttps://doi.org/10.1007/bf00288660openalex-snapshot
Remarks on ?program proving: Jumps and functions by M. Clint and C. A. R. Hoare?
inferred← citeshttps://doi.org/10.1007/bf00288746openalex-snapshot
Automatic program verification I: A logical basis and its implementation
inferred← citeshttps://doi.org/10.1007/bf00289468openalex-snapshot
Axiomatic approach to side effects and general jumps
inferred← citeshttps://doi.org/10.1007/bf01069058openalex-snapshot
Current methods for proving program correctness
inferred← citeshttps://doi.org/10.1007/bf01940782openalex-snapshot
An axiomatic basis for proving total correctness of goto-programs
inferred← citeshttps://doi.org/10.1007/bf02244016openalex-snapshot
The use of Hoare's method of program verfification for the quicksort algorithm
inferred← citeshttps://doi.org/10.1007/bf02252958openalex-snapshot
A complete axiomatic semantics of spawning
inferred← citeshttps://doi.org/10.1007/bf02983373openalex-snapshot
Proof theory for exception handling in a tasking environment
inferred← citeshttps://doi.org/10.1007/bfb0025776openalex-snapshot
Correctness of programs with function procedures
inferred← citeshttps://doi.org/10.1007/bfb0025790openalex-snapshot
A critique of the foundations of Hoare-style programming logics
inferred← citeshttps://doi.org/10.1007/s001530000057openalex-snapshot
Typed lambda-calculus in classical Zermelo-Frænkel set theory
inferred← citeshttps://doi.org/10.1007/s00165-019-00501-3openalex-snapshot
Fifty years of Hoare’s logic
inferred← citeshttps://doi.org/10.1007/s10817-008-9098-1openalex-snapshot
A Mechanical Analysis of Program Verification Strategies
inferred← citeshttps://doi.org/10.1016/0020-0190(84)90115-7openalex-snapshot
On verification of programs with goto statements
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90058-popenalex-snapshot
Axiomatic semantics for “escape” statements
inferred← citeshttps://doi.org/10.1016/0096-0551(77)90002-9openalex-snapshot
Pointers and data abstractions in high level languages—I: Language proposals
inferred← citeshttps://doi.org/10.1016/0096-0551(77)90003-0openalex-snapshot
Pointers and data abstractions in high level languages—II: Correctness proofs
inferred← citeshttps://doi.org/10.1016/0096-0551(82)90024-8openalex-snapshot
A mechanism for exception handling and its verification rules
inferred← citeshttps://doi.org/10.1016/0096-0551(83)90017-6openalex-snapshot
Some proposals for improving Pascal
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90184-4openalex-snapshot
Continuations in possible-world semantics
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90045-jopenalex-snapshot
Semantical analysis of specification logic
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/j.entcs.2005.09.031openalex-snapshot
A Compositional Natural Semantics and Hoare Logic for Low-Level Languages
inferred← citeshttps://doi.org/10.1016/j.ipl.2022.106329openalex-snapshot
Weakest preconditioned goto axiom
inferred← citeshttps://doi.org/10.1016/j.jlamp.2025.101099openalex-snapshot
Hoare-style logic for unstructured programs
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.01.004openalex-snapshot
Deriving a Floyd–Hoare logic for non-local jumps from a formulæ-as-types notion of control
inferred← citeshttps://doi.org/10.1016/j.scico.2005.05.003openalex-snapshot
To use or not to use the goto statement: Programming styles viewed from Hoare Logic
inferred← citeshttps://doi.org/10.1016/j.scico.2021.102679openalex-snapshot
Loop invariance with break and continue
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.020openalex-snapshot
A compositional natural semantics and Hoare logic for low-level languages
inferred← citeshttps://doi.org/10.1051/ita/1980140302471openalex-snapshot
Systèmes de déduction pour les arbres et les schémas de programmes (I)
inferred← citeshttps://doi.org/10.1109/43.277609openalex-snapshot
Formal verification of sequential hardware: a tutorial
inferred← citeshttps://doi.org/10.1109/apsec.2002.1182974openalex-snapshot
Refining exceptions using King and Morgan's exit construct
inferred← citeshttps://doi.org/10.1109/icdcs.1989.37994openalex-snapshot
An approach to verification of communication in distributed computing system software
inferred← citeshttps://doi.org/10.1109/lics.2000.855779openalex-snapshot
The curry-howard correspondence in set theory
inferred← citeshttps://doi.org/10.1109/mahc.2003.1203056openalex-snapshot
Assertions: a personal perspective
inferred← citeshttps://doi.org/10.1109/mahc.2003.1203057openalex-snapshot
The early search for tractable ways of reasoning about programs
inferred← citeshttps://doi.org/10.1109/tase52547.2021.00019openalex-snapshot
A wp Characterization of Jump Statements
inferred← citeshttps://doi.org/10.1109/tase52547.2021.00021openalex-snapshot
Behind Clint and Hoare’s goto Proof Rule
inferred← citeshttps://doi.org/10.1109/tse.1977.229905openalex-snapshot
A General, Verifiable Iterative Control Structure
inferred← citeshttps://doi.org/10.1109/tse.1978.231499openalex-snapshot
The Logic of Computer Programming
inferred← citeshttps://doi.org/10.1145/1016848.1016874openalex-snapshot
From process logic to program logic
inferred← citeshttps://doi.org/10.1145/1016850.1016874openalex-snapshot
From process logic to program logic
inferred← citeshttps://doi.org/10.1145/1408800.1408869openalex-snapshot
Towards a definition of structured programming
inferred← citeshttps://doi.org/10.1145/1709093.1709094openalex-snapshot
Semantic foundations for typed assembly languages
inferred← citeshttps://doi.org/10.1145/24039.24052openalex-snapshot
An axiomatic treatment of exception handling in an expression-oriented language
inferred← citeshttps://doi.org/10.1145/2500365.2500593openalex-snapshot
Hoare-style reasoning with (algebraic) continuations
inferred← citeshttps://doi.org/10.1145/3477355.3477358openalex-snapshot
Finding Effective Abstractions
inferred← citeshttps://doi.org/10.1145/3477355.3477375openalex-snapshot
List of Tony Hoare’s Publications
inferred← citeshttps://doi.org/10.1145/356635.356640openalex-snapshot
Structured Programming with go to Statements
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/358728.358748openalex-snapshot
A critique of the foundations of Hoare style programming logics
inferred← citeshttps://doi.org/10.1145/362280.362300openalex-snapshot
Multiple exits from a loop without the GOTO
inferred← citeshttps://doi.org/10.1145/382196.382997openalex-snapshot
Structured programming, programming teaching and the language Pascal
inferred← citeshttps://doi.org/10.1145/390016.808420openalex-snapshot
The impact of language design on the production of reliable software
inferred← citeshttps://doi.org/10.1145/390017.808319openalex-snapshot
Process structuring, synchronization, and recovery using atomic actions
inferred← citeshttps://doi.org/10.1145/390018.808319openalex-snapshot
Process structuring, synchronization, and recovery using atomic actions
inferred← citeshttps://doi.org/10.1145/390019.808319openalex-snapshot
Process structuring, synchronization, and recovery using atomic actions
inferred← citeshttps://doi.org/10.1145/512950.512955openalex-snapshot
Applications of high level control flow
inferred← citeshttps://doi.org/10.1145/800022.808319openalex-snapshot
Process structuring, synchronization, and recovery using atomic actions
inferred← citeshttps://doi.org/10.1145/800027.808420openalex-snapshot
The impact of language design on the production of reliable software
inferred← citeshttps://doi.org/10.1145/800105.803417openalex-snapshot
On the theory of programming logics
inferred← citeshttps://doi.org/10.1145/800130.804247openalex-snapshot
Direct connection between Compiling Techniques and Databases courses
inferred← citeshttps://doi.org/10.1145/800191.805513openalex-snapshot
The assignment axiom and programming language design
inferred← citeshttps://doi.org/10.1145/953028.804247openalex-snapshot
Direct connection between Compiling Techniques and Databases courses
inferred← citeshttps://doi.org/10.1145/953224.953226openalex-snapshot
Structured programming, programming teaching and the language Pascal
inferred← citeshttps://doi.org/10.1145/953438.953443openalex-snapshot
Control constructs for programming languages
inferred← citeshttps://doi.org/10.1145/987000.987002openalex-snapshot
A hierarchy of control structures
inferred← citeshttps://doi.org/10.17863/cam.57136openalex-snapshot
A Program Logic for First-Order Encapsulated WebAssembly
inferred← citeshttps://doi.org/10.20868/upm.thesis.47796openalex-snapshot
Hoare-style Reasoning with Higher-order Control : Continuations and Concurrency
inferred← citeshttps://doi.org/10.2139/ssrn.5046959openalex-snapshot
Hoare-Style Logic for Unstructured Programs
inferred← citeshttps://doi.org/10.35537/10915/27887openalex-snapshot
Computabilidad, complejidad computacional y verificación de programas
inferred← citeshttps://doi.org/10.48550/arxiv.1112.1554openalex-snapshot
A program logic for higher-order procedural variables and non-local jumps
inferred← citeshttps://doi.org/10.71548/14032openalex-snapshot
A Comparative Study of Pre/postcondition and Relational Approaches to Program Development
inferred← citeshttps://doi.org/10.82444/warw.33626095openalex-snapshot
Design considerations of an intelligent tutoring system for programming languages
inferred← citeshttps://doi.org/10.82444/warw.33642034openalex-snapshot
Verification and abstraction of flow-graph programs with pointers and computed jumps
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.