On the public citation graph
A simple fixpoint argument without the restriction to continuity
0 signed · 39 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-10007-5_47openalex-snapshot
On the semantics of fair parallelism
inferredcites →https://doi.org/10.1007/bf00289263openalex-snapshot
Proving total correctness of nondeterministic programs in infinitary logic
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
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.1090/psapm/019/0235771openalex-snapshot
Assigning meanings to programs
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications
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-45793-3_9openalex-snapshot
A Fixpoint Theory for Non-monotonic Parallelism
inferred← citeshttps://doi.org/10.1007/3-540-48118-4_29openalex-snapshot
Refinement semantics and loop rules
inferred← citeshttps://doi.org/10.1007/3-540-51305-1_1openalex-snapshot
A formal approach to large SOFTWARE CONSTRUCTION
inferred← citeshttps://doi.org/10.1007/3-540-51305-1_8openalex-snapshot
A lattice-theoretical basis for a specification language
inferred← citeshttps://doi.org/10.1007/978-1-4471-3240-0_7openalex-snapshot
Program Refinement by Theorem Prover
inferred← citeshttps://doi.org/10.1007/978-1-4471-3550-0_10openalex-snapshot
Constructive Refinement of First Order Specifications
inferred← citeshttps://doi.org/10.1007/978-3-031-34518-0_9openalex-snapshot
A Personal Historical Perspective on Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-642-34679-8_8openalex-snapshot
A Self-stabilizing Algorithm for Finding a Minimal K-Dominating Set in General Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-53917-6_11openalex-snapshot
Minimising K-Dominating Set in Arbitrary Network Graphs
inferred← citeshttps://doi.org/10.1007/978-94-017-2809-6_8openalex-snapshot
Optical Analyses of Arenites: Influence of Methodology on Compositional Results
inferred← citeshttps://doi.org/10.1007/bf00259469openalex-snapshot
Duality in specification languages: a lattice-theoretical approach
inferred← citeshttps://doi.org/10.1007/bf00276020openalex-snapshot
Predicate-transformer semantics of general recursion
inferred← citeshttps://doi.org/10.1007/bf00291051openalex-snapshot
A calculus of refinements for program derivations
inferred← citeshttps://doi.org/10.1007/bf01213603openalex-snapshot
The weakest precondition calculus: Recursion and duality
inferred← citeshttps://doi.org/10.1007/bf01237234openalex-snapshot
Properties of data flow frameworks
inferred← citeshttps://doi.org/10.1007/bf01888227openalex-snapshot
Refinement concepts formalised in higher order logic
inferred← citeshttps://doi.org/10.1007/bf02939477openalex-snapshot
Two new strategies for developing loop invariants and their applications
inferred← citeshttps://doi.org/10.1007/s001659970002openalex-snapshot
Predicate Transformers for Recursive Procedures with Local Variables
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90017-3openalex-snapshot
Well-founded induction and the invariance theorem for loops
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50020-2openalex-snapshot
Methods and Logics for Proving Programs
inferred← citeshttps://doi.org/10.1016/j.energy.2024.131281openalex-snapshot
Research on station-network planning of electricity-thermal -cooling regional integrated energy system considering multiple-load clusters and network costs
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00313-3openalex-snapshot
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00893-9openalex-snapshot
A fixpoint theory for non-monotonic parallelism
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80168-9openalex-snapshot
Constructive Design of a Hierarchy of Semantics of a Transition System by Abstract Interpretation (Extended Abstract)
inferred← citeshttps://doi.org/10.1080/01445340.2015.1054576openalex-snapshot
Continuity in Semantic Theories of Programming
inferred← citeshttps://doi.org/10.1109/cscwd.2013.6581012openalex-snapshot
A self-stabilizing protocol for minimal weighted dominating sets in arbitrary networks
inferred← citeshttps://doi.org/10.1164/ajrccm/142.5.1063openalex-snapshot
Failure of High-Dose Vitamin E to Correct Ceruloplasmin Ferroxidase Deficiency in Cigarette Smokers
inferred← citeshttps://doi.org/10.1515/mammalia-2012-0038openalex-snapshot
Habitat-population density relationship for the white-tailed deer Odocoileus virginianus during the dry season in a Pacific Mexican tropical dry forest
inferred← citeshttps://doi.org/10.2478/romneu-2013-0010openalex-snapshot
Surgical decompression of arachnoid cysts: a study on 44 pediatric patients
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.