Layout Randomization and Nondeterminism | Zendy

Martı́n Abadi | Zendy; Jérémy Planul | Zendy; Gordon Plotkin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Layout Randomization and Nondeterminism

Author(s) -

Martı́n Abadi,

Jérémy Planul,

Gordon Plotkin

Publication year - 2013

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2013.09.006

Subject(s) - nondeterministic algorithm , computer science , randomization , theoretical computer science , programming language , semantics (computer science) , heuristics , algorithm , medicine , surgery , randomized controlled trial , operating system

In security, layout randomization is a popular, effective attack mitigation technique. Recent work has aimed to explain it rigorously, focusing on deterministic systems. In this paper, we study layout randomization in the presence of nondeterministic choice. We develop a semantic approach based on denotational models and simulation relations. This approach abstracts from language details, and helps manage the delicate interaction between probabilities and nondeterminism.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research