On the public citation graph

A relational approach to the design of deterministic programs

0 signed · 43 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.1109/tse.1978.231499openalex-snapshot
The Logic of Computer Programming
inferredcites →https://doi.org/10.1145/360569.360659openalex-snapshot
The new math of computer programming
inferredcites →https://doi.org/10.2307/2268577openalex-snapshot
On the calculus of relations

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-47797-7_9openalex-snapshot
Temporal Algebra
inferred← citeshttps://doi.org/10.1007/3-540-50517-2_88openalex-snapshot
Relation level semantics
inferred← citeshttps://doi.org/10.1007/3-540-58233-9_4openalex-snapshot
Prototyping relational specifications using higher-order objects
inferred← citeshttps://doi.org/10.1007/3-540-60117-1_15openalex-snapshot
Program construction by parts
inferred← citeshttps://doi.org/10.1007/3-540-63531-9_22openalex-snapshot
Integration of sequential scenarios
inferred← citeshttps://doi.org/10.1007/978-3-030-32409-4_19openalex-snapshot
A Mechanized Theory of Program Refinement
inferred← citeshttps://doi.org/10.1007/978-3-540-27864-1_22openalex-snapshot
Approximating the Algebraic Relational Semantics of Imperative Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-77968-8_10openalex-snapshot
Programs: Correctness and Verification
inferred← citeshttps://doi.org/10.1007/bf00265990openalex-snapshot
Relational heuristics for the design of deterministic programs
inferred← citeshttps://doi.org/10.1007/bf00290145openalex-snapshot
Strongest invariant functions: Their use in the systematic analysis of while statements
inferred← citeshttps://doi.org/10.1007/bf01975517openalex-snapshot
Layered specifications to support reusability and integrability
inferred← citeshttps://doi.org/10.1007/bfb0039697openalex-snapshot
Predicative programming — A survey
inferred← citeshttps://doi.org/10.1007/s00224-014-9536-xopenalex-snapshot
On the Turing Completeness of the Semantic Web
inferred← citeshttps://doi.org/10.1016/0164-1212(87)90004-5openalex-snapshot
On the use of executable assertions in structured programs
inferred← citeshttps://doi.org/10.1016/0167-6423(92)90034-9openalex-snapshot
Heuristics for constructing while loops
inferred← citeshttps://doi.org/10.1016/0167-6423(93)90016-iopenalex-snapshot
On the mathematics of sequential decompositions
inferred← citeshttps://doi.org/10.1016/0167-6423(95)00033-xopenalex-snapshot
Functional algorithm design
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00271-jopenalex-snapshot
Embedding a demonic semilattice in a relation algebra
inferred← citeshttps://doi.org/10.1016/j.matcom.2005.11.007openalex-snapshot
Study of the diagnosability of automated production systems based on functional graphs
inferred← citeshttps://doi.org/10.1016/j.scico.2006.03.004openalex-snapshot
Polynomial approximations of the relational semantics of imperative programs
inferred← citeshttps://doi.org/10.1016/j.scico.2015.05.007openalex-snapshot
Implementability of requirements in the four-variable model
inferred← citeshttps://doi.org/10.1016/s0020-0255(96)00142-9openalex-snapshot
On fuzzy difunctional relations
inferred← citeshttps://doi.org/10.1016/s0020-0255(99)00012-2openalex-snapshot
Combining relational calculus and the Dijkstra–Gries method for deriving relational programs
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80880-6openalex-snapshot
Embedding Display Calculi into Logical Frameworks:
inferred← citeshttps://doi.org/10.1093/jigpal/jzi003openalex-snapshot
An Application of Logic Engineering
inferred← citeshttps://doi.org/10.1109/32.713325openalex-snapshot
Integration of sequential scenarios
inferred← citeshttps://doi.org/10.1109/icsi.1992.217261openalex-snapshot
Layered specifications to support reusability and integratibility
inferred← citeshttps://doi.org/10.1109/iwssd.1993.315503openalex-snapshot
Related specifications reuse
inferred← citeshttps://doi.org/10.1109/tse.1985.232523openalex-snapshot
Towards a Theory of Forward Error Recovery
inferred← citeshttps://doi.org/10.1109/tse.2016.2521379openalex-snapshot
Software Reliability Analysis Using Weakest Preconditions in Linear Assignment Programs
inferred← citeshttps://doi.org/10.1145/267895.267918openalex-snapshot
Integration of sequential scenarios
inferred← citeshttps://doi.org/10.1145/27632.28054openalex-snapshot
Formal models of stepwise refinements of programs
inferred← citeshttps://doi.org/10.1155/2014/140707openalex-snapshot
Relational Demonic Fuzzy Refinement
inferred← citeshttps://doi.org/10.20381/ruor-16472openalex-snapshot
A relational basis for program construction by parts.
inferred← citeshttps://doi.org/10.3934/dcdss.2015.8.1357openalex-snapshot
Nondeterministic semantics of compound diagrams
inferred← citeshttps://doi.org/10.4018/978-1-4666-4229-4.ch012openalex-snapshot
Demonic Fuzzy Relational Calculus
inferred← citeshttps://doi.org/10.4018/978-1-4666-7456-1.ch018openalex-snapshot
Demonic Fuzzy Relational Calculus
inferred← citeshttps://doi.org/10.5555/951807.951832openalex-snapshot
Related specifications reuse
inferred← citeshttps://doi.org/10.70675/4963a743z807fz43efzb17fz5f5ae5b8d77aopenalex-snapshot
Programmation impérative par raffinements avec l'assistant de preuve Coq
inferred← citeshttps://doi.org/10.82308/11817openalex-snapshot
Abstract relational semantics
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.