On the public citation graph

Sound and complete Hoare-like calculi based on copy rules

https://doi.org/10.1007/bf00261258
0 signed · 78 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-06841-4_54openalex-snapshot
On the Most Recent Property of ALGOL-Like Programs
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/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-1-4612-4118-8_2openalex-snapshot
Revised Report on the Algorithmic Language Algol 60
inferredcites →https://doi.org/10.1007/978-3-540-37500-5openalex-snapshot
PASCAL User Manual and Report
inferredcites →https://doi.org/10.1007/bf00260921openalex-snapshot
Proof rules for the programming language Euclid
inferredcites →https://doi.org/10.1007/bf00264026openalex-snapshot
On correct procedure parameter transmission in higher programming languages
inferredcites →https://doi.org/10.1007/bf00288636openalex-snapshot
On procedures as open subroutines. II
inferredcites →https://doi.org/10.1007/bf00288746openalex-snapshot
Automatic program verification I: A logical basis and its implementation
inferredcites →https://doi.org/10.1007/bf00625282openalex-snapshot
On termination problems for finitely interpreted ALGOL-like programs
inferredcites →https://doi.org/10.1007/bf01386232openalex-snapshot
Recursive Programming
inferredcites →https://doi.org/10.1007/bfb0025364openalex-snapshot
Complementary Definitions of Programming Language Semantics
inferredcites →https://doi.org/10.1016/0304-3975(82)90027-5openalex-snapshot
Some natural structures which fail to possess a sound and decidable hoare-like logic for their while-programs
inferredcites →https://doi.org/10.1093/comjnl/20.2.151openalex-snapshot
Generic commands--a tool for partial correctness formalisms
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/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/357114.357119openalex-snapshot
Assignment and Procedure Call Proof Rules
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/358728.358748openalex-snapshot
A critique of the foundations of Hoare style programming logics
inferredcites →https://doi.org/10.1145/366193.366201openalex-snapshot
Revised report on the algorithmic language ALGOL 60
inferredcites →https://doi.org/10.1145/512760.512774openalex-snapshot
Unrestricted procedure calls in Hoare's logic
inferredcites →https://doi.org/10.1145/800105.803415openalex-snapshot
A complete axiomatic system for proving deductions about recursive programs
inferredcites →https://doi.org/10.1145/800235.807085openalex-snapshot
The “most recent” error
inferredcites →https://doi.org/10.1145/942580.807085openalex-snapshot
The “most recent” error
inferredcites →https://doi.org/10.22028/d291-26064openalex-snapshot
On a theorem of McGowan concerning the most recent property of programs

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11787006_31openalex-snapshot
Descriptive and Relative Completeness of Logics for Higher-Order Functions
inferred← citeshttps://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
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-16816-8_26openalex-snapshot
A fully abstract semantics and a proof system for an algol-like language with sharing
inferred← citeshttps://doi.org/10.1007/3-540-48167-2_10openalex-snapshot
Metatheory of Verification Calculi in LEGO
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-3-319-23506-6_2openalex-snapshot
Ernst-Rüdiger Olderog: A Life for Meaning
inferred← citeshttps://doi.org/10.1007/978-3-540-24773-9_3openalex-snapshot
An ALGOL-View on Turbo ASM
inferred← citeshttps://doi.org/10.1007/978-3-540-39993-3_12openalex-snapshot
Consistency of Inheritance in Object-Oriented Languages and of Static, ALGOL-like Binding
inferred← citeshttps://doi.org/10.1007/978-3-540-75221-9_19openalex-snapshot
On Revival of Algol-Concepts in Modern Programming and Specification Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-73405-2_4openalex-snapshot
Programmverifikation
inferred← citeshttps://doi.org/10.1007/978-3-662-01089-1_8openalex-snapshot
Hoare-Style Proof Systems and Formal Computations
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/bf00370552openalex-snapshot
Arithmetical completeness versus relative completeness
inferred← citeshttps://doi.org/10.1007/bf00625282openalex-snapshot
On termination problems for finitely interpreted ALGOL-like programs
inferred← citeshttps://doi.org/10.1007/bfb0025790openalex-snapshot
A critique of the foundations of Hoare-style programming logics
inferred← citeshttps://doi.org/10.1007/bfb0027046openalex-snapshot
Process theory: Semantics, specification and verification
inferred← citeshttps://doi.org/10.1007/s00165-019-00501-3openalex-snapshot
Fifty years of Hoare’s logic
inferred← citeshttps://doi.org/10.1007/s001650050057openalex-snapshot
Hoare Logic and Auxiliary Variables
inferred← citeshttps://doi.org/10.1007/s00287-010-0433-7openalex-snapshot
Dijkstras fruchtbarer, folgenreicher Irrtum
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(83)90009-9openalex-snapshot
On the notion of expressiveness and the rule of adaptation
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/0304-3975(91)90393-gopenalex-snapshot
A Hoare-like verification system for a language with an exception handling mechanism
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.tcs.2013.11.003openalex-snapshot
An observationally complete program logic for imperative higher-order functions
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.1109/32.277576openalex-snapshot
Modular verification of data abstractions with shared realizations
inferred← citeshttps://doi.org/10.1109/iccl.1998.674175openalex-snapshot
Formal callability and its relevance and application to interprocedural data-flow analysis
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/1086365.1086401openalex-snapshot
A logical analysis of aliasing in imperative higher-order functions
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/800017.800536openalex-snapshot
The semantics of local storage, or what makes the free-list free?(Preliminary Report)
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.1145/99583.99616openalex-snapshot
Parameter-passing and the lambda calculus
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.3233/fi-1996-281204openalex-snapshot
WHY DENOTATIONAL?
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.