On the public citation graph
The next 700 relational program logics
0 signed · 130 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/11547662_24openalex-snapshot
Secure Information Flow as a Safety Problem
inferredcites →https://doi.org/10.1007/11783596_6openalex-snapshot
Proofs of Randomized Algorithms in Coq
inferredcites →https://doi.org/10.1007/11863908_18openalex-snapshot
From Coupling Relations to Mated Invariants for Checking Information Flow
inferredcites →https://doi.org/10.1007/3-540-45931-6_24openalex-snapshot
Notions of Computation Determine Monads
inferredcites →https://doi.org/10.1007/978-3-030-25540-4_11openalex-snapshot
Automated Hypersafety Verification
inferredcites →https://doi.org/10.1007/978-3-319-24953-7_6openalex-snapshot
A Mechanically Checked Generation of Correlating Programs Directed by Structured Syntactic Differences
inferredcites →https://doi.org/10.1007/978-3-319-30936-1_3openalex-snapshot
Counting Successes: Effects and Transformations for Non-deterministic Programs
inferredcites →https://doi.org/10.1007/978-3-319-89884-1_18openalex-snapshot
Modular Product Programs
inferredcites →https://doi.org/10.1007/978-3-540-68237-0_5openalex-snapshot
CoVaC: Compiler Validation by Program Analysis of the Cross-Product
inferredcites →https://doi.org/10.1007/978-3-642-00590-9_7openalex-snapshot
Handlers of Algebraic Effects
inferredcites →https://doi.org/10.1007/978-3-642-04027-6_33openalex-snapshot
A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References
inferredcites →https://doi.org/10.1007/978-3-642-13754-9_8openalex-snapshot
Inference Rules for Proving the Equivalence of Recursive Procedures
inferredcites →https://doi.org/10.1007/978-3-642-31424-7_54openalex-snapshot
SYMDIFF: A Language-Agnostic Semantic Diff Tool for Imperative Programs
inferredcites →https://doi.org/10.1007/978-3-642-38946-7_6openalex-snapshot
Proof-Relevant Logical Relations for Name Generation
inferredcites →https://doi.org/10.1007/978-3-662-46666-7_4openalex-snapshot
The Foundational Cryptography Framework
inferredcites →https://doi.org/10.1007/978-3-662-48899-7_27openalex-snapshot
Relational Reasoning via Probabilistic Coupling
inferredcites →https://doi.org/10.1007/s00165-014-0319-6openalex-snapshot
Program equivalence by circular reasoning
inferredcites →https://doi.org/10.1007/s00165-016-0361-7openalex-snapshot
A language-independent proof system for full program equivalence
inferredcites →https://doi.org/10.1007/s10817-017-9421-9openalex-snapshot
Verifying Relative Safety, Accuracy, and Termination for Program Approximations
inferredcites →https://doi.org/10.1016/0022-4049(72)90019-9openalex-snapshot
The formal theory of monads
inferredcites →https://doi.org/10.1016/j.jlamp.2016.05.004openalex-snapshot
Product programs and relational program logics
inferredcites →https://doi.org/10.1016/j.jlap.2007.06.002openalex-snapshot
Automated Verification of Selected Equivalences for Security Protocols
inferredcites →https://doi.org/10.1016/j.jpaa.2012.02.039openalex-snapshot
Monads with arities and their associated theories
inferredcites →https://doi.org/10.1016/j.jpaa.2020.106563openalex-snapshot
Homotopical inverse diagrams in categories with attributes
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.036openalex-snapshot
Relational separation logic
inferredcites →https://doi.org/10.1016/j.tcs.2013.07.031openalex-snapshot
Quantitative information flow as safety and liveness hyperproperties
inferredcites →https://doi.org/10.1016/j.tcs.2015.03.020openalex-snapshot
Dijkstra and Hoare monads in monadic computation
inferredcites →https://doi.org/10.1016/s0022-4049(02)00137-8openalex-snapshot
The formal theory of monads II
inferredcites →https://doi.org/10.1017/s0956796808006953openalex-snapshot
Hoare type theory, polymorphism and separation
inferredcites →https://doi.org/10.1017/s095679681200024xopenalex-snapshot
The impact of higher-order state and control effects on local relational reasoning
inferredcites →https://doi.org/10.1017/s0960129511000193openalex-snapshot
Secure information flow by self-composition
inferredcites →https://doi.org/10.1017/s0960129514000565openalex-snapshot
Univalence for inverse diagrams and homotopy canonicity
inferredcites →https://doi.org/10.1109/csf.2019.00025openalex-snapshot
Journey Beyond Full Abstraction: Exploring Robust Property Preservation for Secure Compilation
inferredcites →https://doi.org/10.1109/jsac.2002.806121openalex-snapshot
Language-based information-flow security
inferredcites →https://doi.org/10.1109/lics.1989.39155openalex-snapshot
Computational lambda-calculus and monads
inferredcites →https://doi.org/10.1109/lics.2017.8005117openalex-snapshot
Effectful applicative bisimilarity: Monads, relators, and Howe's method
inferredcites →https://doi.org/10.1145/1111037.1111050openalex-snapshot
Small bisimulations for reasoning about higher-order imperative programs
inferredcites →https://doi.org/10.1145/1480881.1480894openalex-snapshot
Formal certification of code-based cryptographic proofs
inferredcites →https://doi.org/10.1145/1480881.1480925openalex-snapshot
State-dependent representation independence
inferredcites →https://doi.org/10.1145/1542476.1542513openalex-snapshot
Proving optimizations correct using parameterized program equivalence
inferredcites →https://doi.org/10.1145/1599410.1599447openalex-snapshot
Relational semantics for effect-based program transformations
inferredcites →https://doi.org/10.1145/1706299.1706323openalex-snapshot
A relational modal logic for higher-order stateful ADTs
inferredcites →https://doi.org/10.1145/1889997.1890002openalex-snapshot
Environmental bisimulations for higher-order languages
inferredcites →https://doi.org/10.1145/2103621.2103666openalex-snapshot
The marriage of bisimulations and Kripke logical relations
inferredcites →https://doi.org/10.1145/2103656.2103666openalex-snapshot
The marriage of bisimulations and Kripke logical relations
inferredcites →https://doi.org/10.1145/2254064.2254086openalex-snapshot
Proving acceptability properties of relaxed nondeterministic approximate programs
inferredcites →https://doi.org/10.1145/2429069.2429113openalex-snapshot
Linear dependent types for differential privacy
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/2491956.2491978openalex-snapshot
Verifying higher-order programs with the dijkstra monad
inferredcites →https://doi.org/10.1145/2492061openalex-snapshot
Probabilistic Relational Reasoning for Differential Privacy
inferredcites →https://doi.org/10.1145/2500365.2500593openalex-snapshot
Hoare-style reasoning with (algebraic) continuations
inferredcites →https://doi.org/10.1145/2535838.2535846openalex-snapshot
Parametric effect monads and semantics of effect systems
inferredcites →https://doi.org/10.1145/2535838.2535847openalex-snapshot
Probabilistic relational verification for cryptographic implementations
inferredcites →https://doi.org/10.1145/2535838.2535869openalex-snapshot
Abstract effects and proof-relevant logical relations
inferredcites →https://doi.org/10.1145/2535838.2535883openalex-snapshot
Combining proofs and programs in a dependently typed language
inferredcites →https://doi.org/10.1145/2578855.2535846openalex-snapshot
Parametric effect monads and semantics of effect systems
inferredcites →https://doi.org/10.1145/2676726.2677000openalex-snapshot
Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy
inferredcites →https://doi.org/10.1145/2908080.2908092openalex-snapshot
Cartesian hoare logic for verifying k-safety properties
inferredcites →https://doi.org/10.1145/2926715openalex-snapshot
Automated Verification of Equivalence Properties of Cryptographic Protocols
inferredcites →https://doi.org/10.1145/3018610.3018620openalex-snapshot
The next 700 syntactical models of type theory
inferredcites →https://doi.org/10.1145/3062341.3062378openalex-snapshot
Decomposition instead of self-composition for proving the absence of timing channels
inferredcites →https://doi.org/10.1145/3110254openalex-snapshot
A framework for adaptive differential privacy
inferredcites →https://doi.org/10.1145/3110265openalex-snapshot
A relational logic for higher-order programs
inferredcites →https://doi.org/10.1145/3131851.3131870openalex-snapshot
Verifiable semantic difference languages
inferredcites →https://doi.org/10.1145/3158124openalex-snapshot
Monadic refinements for relational cost analysis
inferredcites →https://doi.org/10.1145/3158144openalex-snapshot
Verifying equivalence of database-driven applications
inferredcites →https://doi.org/10.1145/3158152openalex-snapshot
A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST
inferredcites →https://doi.org/10.1145/3167090openalex-snapshot
A monadic framework for relational verification: applied to information security, program equivalence, and optimizations
inferredcites →https://doi.org/10.1145/3209108.3209149openalex-snapshot
Quantitative Behavioural Reasoning for Higher-order Effectful Programs
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/3341696openalex-snapshot
Relational cost analysis for functional-imperative programs
inferredcites →https://doi.org/10.1145/512644.512669openalex-snapshot
Representation independence and data abstraction
inferredcites →https://doi.org/10.1145/581478.581492openalex-snapshot
Composing monads using coproducts
inferredcites →https://doi.org/10.1145/964001.964003openalex-snapshot
Simple relational correctness proofs for static analyses and program transformations
inferredcites →https://doi.org/10.2168/lmcs-11(1:3)2015openalex-snapshot
Monads need not be endofunctors
inferredcites →https://doi.org/10.2168/lmcs-7(2:16)2011openalex-snapshot
Logical Step-Indexed Logical Relations
inferredcites →https://doi.org/10.2168/lmcs-9(3:22)2013openalex-snapshot
Exploring the Boundaries of Monad Tensorability on Set
inferredcites →https://doi.org/10.23919/fmcad.2019.8894277openalex-snapshot
Verifying Relational Properties using Trace Logic
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2016.11openalex-snapshot
Relational Logic with Framing and Hypotheses
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-030-52482-1_8openalex-snapshot
Toward a Curry-Howard Equivalence for Linear, Reversible Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-61470-6_7openalex-snapshot
Thirty-Seven Years of Relational Hoare Logic: Remarks on Its Principles and History
inferred← citeshttps://doi.org/10.1007/978-3-030-72019-3_9openalex-snapshot
Graded Hoare Logic and its Categorical Semantics
inferred← citeshttps://doi.org/10.1007/978-3-031-07727-2_6openalex-snapshot
Certified Verification of Relational Properties
inferred← citeshttps://doi.org/10.1007/978-3-031-19849-6_28openalex-snapshot
An Efficient VCGen-Based Modular Verification of Relational Properties
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8_5openalex-snapshot
A Denotational Approach to Release/Acquire Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-032-30693-7_26openalex-snapshot
Intuitive Verification of Sequential Programs Using Hybrid Reasoning
inferred← citeshttps://doi.org/10.1016/j.entcs.2020.09.002openalex-snapshot
Weakest Preconditions in Fibrations
inferred← citeshttps://doi.org/10.1016/j.jlamp.2023.100894openalex-snapshot
Operationally-based program equivalence proofs using LCTRSs
inferred← citeshttps://doi.org/10.1017/s0956796825100105openalex-snapshot
Choice trees: Representing and reasoning about nondeterministic, recursive, and impure programs in Rocq
inferred← citeshttps://doi.org/10.1017/s0960129522000330openalex-snapshot
Weakest preconditions in fibrations
inferred← citeshttps://doi.org/10.1109/csf51468.2021.00048openalex-snapshot
SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470690openalex-snapshot
Alignment Completeness for Relational Hoare Logics
inferred← citeshttps://doi.org/10.1145/3473572openalex-snapshot
Modular, compositional, and executable formal semantics for LLVM IR
inferred← citeshttps://doi.org/10.1145/3473598openalex-snapshot
Higher-order probabilistic adversarial computations: categorical semantics and program logics
inferred← citeshttps://doi.org/10.1145/3485476openalex-snapshot
SecRSL: security separation logic for C11 release-acquire concurrency
inferred← citeshttps://doi.org/10.1145/3547630openalex-snapshot
Formal reasoning about layered monadic interpreters
inferred← citeshttps://doi.org/10.1145/3547643openalex-snapshot
Safe couplings: coupled refinement types
inferred← citeshttps://doi.org/10.1145/3551497openalex-snapshot
A Relational Program Logic with Data Abstraction and Dynamic Framing
inferred← citeshttps://doi.org/10.1145/3571254openalex-snapshot
Choice Trees: Representing Nondeterministic, Recursive, and Impure Programs in Coq
inferred← citeshttps://doi.org/10.1145/3594735openalex-snapshot
SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq
inferred← citeshttps://doi.org/10.1145/3632916openalex-snapshot
Securing Verified IO Programs Against Unverified Code in F*
inferred← citeshttps://doi.org/10.1145/3656437openalex-snapshot
Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties
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/3689756openalex-snapshot
Hypra: A Deductive Program Verifier for Hyper Hoare Logic
inferred← citeshttps://doi.org/10.1145/3704877openalex-snapshot
Approximate Relational Reasoning for Higher-Order Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3715096openalex-snapshot
A Brookes-Style Denotational Semantics for Release/Acquire Concurrency
inferred← citeshttps://doi.org/10.1145/3720474openalex-snapshot
KestRel: Relational Verification using E-Graphs for Program Alignment
inferred← citeshttps://doi.org/10.1145/3729311openalex-snapshot
PulseCore: An Impredicative Concurrent Separation Logic for Dependently Typed Programs
inferred← citeshttps://doi.org/10.1145/3747522openalex-snapshot
SecRef*: Securely Sharing Mutable References between Verified and Unverified Code in F*
inferred← citeshttps://doi.org/10.1145/3763130openalex-snapshot
Verifying Asynchronous Hyperproperties in Reactive Systems
inferred← citeshttps://doi.org/10.1145/3763138openalex-snapshot
Encode the ∀∃ Relational Hoare Logic into Standard Hoare Logic
inferred← citeshttps://doi.org/10.1145/3808303openalex-snapshot
Backwards-Compatible Row-Based Exceptions in ML
inferred← citeshttps://doi.org/10.1145/3828694openalex-snapshot
Assertions for Free: Transferring Invariants from Algorithm to Implementation Proofs (Functional Pearl)
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d1eopenalex-snapshot
Graded Hoare Logic and its Categorical Semantics
inferred← citeshttps://doi.org/10.46298/lmcs-21(3:4)2025openalex-snapshot
A Curry-Howard Correspondence for Linear, Reversible Computation
inferred← citeshttps://doi.org/10.48550/arxiv.2109.03602openalex-snapshot
SecRSL: Security Separation Logic for C11 Release-Acquire Concurrency (Extended version with technical appendices)
inferred← citeshttps://doi.org/10.70675/95fceee8z06bbz48ccz8b06z87fb9e672ea8openalex-snapshot
Proof-oriented domain-specific language design for high-assurance software
inferred← citeshttps://doi.org/10.70675/9fda62afzbeeez4dbez8c26zb1cf3b884efeopenalex-snapshot
Towards a Curry-Howard Correspondence for Quantum Computation
inferred← citeshttps://doi.org/10.70675/adcfd403z5566z460dz9591zebb0e4f5a766openalex-snapshot
Principles of program verification for arbitrary monadic effects
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.