On the public citation graph

A sound and relatively complete Hoare-logic for a language with higher type procedures

https://doi.org/10.1007/bf00264295
0 signed · 63 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-09541-1_38openalex-snapshot
On a theory of decision problems in programming languages
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-01089-1_8openalex-snapshot
Hoare-Style Proof Systems and Formal Computations
inferredcites →https://doi.org/10.1007/bf00261258openalex-snapshot
Sound and complete Hoare-like calculi based on copy rules
inferredcites →https://doi.org/10.1007/bf00288636openalex-snapshot
On procedures as open subroutines. II
inferredcites →https://doi.org/10.1007/bf00625282openalex-snapshot
On termination problems for finitely interpreted ALGOL-like programs
inferredcites →https://doi.org/10.1007/bfb0025776openalex-snapshot
Correctness of programs with function procedures
inferredcites →https://doi.org/10.1016/0304-3975(82)90009-3openalex-snapshot
The IO- and OI-hierarchies
inferredcites →https://doi.org/10.1016/0304-3975(84)90066-5openalex-snapshot
Correctness of programs with Pascal-like procedures without global variables
inferredcites →https://doi.org/10.1016/s0049-237x(08)71129-7openalex-snapshot
The Type Free Lambda Calculus
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.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
inferredcites →https://doi.org/10.1145/322047.322062openalex-snapshot
A New Incompleteness Result for Hoare's System
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

What points at this work

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

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_360openalex-snapshot
Characterization of acceptable by algol-like programming languages
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_25openalex-snapshot
A partial correctness logic for procedures
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/3-540-51237-3_12openalex-snapshot
A dynamic logic for program verification
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_62openalex-snapshot
A calculus for higher order procedures with global variables
inferred← citeshttps://doi.org/10.1007/978-1-4757-3851-3_4openalex-snapshot
Semantical Analysis of Specification Logic, 2
inferred← citeshttps://doi.org/10.1007/978-3-030-45260-5_1openalex-snapshot
On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics
inferred← citeshttps://doi.org/10.1007/978-3-031-08166-8_15openalex-snapshot
Further Lessons from the JML Project
inferred← citeshttps://doi.org/10.1007/978-3-319-47169-3_7openalex-snapshot
Specifying and Verifying Advanced Control Features
inferred← citeshttps://doi.org/10.1007/978-3-642-73405-2_4openalex-snapshot
Programmverifikation
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.1007/s00165-019-00501-3openalex-snapshot
Fifty years of Hoare’s logic
inferred← citeshttps://doi.org/10.1007/s00287-010-0446-2openalex-snapshot
Dijkstras fruchtbarer, folgenreicher Irrtum
inferred← citeshttps://doi.org/10.1007/s00287-010-0466-yopenalex-snapshot
Dijkstras fruchtbarer, folgenreicher Irrtum
inferred← citeshttps://doi.org/10.1007/s00287-012-0627-2openalex-snapshot
Turing und die Verifikation
inferred← citeshttps://doi.org/10.1016/0096-0551(91)90010-7openalex-snapshot
Modular verification of Ada generics
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/0890-5401(89)90040-0openalex-snapshot
Reasoning about procedures as parameters in the language L4
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.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.2013.09.005openalex-snapshot
Computational contracts
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.1016/s0167-6423(00)00005-8openalex-snapshot
Predicate transformer semantics of a higher-order imperative language with record subtyping
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.1098/rsta.1984.0068openalex-snapshot
The characterization problem for Hoare logics
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.1145/1297027.1297053openalex-snapshot
Modular verification of higher-order methods with mandatory calls specified by model programs
inferred← citeshttps://doi.org/10.1145/1297105.1297053openalex-snapshot
Modular verification of higher-order methods with mandatory calls specified by model programs
inferred← citeshttps://doi.org/10.1145/2429069.2429081openalex-snapshot
Automating relatively complete verification of higher-order functional programs
inferred← citeshttps://doi.org/10.1145/2480359.2429081openalex-snapshot
Automating relatively complete verification of higher-order functional programs
inferred← citeshttps://doi.org/10.1145/3158100openalex-snapshot
Relatively complete refinement type system for verification of higher-order non-deterministic programs
inferred← citeshttps://doi.org/10.1145/3477143openalex-snapshot
Completeness and Complexity of Reasoning about Call-by-Value in Hoare Logic
inferred← citeshttps://doi.org/10.1145/3477355.3477359openalex-snapshot
Assessing the Success and Impact of Hoare’s Logic
inferred← citeshttps://doi.org/10.1145/800017.800538openalex-snapshot
A good Hoare axiom system for an ALGOL-like language
inferred← citeshttps://doi.org/10.1145/800061.808761openalex-snapshot
A characterization of Hoare's logic for programs with Pascal-like procedures
inferred← citeshttps://doi.org/10.1184/r1/6610433openalex-snapshot
The Characterization Problem for Hoare Logics
inferred← citeshttps://doi.org/10.22028/d291-26480openalex-snapshot
A partial correctness logic for procedures (in an ALGOL-like language)
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.48550/arxiv.1909.06215openalex-snapshot
Reasoning about call-by-value: a missing result in the history of Hoare's logic
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.