On the public citation graph

The case for structured programming

https://doi.org/10.1007/bf01933117

0 signed · 18 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/bf01932672openalex-snapshot

An experiment in structured programming

inferredcites →https://doi.org/10.1007/bf01946816openalex-snapshot

Programming by action clusters

inferredcites →https://doi.org/10.1145/357980.358010openalex-snapshot

Program development by stepwise refinement

inferredcites →https://doi.org/10.1145/362575.362577openalex-snapshot

Program development by stepwise refinement

inferredcites →https://doi.org/10.26153/tsw/53177openalex-snapshot

Notes on Structured Programming

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.4380060410openalex-snapshot

A review of design techniques for programs and data

inferred← citeshttps://doi.org/10.1007/978-1-84882-555-0_10openalex-snapshot

The Logic of Correctness in Software Engineering

inferred← citeshttps://doi.org/10.1007/978-3-642-67881-3_4openalex-snapshot

Abstraction and Refinement in RDM

inferred← citeshttps://doi.org/10.1007/978-3-642-95289-0_15openalex-snapshot

Änderungsfreundlichkeit Kommerzieller Anwendungsprogramme

inferred← citeshttps://doi.org/10.1016/0096-0551(87)90008-7openalex-snapshot

Logical programming for the telegram analysis problem

inferred← citeshttps://doi.org/10.1109/c-m.1981.220339openalex-snapshot

Tutorial Series 5 Software Design

inferred← citeshttps://doi.org/10.1109/proc.1980.11807openalex-snapshot

Software representation and composition techniques

inferred← citeshttps://doi.org/10.1109/tse.1976.233815openalex-snapshot

Observations of Fallibility in Applications of Modern Programming Methodologies

inferred← citeshttps://doi.org/10.1109/tse.1979.234163openalex-snapshot

Measuring Improvements in Program Clarity

inferred← citeshttps://doi.org/10.1109/tse.1982.234771openalex-snapshot

Using Annotations to Make Recursion Equations Behave

inferred← citeshttps://doi.org/10.1145/567446.567468openalex-snapshot

Theoretical and empirical studies on using program mutation to test the functional correctness of programs

inferred← citeshttps://doi.org/10.5555/800054.802006openalex-snapshot

Functional programming and logical programming for the telegram analysis problem

inferred← citeshttps://doi.org/10.5555/800254.807773openalex-snapshot

Data-driven implementation of data flow diagrams

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.