On the public citation graph

Structure and meaning of elementary programs

https://doi.org/10.1007/bfb0059695
0 signed · 33 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/malq.19780241202openalex-snapshot
Kanonische Abbildungen und Eilenberg‐Maschinen
inferred← citeshttps://doi.org/10.1002/mana.19790900120openalex-snapshot
Beitrag zur algebraischen Rekursionstheorie
inferred← citeshttps://doi.org/10.1007/3-540-06720-5_15openalex-snapshot
Data flow schemas
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-08353-7_126openalex-snapshot
Finite automaton from a flowchart scheme point of view
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_187openalex-snapshot
Formal methods and social context in software development
inferred← citeshttps://doi.org/10.1007/978-1-4613-8177-8_7openalex-snapshot
On the Algebraic Structure of Rooted Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-95597-1_6openalex-snapshot
A Model-Driven and Generative Approach to Holistic Security
inferred← citeshttps://doi.org/10.1007/978-3-642-66319-2_20openalex-snapshot
Mathematical Theory of Serial Computers
inferred← citeshttps://doi.org/10.1007/978-94-010-1138-9_13openalex-snapshot
Basic Concepts of Computer Science and Logic
inferred← citeshttps://doi.org/10.1007/bf00289078openalex-snapshot
Fast algorithms for the elimination of common subexpressions
inferred← citeshttps://doi.org/10.1007/bf02246433openalex-snapshot
Function iteration logics and flowchart schemata
inferred← citeshttps://doi.org/10.1007/bfb0022509openalex-snapshot
On and/or schemes
inferred← citeshttps://doi.org/10.1007/s11334-008-0071-2openalex-snapshot
Genesys: service-oriented construction of property conform code generators
inferred← citeshttps://doi.org/10.1016/0012-365x(77)90074-7openalex-snapshot
Extensions of rooted trees and their applications
inferred← citeshttps://doi.org/10.1016/s0019-9958(74)90766-9openalex-snapshot
Unique-entry graphs, flowcharts, and state diagrams
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80057-6openalex-snapshot
Nontrivial definability by flow-chart programs
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80002-4openalex-snapshot
Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)
inferred← citeshttps://doi.org/10.1016/s0022-0000(71)80008-9openalex-snapshot
Algorithmic approximations
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71950-5openalex-snapshot
On the Solvability of Algorithmic Problems
inferred← citeshttps://doi.org/10.1093/comjnl/25.3.379openalex-snapshot
Unravelling Unstructured Programs
inferred← citeshttps://doi.org/10.1109/52.566430openalex-snapshot
Formal methods: promises and problems
inferred← citeshttps://doi.org/10.1109/dtis.2017.7930157openalex-snapshot
Securing C/C++ applications with a SEcube™-based model-driven approach
inferred← citeshttps://doi.org/10.1109/ease.2007.17openalex-snapshot
Model Driven Design of Reliable Robot Control Programs Using the jABC
inferred← citeshttps://doi.org/10.1109/swat.1972.1openalex-snapshot
A fast algorithm for the elimination of common subexpressions
inferred← citeshttps://doi.org/10.1109/swat.1972.20openalex-snapshot
Representing program schemes in logic
inferred← citeshttps://doi.org/10.1137/0201014openalex-snapshot
Flow Graph Reducibility
inferred← citeshttps://doi.org/10.1137/0204011openalex-snapshot
Translating Program Schemas to While-Schemas
inferred← citeshttps://doi.org/10.1145/1008861.1008869openalex-snapshot
On folk theorems
inferred← citeshttps://doi.org/10.1145/358886.358892openalex-snapshot
On folk theorems
inferred← citeshttps://doi.org/10.1145/800105.803417openalex-snapshot
On the theory of programming logics
inferred← citeshttps://doi.org/10.1145/800152.804919openalex-snapshot
Flow graph reducibility
inferred← citeshttps://doi.org/10.1145/954127.954131openalex-snapshot
What is a flowchart loop and about structured programming
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.