On the public citation graph

Quantitative strongest post: a calculus for reasoning about the flow of quantitative information

https://doi.org/10.1145/3527331
0 signed · 47 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-3228-5openalex-snapshot
Predicate Calculus and Program Semantics
inferredcites →https://doi.org/10.1007/978-3-030-25543-5_13openalex-snapshot
SecCSL: Security Concurrent Separation Logic
inferredcites →https://doi.org/10.1007/978-3-030-32304-2_19openalex-snapshot
Abstract Semantic Dependency
inferredcites →https://doi.org/10.1007/978-3-030-53291-8_14openalex-snapshot
Local Reasoning About the Presence of Bugs: Incorrectness Separation Logic
inferredcites →https://doi.org/10.1007/978-3-319-89884-1_24openalex-snapshot
An Abstract Interpretation Framework for Input Data Usage
inferredcites →https://doi.org/10.1007/978-3-540-27864-1_10openalex-snapshot
Information Flow Analysis in Logical Form
inferredcites →https://doi.org/10.1007/978-3-540-28644-8_4openalex-snapshot
Resources, Concurrency and Local Reasoning
inferredcites →https://doi.org/10.1007/978-3-642-00596-1_21openalex-snapshot
On the Foundations of Quantitative Information Flow
inferredcites →https://doi.org/10.1007/978-3-642-24690-6_12openalex-snapshot
Reverse Hoare Logic
inferredcites →https://doi.org/10.1007/978-3-642-35873-9_10openalex-snapshot
Automatic Inference of Necessary Preconditions
inferredcites →https://doi.org/10.1007/b138392openalex-snapshot
Abstraction, Refinement and Proof for Probabilistic Systems
inferredcites →https://doi.org/10.1007/bf00290146openalex-snapshot
General correctness: A unification of partial and total correctness
inferredcites →https://doi.org/10.1007/bf00291051openalex-snapshot
A calculus of refinements for program derivations
inferredcites →https://doi.org/10.1016/0022-0000(85)90012-1openalex-snapshot
A probabilistic PDL
inferredcites →https://doi.org/10.1016/0378-4754(79)90028-4openalex-snapshot
Flow analysis of computer programs
inferredcites →https://doi.org/10.1016/j.entcs.2020.09.002openalex-snapshot
Weakest Preconditions in Fibrations
inferredcites →https://doi.org/10.1017/s0022481200039578openalex-snapshot
Rudolf Carnap and Friedrich Bachmann. Über Extremalaxiome. Erkenntnis, vol. 6 (1936), pp. 166–188.
inferredcites →https://doi.org/10.1017/s0956796897002906openalex-snapshot
Trust in the λ-calculus
inferredcites →https://doi.org/10.1090/s0002-9947-1953-0053041-6openalex-snapshot
Classes of Recursively Enumerable Sets and Their Decision Problems
inferredcites →https://doi.org/10.1109/lics.2002.1029817openalex-snapshot
Separation logic: a logic for shared mutable data structures
inferredcites →https://doi.org/10.1109/lics52264.2021.9470608openalex-snapshot
A Logic for Locally Complete Abstract Interpretations
inferredcites →https://doi.org/10.1137/0207005openalex-snapshot
Soundness and Completeness of an Axiom System for Program Verification
inferredcites →https://doi.org/10.1145/3371078openalex-snapshot
Incorrectness logic
inferredcites →https://doi.org/10.1145/3428253openalex-snapshot
Perfectly parallel fairness certification of neural networks
inferredcites →https://doi.org/10.1145/3434320openalex-snapshot
Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning
inferredcites →https://doi.org/10.1145/360933.360975openalex-snapshot
Guarded commands, nondeterminacy and formal derivation of programs
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.2307/2325085openalex-snapshot
Two Notes on Notation
inferredcites →https://doi.org/10.4204/eptcs.330.11openalex-snapshot
Verifying Graph Programs with First-Order Logic
inferredcites →https://doi.org/10.48550/arxiv.1703.07682openalex-snapshot
A Weakest Pre-Expectation Semantics for Mixed-Sign Expectations
inferredcites →https://doi.org/10.48550/arxiv.1802.10467openalex-snapshot
Quantitative Separation Logic - A Logic for Reasoning about Probabilistic Programs
inferredcites →https://doi.org/10.48550/arxiv.2202.06765openalex-snapshot
Quantitative Strongest Post

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-031-90897-2_9openalex-snapshot
Quantifier Elimination and Craig Interpolation: The Quantitative Way
inferred← citeshttps://doi.org/10.1016/j.jss.2023.111798openalex-snapshot
Using expression parsing and algebraic operations to generate test sequences.
inferred← citeshttps://doi.org/10.1109/edm58354.2023.10225217openalex-snapshot
Development of Verification Condition Generator for Process-Oriented Programs in PoST Language
inferred← citeshttps://doi.org/10.1145/3527310openalex-snapshot
Weighted programming: a programming paradigm for specifying mathematical models
inferred← citeshttps://doi.org/10.1145/3586045openalex-snapshot
Outcome Logic: A Unifying Foundation for Correctness and Incorrectness Reasoning
inferred← citeshttps://doi.org/10.1145/3622870openalex-snapshot
A Deductive Verification Infrastructure for Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3632849openalex-snapshot
Calculational Design of [In]Correctness Transformational Program Logics by Abstract Interpretation
inferred← citeshttps://doi.org/10.1145/3689740openalex-snapshot
Quantitative Weakest Hyper Pre: Unifying Correctness and Incorrectness Hyperproperties via Predicate Transformers
inferred← citeshttps://doi.org/10.1145/3696355.3699706openalex-snapshot
Formal Specifications of Real-Time AUTOSAR-Compliant Operating Systems
inferred← citeshttps://doi.org/10.1145/3720486openalex-snapshot
Revealing Sources of (Memory) Errors via Backward Analysis
inferred← citeshttps://doi.org/10.1145/3743131openalex-snapshot
Outcome Logic: A Unified Approach to the Metatheory of Program Logics with Branching Effects
inferred← citeshttps://doi.org/10.18255/1818-1015-2023-3-214-233openalex-snapshot
Logic for reasoning about bugs in loops over data sequences (IFIL)
inferred← citeshttps://doi.org/10.46298/entics.12288openalex-snapshot
A Categorical Framework for Program Semantics and Semantic Abstraction
inferred← citeshttps://doi.org/10.70675/e25bcca0z1b66z4116z80eaz3397f4044ca3openalex-snapshot
Lifting Algebraic Reasoning to Generalized Metric Spaces
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.