On the public citation graph

A note on the for statement

https://doi.org/10.1007/bf01932305
0 signed · 51 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/978-94-011-1793-7_3openalex-snapshot
Proof of Algorithms by General Snapshots
inferredcites →https://doi.org/10.1007/bf00264291openalex-snapshot
The programming language pascal
inferredcites →https://doi.org/10.1007/bf01966091openalex-snapshot
Proof of algorithms by general snapshots
inferredcites →https://doi.org/10.1007/bf02163002openalex-snapshot
Report on the Algorithmic Language ALGOL 68
inferredcites →https://doi.org/10.1080/00963402.1965.11454793openalex-snapshot
Cleaning Up the Merrimack
inferredcites →https://doi.org/10.1090/psapm/019/0235771openalex-snapshot
Assigning meanings to programs
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/365696.365702openalex-snapshot
A contribution to the development of ALGOL

What points at this work

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

inferred← citeshttps://doi.org/10.1002/spe.4380150704openalex-snapshot
The robust implementation of sequence‐controlled iteration
inferred← citeshttps://doi.org/10.1007/3-540-06720-5_1openalex-snapshot
An axiomatic definition of the programming language PASCAL
inferred← citeshttps://doi.org/10.1007/3-540-07389-2_198openalex-snapshot
Control structures in single block programs
inferred← citeshttps://doi.org/10.1007/3-540-09745-7_3openalex-snapshot
Pascal versus C : A subjective comparison
inferred← citeshttps://doi.org/10.1007/3-540-12925-1_35openalex-snapshot
For statements with restricted enumerations
inferred← citeshttps://doi.org/10.1007/3-540-48118-4_29openalex-snapshot
Refinement semantics and loop rules
inferred← citeshttps://doi.org/10.1007/978-1-4612-4476-9_28openalex-snapshot
A Simple Program Whose Proof Isn’t
inferred← citeshttps://doi.org/10.1007/978-1-4612-5979-4_7openalex-snapshot
Abstraction and Verification in Alphard: Iteration and Generators
inferred← citeshttps://doi.org/10.1007/978-1-84882-555-0_9openalex-snapshot
The Algol Research Programme
inferred← citeshttps://doi.org/10.1007/978-1-84882-912-1_1openalex-snapshot
Insight, Inspiration and Collaboration
inferred← citeshttps://doi.org/10.1007/978-3-030-02928-9_6openalex-snapshot
Challenges for Formal Semantic Description: Responses from the Main Approaches
inferred← citeshttps://doi.org/10.1007/978-3-540-49020-3_12openalex-snapshot
Verification of Definite Iteration over Hierarchical Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_29openalex-snapshot
Symbolic Verification Method for Definite Iterations over Tuples of Altered Data Structures and Its Application to Pointer Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-59412-0_22openalex-snapshot
Assertions: A Personal Perspective
inferred← citeshttps://doi.org/10.1007/978-3-642-60831-5_72openalex-snapshot
Zum Nutzen sequentieller Kontrollabstraktionen
inferred← citeshttps://doi.org/10.1007/bf00289243openalex-snapshot
Language design methods based on semantic principles
inferred← citeshttps://doi.org/10.1007/bf00289504openalex-snapshot
An axiomatic definition of the programming language PASCAL
inferred← citeshttps://doi.org/10.1007/bf01070556openalex-snapshot
Proof of regularity of for loop operators
inferred← citeshttps://doi.org/10.1007/bf01932023openalex-snapshot
Source program optimization with a generalized FOR statement
inferred← citeshttps://doi.org/10.1007/bf02733424openalex-snapshot
Verification of a finite iteration over data structures
inferred← citeshttps://doi.org/10.1016/0096-0551(75)90016-8openalex-snapshot
Some steps towards a better PASCAL
inferred← citeshttps://doi.org/10.1016/0096-0551(78)90008-5openalex-snapshot
A proposal for a generalized “FOR” statement
inferred← citeshttps://doi.org/10.1016/0164-1212(93)90108-aopenalex-snapshot
An empirical study of iteration in applications software
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.11.008openalex-snapshot
Mechanical inference of invariants for FOR-loops
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00009-5openalex-snapshot
Symbolic verification method for definite iteration over data structures
inferred← citeshttps://doi.org/10.1023/a:1013775931594openalex-snapshot
Verification of Finite Iterations over Tuples of Data Structures
inferred← citeshttps://doi.org/10.1109/32.391377openalex-snapshot
Verifying definite iteration over data structures
inferred← citeshttps://doi.org/10.1109/mahc.2003.1203056openalex-snapshot
Assertions: a personal perspective
inferred← citeshttps://doi.org/10.1109/tse.1976.233834openalex-snapshot
Control Structure Abstractions of the Backtracking Programming Technique
inferred← citeshttps://doi.org/10.1145/251634.251638openalex-snapshot
Proving assertions is also useful
inferred← citeshttps://doi.org/10.1145/3477355.3477375openalex-snapshot
List of Tony Hoare’s Publications
inferred← citeshttps://doi.org/10.1145/356635.356640openalex-snapshot
Structured Programming with go to Statements
inferred← citeshttps://doi.org/10.1145/359104.359110openalex-snapshot
Reasoning about arrays
inferred← citeshttps://doi.org/10.1145/359605.359624openalex-snapshot
Some ideas on data types in high-level languages
inferred← citeshttps://doi.org/10.1145/359763.359782openalex-snapshot
Abstraction and verification in Alphard
inferred← citeshttps://doi.org/10.1145/382196.382997openalex-snapshot
Structured programming, programming teaching and the language Pascal
inferred← citeshttps://doi.org/10.1145/512976.512997openalex-snapshot
Structured exception handling
inferred← citeshttps://doi.org/10.1145/800176.809968openalex-snapshot
Data abstraction, controlled iteration, and communicating processes
inferred← citeshttps://doi.org/10.1145/800182.810402openalex-snapshot
A method to expose the hidden structure of Fortran programs
inferred← citeshttps://doi.org/10.1145/953224.953226openalex-snapshot
Structured programming, programming teaching and the language Pascal
inferred← citeshttps://doi.org/10.1145/954618.954620openalex-snapshot
Ordered types and a generalized for statement
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.72.1014.1003openalex-snapshot
Loop Patterns in C Programs
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.