On the public citation graph
A Logical Approach to Type Soundness
0 signed · 156 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.1002/9780470373699.speced1086openalex-snapshot
Information Processing
inferredcites →https://doi.org/10.1006/inco.1994.1046openalex-snapshot
The Type and Effect Discipline
inferredcites →https://doi.org/10.1006/inco.1994.1093openalex-snapshot
A Syntactic Approach to Type Soundness
inferredcites →https://doi.org/10.1006/inco.1996.0052openalex-snapshot
Relational Properties of Domains
inferredcites →https://doi.org/10.1006/inco.1999.2828openalex-snapshot
Relational Interpretations of Recursive Types in an Operational Setting
inferredcites →https://doi.org/10.1007/11693024_6openalex-snapshot
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
inferredcites →https://doi.org/10.1007/3-540-06859-7_148openalex-snapshot
Towards a theory of type structure
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/978-3-031-30044-8_9openalex-snapshot
A Type System for Effect Handlers and Dynamic Labels
inferredcites →https://doi.org/10.1007/978-3-540-74915-8_23openalex-snapshot
Typed Normal Form Bisimulation
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-14107-2_24openalex-snapshot
Concurrent Abstract Predicates
inferredcites →https://doi.org/10.1007/978-3-642-15375-4_27openalex-snapshot
Reasoning about Optimistic Concurrency Using a Program Logic for History
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_11openalex-snapshot
Modular Reasoning about Separation of Concurrent Data Structures
inferredcites →https://doi.org/10.1007/978-3-642-54833-8_9openalex-snapshot
Impredicative Concurrent Abstract Predicates
inferredcites →https://doi.org/10.1007/978-3-662-44202-9_9openalex-snapshot
TaDA: A Logic for Time and Data Abstraction
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_26openalex-snapshot
The Essence of Higher-Order Concurrent Separation Logic
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_34openalex-snapshot
A Higher-Order Logic for Concurrent Termination-Preserving Refinement
inferredcites →https://doi.org/10.1007/bf01220868openalex-snapshot
Monads on symmetric monoidal closed categories
inferredcites →https://doi.org/10.1007/bf01304852openalex-snapshot
Strong functors and monoidal monads
inferredcites →https://doi.org/10.1007/bfb0037110openalex-snapshot
A new characterization of lambda definability
inferredcites →https://doi.org/10.1007/bfb0037118openalex-snapshot
A logic for parametric polymorphism
inferredcites →https://doi.org/10.1007/s10817-008-9099-0openalex-snapshot
Formal Verification of a C-like Memory Model and Its Uses for Verifying Program Transformations
inferredcites →https://doi.org/10.1016/0022-0000(78)90014-4openalex-snapshot
A theory of type polymorphism in programming
inferredcites →https://doi.org/10.1016/0168-0072(94)90047-7openalex-snapshot
Classical logic, storage operators and second-order lambda-calculus
inferredcites →https://doi.org/10.1016/0304-3975(92)90014-7openalex-snapshot
The revised report on the syntactic theories of sequential control and state
inferredcites →https://doi.org/10.1016/0890-5401(90)90018-dopenalex-snapshot
Type inference for polymorphic references
inferredcites →https://doi.org/10.1016/1385-7258(72)90034-0openalex-snapshot
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
inferredcites →https://doi.org/10.1016/j.entcs.2007.02.010openalex-snapshot
Syntactic Logical Relations for Polymorphic and Recursive Types
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.034openalex-snapshot
A semantics for concurrent separation logic
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.035openalex-snapshot
Resources, concurrency, and local reasoning
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.036openalex-snapshot
Relational separation logic
inferredcites →https://doi.org/10.1016/j.tcs.2010.07.010openalex-snapshot
The category-theoretic solution of recursive metric-space equations
inferredcites →https://doi.org/10.1016/j.tcs.2010.09.009openalex-snapshot
A bisimulation-like proof method for contextual properties in untyped λ -calculus with references and deallocation
inferredcites →https://doi.org/10.1016/s0019-9958(86)80019-5openalex-snapshot
An ideal model for recursive polymorphic types
inferredcites →https://doi.org/10.1016/s0049-237x(13)72061-5openalex-snapshot
Studies in Logic and the Foundations of Mathematics
inferredcites →https://doi.org/10.1017/cbo9780511525902.013openalex-snapshot
Semantics of local variables
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/s0956796818000151openalex-snapshot
Iris from the ground up: A modular foundation for higher-order concurrent separation logic
inferredcites →https://doi.org/10.1017/s0960129510000162openalex-snapshot
Realisability semantics of parametric polymorphism, general references and recursive types
inferredcites →https://doi.org/10.1017/s0960129512000035openalex-snapshot
A step-indexed Kripke model of hidden state
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.1990.113761openalex-snapshot
A PER model of polymorphism and recursive types
inferredcites →https://doi.org/10.1109/lics.2001.932501openalex-snapshot
Foundational proof-carrying code
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/lics.2002.1029818openalex-snapshot
A stratified semantics of general references embeddable in higher-order logic
inferredcites →https://doi.org/10.1109/lics.2011.38openalex-snapshot
Ultrametric Semantics of Reactive Programs
inferredcites →https://doi.org/10.1109/sp40001.2021.00003openalex-snapshot
Compositional Non-Interference for Fine-Grained Concurrent Programs
inferredcites →https://doi.org/10.1145/1040305.1040327openalex-snapshot
Permission accounting in separation logic
inferredcites →https://doi.org/10.1145/1111037.1111050openalex-snapshot
Small bisimulations for reasoning about higher-order imperative programs
inferredcites →https://doi.org/10.1145/1190216.1190235openalex-snapshot
A very modal model of a modern, major, general type system
inferredcites →https://doi.org/10.1145/1190216.1190244openalex-snapshot
A complete, co-inductive syntactic theory of sequential control and state
inferredcites →https://doi.org/10.1145/1273920.1273922openalex-snapshot
Formalizing and verifying semantic type soundness of a simple compiler
inferredcites →https://doi.org/10.1145/1284320.1284325openalex-snapshot
A bisimulation for type abstraction and recursion
inferredcites →https://doi.org/10.1145/143165.143230openalex-snapshot
PER models of subtyping, recursive types and higher-order polymorphism
inferredcites →https://doi.org/10.1145/1480881.1480925openalex-snapshot
State-dependent representation independence
inferredcites →https://doi.org/10.1145/1481861.1481864openalex-snapshot
Compiling functional types to relational specifications for low level imperative code
inferredcites →https://doi.org/10.1145/1596550.1596567openalex-snapshot
Biorthogonality, step-indexing and compiler correctness
inferredcites →https://doi.org/10.1145/1706299.1706323openalex-snapshot
A relational modal logic for higher-order stateful ADTs
inferredcites →https://doi.org/10.1145/1709093.1709094openalex-snapshot
Semantic foundations for typed assembly languages
inferredcites →https://doi.org/10.1145/1926385.1926401openalex-snapshot
Step-indexed kripke models over recursive worlds
inferredcites →https://doi.org/10.1145/1926385.1926402openalex-snapshot
A kripke logical relation between ML and assembly
inferredcites →https://doi.org/10.1145/2034773.2034831openalex-snapshot
A kripke logical relation for effect-based program transformations
inferredcites →https://doi.org/10.1145/2103656.2103666openalex-snapshot
The marriage of bisimulations and Kripke logical relations
inferredcites →https://doi.org/10.1145/224164.224182openalex-snapshot
Abstract models of memory management
inferredcites →https://doi.org/10.1145/2364527.2364536openalex-snapshot
Superficially substructural types
inferredcites →https://doi.org/10.1145/2384616.2384619openalex-snapshot
Uniqueness and reference immutability for safe parallelism
inferredcites →https://doi.org/10.1145/2429069.2429111openalex-snapshot
Logical relations for fine-grained concurrency
inferredcites →https://doi.org/10.1145/2500365.2500600openalex-snapshot
Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency
inferredcites →https://doi.org/10.1145/2784731.2784764openalex-snapshot
Pilsner: a compositionally verified compiler for a higher-order imperative language
inferredcites →https://doi.org/10.1145/2837022openalex-snapshot
The Design and Formalization of Mezzo, a Permission-Based Programming Language
inferredcites →https://doi.org/10.1145/3093333.3009855openalex-snapshot
Interactive proofs in higher-order concurrent separation logic
inferredcites →https://doi.org/10.1145/3093333.3009877openalex-snapshot
A relational model of types-and-effects in higher-order concurrent separation logic
inferredcites →https://doi.org/10.1145/3133913openalex-snapshot
Robust and compositional verification of object capability patterns
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/3158154openalex-snapshot
RustBelt: securing the foundations of the Rust programming language
inferredcites →https://doi.org/10.1145/3236772openalex-snapshot
MoSeL: a general, extensible modal framework for interactive proofs in separation logic
inferredcites →https://doi.org/10.1145/325694.325727openalex-snapshot
A semantic model of types and machine instructions for proof-carrying code
inferredcites →https://doi.org/10.1145/3341709openalex-snapshot
Mechanized relational verification of concurrent programs with continuations
inferredcites →https://doi.org/10.1145/3371074openalex-snapshot
Actris: session-type based reasoning in separation logic
inferredcites →https://doi.org/10.1145/3371100openalex-snapshot
The high-level benefits of low-level sandboxing
inferredcites →https://doi.org/10.1145/3371113openalex-snapshot
The future is ours: prophecy variables in separation logic
inferredcites →https://doi.org/10.1145/3408996openalex-snapshot
Scala step-by-step: soundness for DOT with step-indexed logical relations in Iris
inferredcites →https://doi.org/10.1145/3418295openalex-snapshot
Safe Systems Programming in Rust: The Promise and the Challenge
inferredcites →https://doi.org/10.1145/3434287openalex-snapshot
Efficient and provable local capability revocation using uninitialized capabilities
inferredcites →https://doi.org/10.1145/3434288openalex-snapshot
Fully abstract from static to gradual
inferredcites →https://doi.org/10.1145/3434291openalex-snapshot
Mechanized logical relations for termination-insensitive noninterference
inferredcites →https://doi.org/10.1145/3437992.3439914openalex-snapshot
Machine-checked semantic session typing
inferredcites →https://doi.org/10.1145/3453483.3454031openalex-snapshot
Transfinite Iris: resolving an existential dilemma of step-indexed separation logic
inferredcites →https://doi.org/10.1145/3453483.3454036openalex-snapshot
RefinedC: automating the foundational verification of C code with refined ownership types
inferredcites →https://doi.org/10.1145/3547631openalex-snapshot
Later credits: resourceful reasoning for the later modality
inferredcites →https://doi.org/10.1145/3591265openalex-snapshot
Iris-Wasm: Robust and Modular Verification of WebAssembly Programs
inferredcites →https://doi.org/10.1145/360204.375719openalex-snapshot
BI as an assertion language for mutable data structures
inferredcites →https://doi.org/10.1145/360933.360975openalex-snapshot
Guarded commands, nondeterminacy and formal derivation of programs
inferredcites →https://doi.org/10.1145/3632854openalex-snapshot
Modular Denotational Semantics for Effects with Guarded Interaction Trees
inferredcites →https://doi.org/10.1145/3632862openalex-snapshot
The Logical Essence of Well-Bracketed Control Flow
inferredcites →https://doi.org/10.1145/3632889openalex-snapshot
Deadlock-Free Separation Logic: Linearity Yields Progress for Dependent Higher-Order Message Passing
inferredcites →https://doi.org/10.1145/44501.45065openalex-snapshot
Abstract types have existential type
inferredcites →https://doi.org/10.1145/504709.504712openalex-snapshot
An indexed model of recursive types for foundational proof-carrying code
inferredcites →https://doi.org/10.1145/512644.512669openalex-snapshot
Representation independence and data abstraction
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.1145/99583.99622openalex-snapshot
Polymorphic type inference and assignment
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(4:4)2013openalex-snapshot
Step-Indexed Relational Reasoning for Countable Nondeterminism
inferredcites →https://doi.org/10.22028/d291-31946openalex-snapshot
Understanding and evolving the Rust programming language
inferredcites →https://doi.org/10.4230/lipics.csl.2012.107openalex-snapshot
A Concurrent Logical Relation
inferredcites →https://doi.org/10.4230/lipics.ecoop.2017.17openalex-snapshot
Strong Logic for Weak Memory: Reasoning About Release-Acquire Consistency in Iris
inferredcites →https://doi.org/10.46298/lmcs-17(3:9)2021openalex-snapshot
ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity
inferredcites →https://doi.org/10.46298/lmcs-18(2:16)2022openalex-snapshot
Actris 2.0: Asynchronous Session-Type Based Reasoning in Separation Logic
inferredcites →https://doi.org/10.7551/mitpress/1104.001.0001openalex-snapshot
Advanced Topics in Types and Programming Languages
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-91121-7_12openalex-snapshot
Context-Dependent Effects in Guarded Interaction Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-95589-1openalex-snapshot
Coordination Models and Languages
inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_6openalex-snapshot
Recursive Logical Relations for Intuitionistic Linear Logic Session Types
inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_9openalex-snapshot
Rely-Guarantee Is Coinductive
inferred← citeshttps://doi.org/10.1017/s0956796825100117openalex-snapshot
Tail recursion modulo context: An equational approach (extended version)
inferred← citeshttps://doi.org/10.1145/3656422openalex-snapshot
RefinedRust: A Type System for High-Assurance Verification of Rust Programs
inferred← citeshttps://doi.org/10.1145/3674632openalex-snapshot
Almost-Sure Termination by Guarded Refinement
inferred← citeshttps://doi.org/10.1145/3678000openalex-snapshot
Proceedings of the 9th ACM SIGPLAN International Workshop on Type-Driven Development
inferred← citeshttps://doi.org/10.1145/3678000.3678201openalex-snapshot
Intrinsically Typed Syntax, a Logical Relation, and the Scourge of the Transfer Lemma
inferred← citeshttps://doi.org/10.1145/3689732openalex-snapshot
Verified Lock-Free Session Channels with Linking
inferred← citeshttps://doi.org/10.1145/3689755openalex-snapshot
Realistic Realizability: Specifying ABIs You Can Count On
inferred← citeshttps://doi.org/10.1145/3689762openalex-snapshot
Multris: Functional Verification of Multiparty Message Passing in Separation Logic
inferred← citeshttps://doi.org/10.1145/3704841openalex-snapshot
Affect: An Affine Type and Effect System
inferred← citeshttps://doi.org/10.1145/3704877openalex-snapshot
Approximate Relational Reasoning for Higher-Order Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3704895openalex-snapshot
Semantic Logical Relations for Timed Message-Passing Protocols
inferred← citeshttps://doi.org/10.1145/3713082.3730387openalex-snapshot
Modular, Full-System Verification
inferred← citeshttps://doi.org/10.1145/3719027.3744801openalex-snapshot
Logical Relations for Formally Verified Authenticated Data Structures
inferred← citeshttps://doi.org/10.1145/3729250openalex-snapshot
Nola: Later-Free Ghost State for Verifying Termination in Iris
inferred← citeshttps://doi.org/10.1145/3747507openalex-snapshot
Robust Dynamic Embedding for Gradual Typing
inferred← citeshttps://doi.org/10.1145/3756907.3756909openalex-snapshot
Mechanized Type Soundness for Substructural Types using Iris
inferred← citeshttps://doi.org/10.1145/3763116openalex-snapshot
Modeling Reachability Types with Logical Relations: Semantic Type Soundness, Termination, Effect Safety, and Equational Theory
inferred← citeshttps://doi.org/10.1145/3776669openalex-snapshot
Security Reasoning via Substructural Dependency Tracking
inferred← citeshttps://doi.org/10.1145/3779031.3779095openalex-snapshot
Building Blocks for Step-Indexed Program Logics
inferred← citeshttps://doi.org/10.1145/3786766openalex-snapshot
A Sound Type System for Secure Currency Flow
inferred← citeshttps://doi.org/10.1145/3808265openalex-snapshot
Contextual Refinement of Higher-Order Concurrent Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3808303openalex-snapshot
Backwards-Compatible Row-Based Exceptions in ML
inferred← citeshttps://doi.org/10.1145/3808325openalex-snapshot
VerusBelt: A Semantic Foundation for Verus’s Proof-Oriented Extensions to the Rust Type System
inferred← citeshttps://doi.org/10.1145/3828682openalex-snapshot
Completeness of Iris-Based Program Logics
inferred← citeshttps://doi.org/10.1145/3839477openalex-snapshot
When Do Staging Annotations Preserve Semantics? Mechanizing Typed Semantics-Preserving Multi-stage Programming with Let-Insertion
inferred← citeshttps://doi.org/10.1145/3840563.3843706openalex-snapshot
Effect Systems as Abstract Interpretations
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.