On the public citation graph

Axiomatic approach to side effects and general jumps

https://doi.org/10.1007/bf00289468
0 signed · 47 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/bf00264034openalex-snapshot
Consistent and complementary formal theories of the semantics of programming languages
inferredcites →https://doi.org/10.1007/bf00288686openalex-snapshot
Program proving: Jumps and functions
inferredcites →https://doi.org/10.1007/bf00571463openalex-snapshot
Program proving: Coroutines
inferredcites →https://doi.org/10.1007/bfb0059696openalex-snapshot
Procedures and parameters: An axiomatic approach
inferredcites →https://doi.org/10.1016/0096-0551(75)90014-4openalex-snapshot
Parallel programming: An axiomatic approach
inferredcites →https://doi.org/10.1090/psapm/019/0235771openalex-snapshot
Assigning meanings to programs
inferredcites →https://doi.org/10.1145/356635.356640openalex-snapshot
Structured Programming with go to Statements
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/363235.363259openalex-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.1002/cpe.598openalex-snapshot
Hoare logic for Java in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/11609773_6openalex-snapshot
A Compositional Logic for Control Flow
inferred← citeshttps://doi.org/10.1007/3-540-45614-7_6openalex-snapshot
Hoare Logic for NanoJava: Auxiliary Variables, Side Effects, and Virtual Methods Revisited
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-39958-2_5openalex-snapshot
A Syntax-Directed Hoare Logic for Object-Oriented Programming Concepts
inferred← citeshttps://doi.org/10.1007/978-3-540-71067-7_18openalex-snapshot
Lightweight Separation
inferred← citeshttps://doi.org/10.1007/978-3-540-71389-0_26openalex-snapshot
Logical Reasoning for Higher-Order Functions with Local State
inferred← citeshttps://doi.org/10.1007/978-3-642-05089-3_40openalex-snapshot
Reasoning about Memory Layouts
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-94-010-0413-8_11openalex-snapshot
Hoare Logics in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/bf00264021openalex-snapshot
Proof rules for gotos
inferred← citeshttps://doi.org/10.1007/bf02243568openalex-snapshot
Comments on a paper by neuhold and studer
inferred← citeshttps://doi.org/10.1007/bfb0025790openalex-snapshot
A critique of the foundations of Hoare-style programming logics
inferred← citeshttps://doi.org/10.1007/s10703-010-0098-5openalex-snapshot
Reasoning about memory layouts
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.jlamp.2025.101099openalex-snapshot
Hoare-style logic for unstructured programs
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.1016/j.tcs.2013.11.003openalex-snapshot
An observationally complete program logic for imperative higher-order functions
inferred← citeshttps://doi.org/10.1017/s095679680000366xopenalex-snapshot
A study of evaluation order semantics in expressions with side effects
inferred← citeshttps://doi.org/10.1109/lics.2005.5openalex-snapshot
An Observationally Complete Program Logic for Imperative Higher-Order Frame Rules
inferred← citeshttps://doi.org/10.1109/wpc.2001.921741openalex-snapshot
Side-effect removal transformation
inferred← citeshttps://doi.org/10.1145/1010782.1010784openalex-snapshot
Some verification problems in Pascal-like languages
inferred← citeshttps://doi.org/10.1145/1013963.1013985openalex-snapshot
A compositional logic for polymorphic higher-order functions
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/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/358728.358748openalex-snapshot
A critique of the foundations of Hoare style programming logics
inferred← citeshttps://doi.org/10.1145/4472.4474openalex-snapshot
Side effects and aliasing can have simple axiomatic descriptions
inferred← citeshttps://doi.org/10.1145/582153.582182openalex-snapshot
A logic for expressions with side-effects
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.23.319.304openalex-snapshot
High-level Proofs about Low-level Programs
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.2168/lmcs-4(4:2)2008openalex-snapshot
Logical Reasoning for Higher-Order Functions with Local State
inferred← citeshttps://doi.org/10.48456/tr-453openalex-snapshot
C formalised in HOL
inferred← citeshttps://doi.org/10.71548/14032openalex-snapshot
A Comparative Study of Pre/postcondition and Relational Approaches to Program Development
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.