On the public citation graph

Goto statements: semantics and deduction systems

https://doi.org/10.1007/bf00264536
0 signed · 32 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-08342-1_3openalex-snapshot
Semantics and proof theory of pascal procedures
inferredcites →https://doi.org/10.1007/978-3-642-67600-0_6openalex-snapshot
Exception Handling with Multi-Exit Statements
inferredcites →https://doi.org/10.1007/bf00264021openalex-snapshot
Proof rules for gotos
inferredcites →https://doi.org/10.1007/bf00288686openalex-snapshot
Program proving: Jumps and functions
inferredcites →https://doi.org/10.1016/0096-0551(83)90036-xopenalex-snapshot
Denotational semantics: The scott-strachey approach to programming language theory
inferredcites →https://doi.org/10.1137/0207005openalex-snapshot
Soundness and Completeness of an Axiom System for Program Verification
inferredcites →https://doi.org/10.1145/322047.322062openalex-snapshot
A New Incompleteness Result for Hoare's System
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11609773_6openalex-snapshot
A Compositional Logic for Control Flow
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-540-24622-0_4openalex-snapshot
Construction of a Semantic Model for a Typed Assembly Language
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/bf02983373openalex-snapshot
Proof theory for exception handling in a tasking environment
inferred← citeshttps://doi.org/10.1007/bfb0030642openalex-snapshot
COMPASS: A comprehensible assertion method
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.entcs.2011.09.021openalex-snapshot
Precision and the Conjunction Rule in Concurrent Separation Logic
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.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.tcs.2006.12.020openalex-snapshot
A compositional natural semantics and Hoare logic for low-level languages
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.1145/1709093.1709094openalex-snapshot
Semantic foundations for typed assembly languages
inferred← citeshttps://doi.org/10.1145/358728.358748openalex-snapshot
A critique of the foundations of Hoare style programming logics
inferred← citeshttps://doi.org/10.14279/depositonce-4137openalex-snapshot
A mechanized verification environment for real-time process algebras and low-level programming languages
inferred← citeshttps://doi.org/10.17863/cam.57136openalex-snapshot
A Program Logic for First-Order Encapsulated WebAssembly
inferred← citeshttps://doi.org/10.2139/ssrn.5046959openalex-snapshot
Hoare-Style Logic for Unstructured Programs
inferred← citeshttps://doi.org/10.48456/tr-758openalex-snapshot
Logics and analyses for concurrent heap-manipulating programs
inferred← citeshttps://doi.org/10.7561/sacs.2016.1openalex-snapshot
inferred← citeshttps://doi.org/10.7561/sacs.2016.2openalex-snapshot
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.