On the public citation graph

Higher-order probabilistic adversarial computations: categorical semantics and program logics

https://doi.org/10.1145/3473598
0 signed · 57 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-3-030-03332-3_9openalex-snapshot
State Separation for Code-Based Game-Playing Proofs
inferredcites →https://doi.org/10.1007/978-3-030-17127-8_22openalex-snapshot
A Sound and Complete Logic for Algebraic Effects
inferredcites →https://doi.org/10.1007/978-3-642-20465-4_27openalex-snapshot
Careful with Composition: Limitations of the Indifferentiability Framework
inferredcites →https://doi.org/10.1007/978-3-642-54792-8_8openalex-snapshot
Leakage Resilience against Concurrent Cache Attacks
inferredcites →https://doi.org/10.1007/978-3-662-46678-0_18openalex-snapshot
Step-Indexed Logical Relations for Probability
inferredcites →https://doi.org/10.1007/978-3-662-48899-7_27openalex-snapshot
Relational Reasoning via Probabilistic Coupling
inferredcites →https://doi.org/10.1007/978-3-662-49498-1_15openalex-snapshot
Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs
inferredcites →https://doi.org/10.1016/j.entcs.2010.08.005openalex-snapshot
Compositional System Security with Interface-Confined Adversaries
inferredcites →https://doi.org/10.1016/j.entcs.2016.09.043openalex-snapshot
Approximate Relational Hoare Logic for Continuous Random Samplings
inferredcites →https://doi.org/10.1016/j.entcs.2020.09.002openalex-snapshot
Weakest Preconditions in Fibrations
inferredcites →https://doi.org/10.1016/j.ic.2011.02.001openalex-snapshot
Probabilistic coherence spaces as a model of higher-order probabilistic computation
inferredcites →https://doi.org/10.1017/s0956796808006953openalex-snapshot
Hoare type theory, polymorphism and separation
inferredcites →https://doi.org/10.1109/csf.2015.38openalex-snapshot
A Logic of Programs with Interface-Confined Code
inferredcites →https://doi.org/10.1109/dsn.2015.21openalex-snapshot
The Power of Evil Choices in Bloom Filters
inferredcites →https://doi.org/10.1109/eurosp.2016.22openalex-snapshot
Reasoning about Object Capabilities with Logical Relations and Effect Parametricity
inferredcites →https://doi.org/10.1109/lics.2015.64openalex-snapshot
Metric reasoning about λ-terms: The affine case
inferredcites →https://doi.org/10.1109/lics.2017.8005137openalex-snapshot
A convenient category for higher-order probability theory
inferredcites →https://doi.org/10.1112/blms/6.1.115openalex-snapshot
CATEGORIES FOR THE WORKING MATHEMATICIAN
inferredcites →https://doi.org/10.1145/1480881.1480894openalex-snapshot
Formal certification of code-based cryptographic proofs
inferredcites →https://doi.org/10.1145/1866307.1866350openalex-snapshot
Computational indistinguishability logic
inferredcites →https://doi.org/10.1145/2103656.2103670openalex-snapshot
Probabilistic relational reasoning for differential privacy
inferredcites →https://doi.org/10.1145/229542.229547openalex-snapshot
Probabilistic predicate transformers
inferredcites →https://doi.org/10.1145/2491522.2491523openalex-snapshot
Dependent Type Theory for Verification of Information Flow and Access Control Policies
inferredcites →https://doi.org/10.1145/2535838.2535846openalex-snapshot
Parametric effect monads and semantics of effect systems
inferredcites →https://doi.org/10.1145/2535838.2535869openalex-snapshot
Abstract effects and proof-relevant logical relations
inferredcites →https://doi.org/10.1145/2578855.2535846openalex-snapshot
Parametric effect monads and semantics of effect systems
inferredcites →https://doi.org/10.1145/2578855.2535847openalex-snapshot
Probabilistic relational verification for cryptographic implementations
inferredcites →https://doi.org/10.1145/2578855.2535869openalex-snapshot
Abstract effects and proof-relevant logical relations
inferredcites →https://doi.org/10.1145/2676726.2676980openalex-snapshot
Iris
inferredcites →https://doi.org/10.1145/2976749.2978391openalex-snapshot
Advanced Probabilistic Couplings for Differential Privacy
inferredcites →https://doi.org/10.1145/3110265openalex-snapshot
A relational logic for higher-order programs
inferredcites →https://doi.org/10.1145/3158145openalex-snapshot
Proving expected sensitivity of probabilistic programs
inferredcites →https://doi.org/10.1145/3158148openalex-snapshot
Denotational validation of higher-order Bayesian inference
inferredcites →https://doi.org/10.1145/3290349openalex-snapshot
A domain theory for statistical probabilistic programming
inferredcites →https://doi.org/10.1145/3290351openalex-snapshot
Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization
inferredcites →https://doi.org/10.1145/3290377openalex-snapshot
A separation logic for concurrent randomized programs
inferredcites →https://doi.org/10.1145/3306193openalex-snapshot
Bloom Filters in Adversarial Environments
inferredcites →https://doi.org/10.1145/3319535.3354235openalex-snapshot
Probabilistic Data Structures in Adversarial Environments
inferredcites →https://doi.org/10.1145/3371072openalex-snapshot
The next 700 relational program logics
inferredcites →https://doi.org/10.1145/3434333openalex-snapshot
A pre-expectation calculus for probabilistic sensitivity
inferredcites →https://doi.org/10.1145/362686.362692openalex-snapshot
Space/time trade-offs in hash coding with allowable errors
inferredcites →https://doi.org/10.1145/73007.73012openalex-snapshot
Limits on the provable consequences of one-way permutations
inferredcites →https://doi.org/10.1145/800061.808758openalex-snapshot
A probabilistic PDL
inferredcites →https://doi.org/10.1215/ijm/1255631584openalex-snapshot
Borel structures for function spaces
inferredcites →https://doi.org/10.1561/0400000042openalex-snapshot
The Algorithmic Foundations of Differential Privacy
inferredcites →https://doi.org/10.23638/lmcs-14(4:6)2018openalex-snapshot
Codensity Lifting of Monads and its Dual

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-032-22720-1_15openalex-snapshot
A Category-Theoretic Framework for Dependent Effect Systems
inferred← citeshttps://doi.org/10.1007/978-981-97-8943-6_12openalex-snapshot
On Computational Indistinguishability and Logical Relations
inferred← citeshttps://doi.org/10.1007/978-981-97-8943-6_14openalex-snapshot
OBRA: Oracle-Based, Relational, Algorithmic Type Verification
inferred← citeshttps://doi.org/10.1145/3531130.3533370openalex-snapshot
Concrete categories and higher-order recursion
inferred← citeshttps://doi.org/10.1145/3547643openalex-snapshot
Safe couplings: coupled refinement types
inferred← citeshttps://doi.org/10.1145/3632868openalex-snapshot
Asynchronous Probabilistic Couplings in Higher-Order Separation Logic
inferred← citeshttps://doi.org/10.1145/3656414openalex-snapshot
Program Analysis for Adaptive Data Analysis
inferred← citeshttps://doi.org/10.1145/3661814.3662135openalex-snapshot
A Nominal Approach to Probabilistic Separation Logic
inferred← citeshttps://doi.org/10.1145/3674635openalex-snapshot
Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3674662openalex-snapshot
Automated Verification of Higher-Order Probabilistic Programs via a Dependent Refinement Type System
inferred← citeshttps://doi.org/10.1145/3704877openalex-snapshot
Approximate Relational Reasoning for Higher-Order 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.