On the public citation graph

Relational heuristics for the design of deterministic programs

0 signed · 59 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-1-4612-5983-1openalex-snapshot
The Science of Programming
inferredcites →https://doi.org/10.1007/978-3-540-37500-5openalex-snapshot
PASCAL User Manual and Report
inferredcites →https://doi.org/10.1007/bf00264277openalex-snapshot
A relational approach to the design of deterministic programs
inferredcites →https://doi.org/10.1016/0012-365x(83)90015-8openalex-snapshot
Discrete ordering relations
inferredcites →https://doi.org/10.1016/0020-0190(83)90056-xopenalex-snapshot
Verifying programs by induction on their data structure: General format and applications
inferredcites →https://doi.org/10.1016/0096-0551(83)90036-xopenalex-snapshot
Denotational semantics: The scott-strachey approach to programming language theory
inferredcites →https://doi.org/10.1016/s0016-6995(88)80026-3openalex-snapshot
Thèse de doctorat d'Etat
inferredcites →https://doi.org/10.1109/ms.1985.229776openalex-snapshot
On Formalism in Specifications
inferredcites →https://doi.org/10.1109/tse.1975.6312822openalex-snapshot
Proving loop programs
inferredcites →https://doi.org/10.1109/tse.1978.231499openalex-snapshot
The Logic of Computer Programming
inferredcites →https://doi.org/10.1109/tse.1984.5010236openalex-snapshot
A Heuristic for Deriving Loop Functions
inferredcites →https://doi.org/10.1145/2363.2708openalex-snapshot
Generalizing specifications for uniformly implemented loops
inferredcites →https://doi.org/10.1145/356876.356881openalex-snapshot
A Comparative Analysis of Functional Correctness
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/360569.360659openalex-snapshot
The new math of computer programming
inferredcites →https://doi.org/10.1145/360933.360975openalex-snapshot
Guarded commands, nondeterminacy and formal derivation of programs
inferredcites →https://doi.org/10.2307/2183000openalex-snapshot
Axiomatic Set Theory.
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-45499-3_26openalex-snapshot
Kleene under a Demonic Star
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-63531-9_22openalex-snapshot
Integration of sequential scenarios
inferred← citeshttps://doi.org/10.1007/978-0-387-35264-0_9openalex-snapshot
Defining and Detecting Feature Interactions
inferred← citeshttps://doi.org/10.1007/978-1-4471-3536-4_11openalex-snapshot
Design-Aspects supporting Software Re-use
inferred← citeshttps://doi.org/10.1007/978-3-319-12307-3_65openalex-snapshot
Nondeterministic Fuzzy Operators
inferred← citeshttps://doi.org/10.1007/978-3-540-39737-3_22openalex-snapshot
Demonic I/O of Compound Diagrams Monotype/Residual Style
inferred← citeshttps://doi.org/10.1007/978-3-7091-7553-8_26openalex-snapshot
A Database of Software Components: An Algebraic Structure and Its Implementation
inferred← citeshttps://doi.org/10.1007/bf01211474openalex-snapshot
On the lattice of specifications: Applications to a specification methodology
inferred← citeshttps://doi.org/10.1007/bf01975517openalex-snapshot
Layered specifications to support reusability and integrability
inferred← citeshttps://doi.org/10.1007/s00012-021-00718-5openalex-snapshot
Finite representability of semigroups with demonic refinement
inferred← citeshttps://doi.org/10.1007/s11334-012-0189-0openalex-snapshot
Invariant relations, invariant functions, and loop functions
inferred← citeshttps://doi.org/10.1016/0020-0255(93)90056-ropenalex-snapshot
Relation-based semantics for concurrency
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/0304-3975(91)90335-yopenalex-snapshot
Regularity of relations: A measure of uniformity
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90074-4openalex-snapshot
A relational division operator: the conjugate kernel
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.jlap.2005.04.006openalex-snapshot
Kleene under a modal demonic star
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.11.007openalex-snapshot
Reflexive transitive invariant relations: A basis for computing loop functions
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(99)00012-2openalex-snapshot
Combining relational calculus and the Dijkstra–Gries method for deriving relational programs
inferred← citeshttps://doi.org/10.1063/1.4757512openalex-snapshot
Nondeterministic fuzzy operators
inferred← citeshttps://doi.org/10.1090/s0025-5718-98-01004-7openalex-snapshot
A sweep-plane algorithm for generating random tuples in simple polytopes
inferred← citeshttps://doi.org/10.1109/32.713325openalex-snapshot
Integration of sequential scenarios
inferred← citeshttps://doi.org/10.1109/icc.2009.15openalex-snapshot
Demonic Semantics and Fixed Points
inferred← citeshttps://doi.org/10.1109/icsi.1992.217261openalex-snapshot
Layered specifications to support reusability and integratibility
inferred← citeshttps://doi.org/10.1109/icst.2016.12openalex-snapshot
Debugging without Testing
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470509openalex-snapshot
Demonic Lattices and Semilattices in Relational Semigroups with Ordinary Composition
inferred← citeshttps://doi.org/10.1109/sesd.1999.781109openalex-snapshot
Applying a generalization of a theorem of Mills to generalized looping structures
inferred← citeshttps://doi.org/10.1145/267895.267918openalex-snapshot
Integration of sequential scenarios
inferred← citeshttps://doi.org/10.1155/s016117120420415xopenalex-snapshot
Demonic semantics: using monotypes and residuals
inferred← citeshttps://doi.org/10.20381/ruor-16472openalex-snapshot
A relational basis for program construction by parts.
inferred← citeshttps://doi.org/10.24297/jam.v3i3.7222openalex-snapshot
Nondeterministic Relational Semantics of a while Program
inferred← citeshttps://doi.org/10.29007/zhz4openalex-snapshot
A Comparative Study of Invariant Assertions, Invariant Relations, and Invariant Functions
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.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.