On the public citation graph
Local Memory via Layout Randomization
0 signed · 55 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/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-3-642-02059-9_3openalex-snapshot
Open Bisimulation for Aspects
inferredcites →https://doi.org/10.1007/978-3-642-04164-8_17openalex-snapshot
A Complete, Co-inductive Syntactic Theory of Sequential Control and State
inferredcites →https://doi.org/10.1007/bfb0013061openalex-snapshot
λμ-Calculus: An algorithmic interpretation of classical natural deduction
inferredcites →https://doi.org/10.1007/s002360050036openalex-snapshot
A theory of bisimulation for the π-calculus
inferredcites →https://doi.org/10.1016/s1571-0661(04)80013-6openalex-snapshot
Bisimilarity as a Theory of Functional Programming
inferredcites →https://doi.org/10.1109/csf.2010.30openalex-snapshot
On Protection by Layout Randomization
inferredcites →https://doi.org/10.1109/lics.2006.29openalex-snapshot
Head Normal Form Bisimulation for Pairs and the \lambda\mu-Calculus
inferredcites →https://doi.org/10.1145/1030083.1030124openalex-snapshot
On the effectiveness of address-space randomization
inferredcites →https://doi.org/10.1145/1053283.1053286openalex-snapshot
Randomized instruction set emulation
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/1218563.1218577openalex-snapshot
Open bisimulation for aspects
inferredcites →https://doi.org/10.1145/1519144.1519145openalex-snapshot
Breaking the memory secrecy assumption
inferredcites →https://doi.org/10.1145/1920261.1920268openalex-snapshot
Fast and practical instruction-set randomization for commodity systems
inferredcites →https://doi.org/10.1145/73560.73577openalex-snapshot
Towards fully abstract semantics for local variables
inferredcites →https://doi.org/10.1145/948109.948146openalex-snapshot
Countering code-injection attacks with instruction-set randomization
inferredcites →https://doi.org/10.21236/ada458115openalex-snapshot
Measuring a System's Attack Surface
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-17184-1_17openalex-snapshot
Robustly Safe Compilation
inferred← citeshttps://doi.org/10.1007/978-3-030-57201-3_9openalex-snapshot
A Categorical Approach to Secure Compilation
inferred← citeshttps://doi.org/10.1007/978-3-319-03542-0_13openalex-snapshot
Secure Compilation of Object-Oriented Components to Protected Module Architectures
inferred← citeshttps://doi.org/10.1007/978-3-319-06880-0_1openalex-snapshot
Layout Randomization and Nondeterminism
inferred← citeshttps://doi.org/10.1007/978-3-319-22969-0_16openalex-snapshot
Formalizing a Secure Foreign Function Interface
inferred← citeshttps://doi.org/10.1007/978-3-319-25942-0_11openalex-snapshot
A High-Level Model for an Assembly Language Attacker by Means of Reflection
inferred← citeshttps://doi.org/10.1007/978-3-319-26529-2_3openalex-snapshot
A Secure Compiler for ML Modules
inferred← citeshttps://doi.org/10.1007/978-3-642-30955-7_1openalex-snapshot
Recent Developments in Low-Level Software Security
inferred← citeshttps://doi.org/10.1007/978-3-642-32759-9_1openalex-snapshot
Software Security: A Formal Perspective
inferred← citeshttps://doi.org/10.1007/978-3-642-36830-1_9openalex-snapshot
On Layout Randomization for Arrays and Functions
inferred← citeshttps://doi.org/10.1016/j.cl.2015.03.002openalex-snapshot
Fully abstract trace semantics for protected module architectures
inferred← citeshttps://doi.org/10.1016/j.entcs.2012.08.013openalex-snapshot
A System-Level Game Semantics
inferred← citeshttps://doi.org/10.1109/csf.2012.12openalex-snapshot
Secure Compilation to Modern Processors
inferred← citeshttps://doi.org/10.1109/csf.2016.11openalex-snapshot
Beyond Good and Evil: Formalizing the Security Guarantees of Compartmentalizing Compilation
inferred← citeshttps://doi.org/10.1109/csf.2016.9openalex-snapshot
On Modular and Fully-Abstract Compilation
inferred← citeshttps://doi.org/10.1109/csf.2017.13openalex-snapshot
Secure Compilation and Hyperproperty Preservation
inferred← citeshttps://doi.org/10.1109/csf.2019.00025openalex-snapshot
Journey Beyond Full Abstraction: Exploring Robust Property Preservation for Secure Compilation
inferred← citeshttps://doi.org/10.1109/secdev.2016.030openalex-snapshot
Security Guarantees for the Execution Infrastructure of Software Applications
inferred← citeshttps://doi.org/10.1145/2603088.2603150openalex-snapshot
Transition systems over games
inferred← citeshttps://doi.org/10.1145/2637113.2637118openalex-snapshot
Operational Semantics for Secure Interoperation
inferred← citeshttps://doi.org/10.1145/2699503openalex-snapshot
Secure Compilation to Protected Module Architectures
inferred← citeshttps://doi.org/10.1145/2837614.2837618openalex-snapshot
Fully-abstract compilation by approximate back-translation
inferred← citeshttps://doi.org/10.1145/2914770.2837618openalex-snapshot
Fully-abstract compilation by approximate back-translation
inferred← citeshttps://doi.org/10.1145/2951913.2951941openalex-snapshot
Fully abstract compilation via universal embedding
inferred← citeshttps://doi.org/10.1145/3022670.2951941openalex-snapshot
Fully abstract compilation via universal embedding
inferred← citeshttps://doi.org/10.1145/3158126openalex-snapshot
Parametricity versus the universal type
inferred← citeshttps://doi.org/10.1145/3280984openalex-snapshot
Formal Approaches to Secure Compilation
inferred← citeshttps://doi.org/10.1145/3436809openalex-snapshot
Robustly Safe Compilation, an Efficient Form of Secure Compilation
inferred← citeshttps://doi.org/10.1145/3539657openalex-snapshot
Two Parametricities Versus Three Universal Types
inferred← citeshttps://doi.org/10.23638/lmcs-13(4:2)2017openalex-snapshot
Modular, Fully-abstract Compilation by Approximate Back-translation
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d46openalex-snapshot
Trace-Relating Compiler Correctness and Secure Compilation
inferred← citeshttps://doi.org/10.48550/arxiv.1502.04023openalex-snapshot
The Meaning of Attack-Resistant Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1802.00588openalex-snapshot
When Good Components Go Bad: Formally Secure Compilation Despite Dynamic Compromise
inferred← citeshttps://doi.org/10.48550/arxiv.1804.00489openalex-snapshot
Robustly Safe Compilation or, Efficient, Provably Secure Compilation
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.