On the public citation graph
Correctness of programs with function procedures
0 signed · 38 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/3-540-06841-4_57openalex-snapshot
On the relation between direct and continuation semantics
inferredcites →https://doi.org/10.1007/3-540-10003-2_84openalex-snapshot
Present-day Hoare-like systems for programming languages with procedures: Power, limits and most likely extensions
inferredcites →https://doi.org/10.1007/978-3-662-21545-6_10openalex-snapshot
On the Relation between Direct and Continuation Semantics
inferredcites →https://doi.org/10.1007/bf00288660openalex-snapshot
Remarks on ?program proving: Jumps and functions by M. Clint and C. A. R. Hoare?
inferredcites →https://doi.org/10.1007/bf00288686openalex-snapshot
Program proving: Jumps and functions
inferredcites →https://doi.org/10.1007/bfb0066739openalex-snapshot
Metamathematical Investigation of Intuitionistic Arithmetic and Analysis
inferredcites →https://doi.org/10.1016/0304-3975(76)90031-1openalex-snapshot
Least fixed points revisited
inferredcites →https://doi.org/10.1016/0304-3975(77)90044-5openalex-snapshot
LCF considered as a programming language
inferredcites →https://doi.org/10.1016/0304-3975(80)90015-8openalex-snapshot
A mathematical semantics for a nondeterministic typed λ-calculus
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1109/sfcs.1977.1openalex-snapshot
A necessary and sufficient condition for the existence of hoare logics
inferredcites →https://doi.org/10.1137/0207005openalex-snapshot
Soundness and Completeness of an Axiom System for Program Verification
inferredcites →https://doi.org/10.1137/0209005openalex-snapshot
The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
inferredcites →https://doi.org/10.1145/322003.322016openalex-snapshot
Even Simple Programs Are Hard To Analyze
inferredcites →https://doi.org/10.1145/322108.322121openalex-snapshot
Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
inferredcites →https://doi.org/10.1145/357146.357150openalex-snapshot
Ten Years of Hoare's Logic: A Survey—Part I
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
inferredcites →https://doi.org/10.1145/512950.512952openalex-snapshot
Programming language constructs for which it is impossible to obtain good hoare-like axiom systems
inferredcites →https://doi.org/10.2307/2271658openalex-snapshot
Intensional interpretations of functionals of finite type I
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11601548openalex-snapshot
Processes, Terms and Cycles: Steps on the Road to Infinity
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_108openalex-snapshot
Aspects of programs with finite modes
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_362openalex-snapshot
A sound and relatively complete axiomatization of clarke's language L4
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_365openalex-snapshot
Reasoning about procedures as parameters
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_375openalex-snapshot
Hoare's logic for programs with procedures — What has been achieved?
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_382openalex-snapshot
From denotational to operational and axiomatic semantics for ALGOL-like languages: An overview
inferred← citeshttps://doi.org/10.1007/3-540-12920-0_7openalex-snapshot
On expressive interpretations of a Hoare-logic for Clarke's language L4
inferred← citeshttps://doi.org/10.1007/3-540-15648-8_9openalex-snapshot
A Hoare Calculus for functions defined by recursion on higher types
inferred← citeshttps://doi.org/10.1007/bf00264295openalex-snapshot
A sound and relatively complete Hoare-logic for a language with higher type procedures
inferred← citeshttps://doi.org/10.1007/bfb0015739openalex-snapshot
Towards a uniform topological treatment of streams and functions on streams
inferred← citeshttps://doi.org/10.1007/bfb0017156openalex-snapshot
Hoare calculi for higher — type control siructures and their completeness in the sense of cook
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90066-5openalex-snapshot
Correctness of programs with Pascal-like procedures without global variables
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/s0304-0208(08)73076-7openalex-snapshot
A New Transformational Approach to Partial Correctness Proof Calculi for Algol 6 8-Like Programs with Finite Modes and Simple Sideeffects
inferred← citeshttps://doi.org/10.1145/358728.358748openalex-snapshot
A critique of the foundations of Hoare style programming logics
inferred← citeshttps://doi.org/10.1184/r1/6610433openalex-snapshot
The Characterization Problem for Hoare Logics
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.