On the public citation graph
Proof rules for recursive procedures
0 signed · 24 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/978-1-4612-3228-5openalex-snapshot
Predicate Calculus and Program Semantics
inferredcites →https://doi.org/10.1007/978-1-4684-0261-2openalex-snapshot
Pascal User Manual and Report
inferredcites →https://doi.org/10.1007/bf00289091openalex-snapshot
do considered od: A contribution to the programming calculus
inferredcites →https://doi.org/10.1007/bf01888217openalex-snapshot
Command algebras, recursion and program transformation
inferredcites →https://doi.org/10.1007/bf02277666openalex-snapshot
On-the-fly garbage collection for several mutators
inferredcites →https://doi.org/10.1007/bfb0059696openalex-snapshot
Procedures and parameters: An axiomatic approach
inferredcites →https://doi.org/10.1016/s0020-0190(05)80010-9openalex-snapshot
Repetitions, known or unknown?
inferredcites →https://doi.org/10.1017/cbo9780511569784openalex-snapshot
Programs, Recursion and Unbounded Choice
inferredcites →https://doi.org/10.7907/desx8-jhv04openalex-snapshot
A General Proof Rule for Procedures in Predicate Transformer Semantics
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-60117-1_18openalex-snapshot
Angelic termination in Dijkstra's calculus
inferred← citeshttps://doi.org/10.1007/978-3-030-11245-5_22openalex-snapshot
Termination of Nondeterministic Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-63387-9_6openalex-snapshot
Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_3openalex-snapshot
Non-polynomial Worst-Case Analysis of Recursive Programs
inferred← citeshttps://doi.org/10.1007/bf01211215openalex-snapshot
Safety and progress of recursive procedures
inferred← citeshttps://doi.org/10.1007/bfb0030642openalex-snapshot
COMPASS: A comprehensible assertion method
inferred← citeshttps://doi.org/10.1007/s001659970002openalex-snapshot
Predicate Transformers for Recursive Procedures with Local Variables
inferred← citeshttps://doi.org/10.1017/9781108770750.008openalex-snapshot
Termination Analysis of Probabilistic Programs with Martingales
inferred← citeshttps://doi.org/10.1145/2933575.2935317openalex-snapshot
Reasoning about Recursive Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3208102openalex-snapshot
Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms
inferred← citeshttps://doi.org/10.1145/3290347openalex-snapshot
Quantitative separation logic: a logic for reasoning about probabilistic pointer programs
inferred← citeshttps://doi.org/10.1145/3314221.3314581openalex-snapshot
Cost analysis of nondeterministic probabilistic programs
inferred← citeshttps://doi.org/10.1145/3360555openalex-snapshot
Modular verification for almost-sure termination of probabilistic programs
inferred← citeshttps://doi.org/10.48550/arxiv.1603.02922openalex-snapshot
Reasoning about Recursive Probabilistic Programs
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.