On the public citation graph

On termination problems for finitely interpreted ALGOL-like programs

https://doi.org/10.1007/bf00625282
0 signed · 52 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-06666-7_39openalex-snapshot
Zum Begriff Der Modularität Von Programmiersprachen
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-08860-1_14openalex-snapshot
On the power of self-application and higher type recursion
inferredcites →https://doi.org/10.1007/3-540-09237-4openalex-snapshot
First-Order Dynamic Logic
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_79openalex-snapshot
On observing nondeterminism and concurrency
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-1-4613-8928-6_19openalex-snapshot
Regular Canonical Systems
inferredcites →https://doi.org/10.1007/978-3-540-37500-5openalex-snapshot
PASCAL User Manual and Report
inferredcites →https://doi.org/10.1007/978-3-642-86937-2openalex-snapshot
Handbook for Automatic Computation
inferredcites →https://doi.org/10.1007/bf00261258openalex-snapshot
Sound and complete Hoare-like calculi based on copy rules
inferredcites →https://doi.org/10.1007/bf00264026openalex-snapshot
On correct procedure parameter transmission in higher programming languages
inferredcites →https://doi.org/10.1007/bf00265077openalex-snapshot
Revised report on the algorithmic language ALGOL 68
inferredcites →https://doi.org/10.1007/bf00288636openalex-snapshot
On procedures as open subroutines. II
inferredcites →https://doi.org/10.1007/bf00289503openalex-snapshot
On procedures as open subroutines. I
inferredcites →https://doi.org/10.1007/bf01386216openalex-snapshot
Report on the algorithmic language ALGOL 60
inferredcites →https://doi.org/10.1007/bf01386232openalex-snapshot
Recursive Programming
inferredcites →https://doi.org/10.1007/bf01386340openalex-snapshot
Revised report on the algorithmic languageAlgol 60
inferredcites →https://doi.org/10.1007/bf01969548openalex-snapshot
Regular canonical systems
inferredcites →https://doi.org/10.1016/0020-0190(79)90058-9openalex-snapshot
The formal termination problem for programs with finite ALGOL 68-modes
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/2402.322394openalex-snapshot
Effective Axiomatizations of Hoare Logics
inferredcites →https://doi.org/10.1145/321371.321385openalex-snapshot
Stack automata and compiling
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/360933.360975openalex-snapshot
Guarded commands, nondeterminacy and formal derivation of programs
inferredcites →https://doi.org/10.1145/582153.582186openalex-snapshot
On effective axiomatizations of Hoare logics
inferredcites →https://doi.org/10.1145/800235.807085openalex-snapshot
The “most recent” error
inferredcites →https://doi.org/10.1145/942578.807085openalex-snapshot
The “most recent” error
inferredcites →https://doi.org/10.1145/942580.807085openalex-snapshot
The “most recent” error

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_375openalex-snapshot
Hoare's logic for programs with procedures — What has been achieved?
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/978-3-540-24773-9_3openalex-snapshot
An ALGOL-View on Turbo ASM
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/bf00261258openalex-snapshot
Sound and complete Hoare-like calculi based on copy rules
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/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.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/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/iccl.1998.674175openalex-snapshot
Formal callability and its relevance and application to interprocedural data-flow analysis
inferred← citeshttps://doi.org/10.1109/lics.1991.151636openalex-snapshot
Complexity bounds of Hoare-style proof systems
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/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
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.