On the public citation graph
Relational Reasoning in a Nominal Semantics for Storage
0 signed · 93 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.1006/inco.1996.0052openalex-snapshot
Relational Properties of Domains
inferredcites →https://doi.org/10.1007/11417170_8openalex-snapshot
Relational Reasoning in a Nominal Semantics for Storage
inferredcites →https://doi.org/10.1007/3-540-44622-2_19openalex-snapshot
Disjunctive Tautologies as Synchronisation Schemes
inferredcites →https://doi.org/10.1007/3-540-44802-0_1openalex-snapshot
Local Reasoning about Programs that Alter Data Structures
inferredcites →https://doi.org/10.1007/3-540-45793-3_16openalex-snapshot
Possible World Semantics for General Storage in Call-By-Value
inferredcites →https://doi.org/10.1007/3-540-57182-5_7openalex-snapshot
Action calculi, or syntactic action structures
inferredcites →https://doi.org/10.1007/3-540-57182-5_8openalex-snapshot
Observable properties of higher order functions that dynamically create local names, or: What's new?
inferredcites →https://doi.org/10.1007/978-1-4757-3851-3_7openalex-snapshot
Reasoning About Local Variables with Operationally-Based Logical Relations
inferredcites →https://doi.org/10.1016/j.entcs.2005.08.003openalex-snapshot
Constructing Induction Rules for Deductive Synthesis Proofs
inferredcites →https://doi.org/10.1016/j.scico.2004.01.007openalex-snapshot
Correctness of data representations involving heap data structures
inferredcites →https://doi.org/10.1016/j.tcs.2005.06.003openalex-snapshot
On a monadic semantics for freshness
inferredcites →https://doi.org/10.1016/s1571-0661(05)80280-4openalex-snapshot
Monads, Effects and Transformations
inferredcites →https://doi.org/10.1109/csfw.2001.930151openalex-snapshot
Logical relations for encryption
inferredcites →https://doi.org/10.1145/210346.210425openalex-snapshot
Parametricity and local variables
inferredcites →https://doi.org/10.1145/331605.331611openalex-snapshot
From Algol to polymorphic linear lambda-calculus
inferredcites →https://doi.org/10.1145/73560.73577openalex-snapshot
Towards fully abstract semantics for local variables
inferredcites →https://doi.org/10.3233/jcs-2003-11403openalex-snapshot
Logical relations for encryption1
inferredcites →https://doi.org/10.48456/tr-618openalex-snapshot
The Fresh Approach: functional programming with names and binders
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11560586_31openalex-snapshot
A Typed Semantics of Higher-Order Store and Subtyping
inferred← citeshttps://doi.org/10.1007/11575467_24openalex-snapshot
A Typed, Compositional Logic for a Stack-Based Abstract Machine
inferred← citeshttps://doi.org/10.1007/11693024_11openalex-snapshot
Bisimulations for Untyped Imperative Objects
inferred← citeshttps://doi.org/10.1007/11874683_38openalex-snapshot
Separation Logic for Higher-Order Store
inferred← citeshttps://doi.org/10.1007/11924661_5openalex-snapshot
Relational Reasoning for Recursive Types and References
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-319-24953-7_19openalex-snapshot
A Contextual Equivalence Checker for IMJ*
inferred← citeshttps://doi.org/10.1007/978-3-540-68103-8_12openalex-snapshot
On Normalization by Evaluation for Object Calculi
inferred← citeshttps://doi.org/10.1007/978-3-540-71389-0_8openalex-snapshot
Relational Parametricity and Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-73445-1_12openalex-snapshot
A Formal Calculus for Informal Equality with Binding
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_19openalex-snapshot
Fair Cooperative Multithreading
inferred← citeshttps://doi.org/10.1007/978-3-540-78739-6_26openalex-snapshot
A Realizability Model for Impredicative Hoare Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_32openalex-snapshot
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_5openalex-snapshot
Completeness for Algebraic Theories of Local State
inferred← citeshttps://doi.org/10.1007/978-3-642-19718-5_23openalex-snapshot
The Relationship between Separation Logic and Implicit Dynamic Frames
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_30openalex-snapshot
Algorithmic Games for Full Ground References
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_2openalex-snapshot
History-Register Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-38946-7_6openalex-snapshot
Proof-Relevant Logical Relations for Name Generation
inferred← citeshttps://doi.org/10.1007/s00165-009-0125-8openalex-snapshot
Blaming the client: on data refinement in the presence of pointers
inferred← citeshttps://doi.org/10.1007/s10703-017-0292-9openalex-snapshot
Algorithmic games for full ground references
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.040openalex-snapshot
Fresh O'Caml: Nominal Abstract Syntax for the Masses
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.10.015openalex-snapshot
Global State Considered Helpful
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.08.024openalex-snapshot
A Nominal Relational Model for Local Store
inferred← citeshttps://doi.org/10.1016/j.ic.2009.06.007openalex-snapshot
Typing termination in a higher-order concurrent imperative language
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.03.004openalex-snapshot
A relational realizability model for higher-order stateful ADTs
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.11.013openalex-snapshot
A study of substitution, using nominal techniques and Fraenkel–Mostowksi sets
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.07.010openalex-snapshot
The category-theoretic solution of recursive metric-space equations
inferred← citeshttps://doi.org/10.1017/s0956796807006429openalex-snapshot
Recursive type generativity
inferred← citeshttps://doi.org/10.1017/s0960129506005214openalex-snapshot
Denotational semantics for a program logic of objects
inferred← citeshttps://doi.org/10.1017/s0960129510000162openalex-snapshot
Realisability semantics of parametric polymorphism, general references and recursive types
inferred← citeshttps://doi.org/10.1093/logcom/exp049openalex-snapshot
A Nominal Axiomatization of the Lambda Calculus
inferred← citeshttps://doi.org/10.1109/lics.2017.8005109openalex-snapshot
A monad for full ground reference cells
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470524openalex-snapshot
Compositional relational reasoning via operational game semantics
inferred← citeshttps://doi.org/10.1145/1111037.1111050openalex-snapshot
Small bisimulations for reasoning about higher-order imperative programs
inferred← citeshttps://doi.org/10.1145/1111320.1111050openalex-snapshot
Small bisimulations for reasoning about higher-order imperative programs
inferred← citeshttps://doi.org/10.1145/1273920.1273922openalex-snapshot
Formalizing and verifying semantic type soundness of a simple compiler
inferred← citeshttps://doi.org/10.1145/1273920.1273932openalex-snapshot
Relational semantics for effect-based program transformations with dynamic allocation
inferred← citeshttps://doi.org/10.1145/1328438.1328476openalex-snapshot
Imperative self-adjusting computation
inferred← citeshttps://doi.org/10.1145/1328897.1328476openalex-snapshot
Imperative self-adjusting computation
inferred← citeshttps://doi.org/10.1145/1480881.1480925openalex-snapshot
State-dependent representation independence
inferred← citeshttps://doi.org/10.1145/1481861.1481864openalex-snapshot
Compiling functional types to relational specifications for low level imperative code
inferred← citeshttps://doi.org/10.1145/1481861.1481873openalex-snapshot
Relational parametricity for references and recursive types
inferred← citeshttps://doi.org/10.1145/1594834.1480925openalex-snapshot
State-dependent representation independence
inferred← citeshttps://doi.org/10.1145/1706299.1706323openalex-snapshot
A relational modal logic for higher-order stateful ADTs
inferred← citeshttps://doi.org/10.1145/1707801.1706323openalex-snapshot
A relational modal logic for higher-order stateful ADTs
inferred← citeshttps://doi.org/10.1145/1709093.1709094openalex-snapshot
Semantic foundations for typed assembly languages
inferred← citeshttps://doi.org/10.1145/1925844.1926401openalex-snapshot
Step-indexed kripke models over recursive worlds
inferred← citeshttps://doi.org/10.1145/1926385.1926401openalex-snapshot
Step-indexed kripke models over recursive worlds
inferred← citeshttps://doi.org/10.1145/2535838.2535869openalex-snapshot
Abstract effects and proof-relevant logical relations
inferred← citeshttps://doi.org/10.1145/2578855.2535869openalex-snapshot
Abstract effects and proof-relevant logical relations
inferred← citeshttps://doi.org/10.1145/2628136.2628159openalex-snapshot
A relational framework for higher-order shape analysis
inferred← citeshttps://doi.org/10.1145/2692915.2628159openalex-snapshot
A relational framework for higher-order shape analysis
inferred← citeshttps://doi.org/10.1145/3715096openalex-snapshot
A Brookes-Style Denotational Semantics for Release/Acquire Concurrency
inferred← citeshttps://doi.org/10.17760/d10016545openalex-snapshot
Reasoning about imperative and higher-order programs
inferred← citeshttps://doi.org/10.17760/d20467221openalex-snapshot
Interoperability through realizability: expressing high-level abstractions using low-level code
inferred← citeshttps://doi.org/10.2168/lmcs-4(2:6)2008openalex-snapshot
Relational Parametricity and Separation Logic
inferred← citeshttps://doi.org/10.2168/lmcs-8(3:1)2012openalex-snapshot
The Relationship Between Separation Logic and Implicit Dynamic Frames
inferred← citeshttps://doi.org/10.2168/lmcs-8(3:22)2012openalex-snapshot
Two for the Price of One: Lifting Separation Logic Assertions
inferred← citeshttps://doi.org/10.23638/lmcs-14(1:25)2018openalex-snapshot
Proof-Relevant Logical Relations for Name Generation
inferred← citeshttps://doi.org/10.4230/dagsemproc.10351.4openalex-snapshot
Limitations of Applicative Bisimulation (Preliminary Report)
inferred← citeshttps://doi.org/10.4230/lipics.csl.2015.374openalex-snapshot
Leaving the Nest: Nominal Techniques for Variables with Interleaving Scopes
inferred← citeshttps://doi.org/10.48456/tr-618openalex-snapshot
The Fresh Approach: functional programming with names and binders
inferred← citeshttps://doi.org/10.5287/ora-e9ne8n0zropenalex-snapshot
Game semantics based equivalence checking of higher-order programs
showing the first 70 of 71 · page through all 71
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.