Layout Randomization and Nondeterminism

DOI10.1007/978-3-319-06880-0_1MaRDI QIDQ5418953zbMATH OpenOpenAlexFDO

Authors Martín Abadi, Jérémy Planul, Gordon D. Plotkin

Publication date 2 June 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://www.pure.ed.ac.uk/ws/files/17909608/Abadi_Planul_ET_AL_2013_Layout_Randomization_and_Nondeterminism.pdf

Mathematics Subject Classification ID

Theory of programming languages (68N15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Recommendations

• Layout randomization and nondeterminism
• On layout randomization for arrays and functions
• scientific article; zbMATH DE number 7559401
• Randomization and dynamic consistency
• Randomized complexity
• Approximating layout problems on random graphs
• scientific article; zbMATH DE number 4059302

Cites work

• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
• Analyzing security protocols using time-bounded task-PIOAs
• Continuous Lattices and Domains
• Data Refinement
• Layout randomization and nondeterminism
• Low-Level Software Security: Attacks and Defenses
• On layout randomization for arrays and functions
• Prevision Domains and Convex Powercones
• Probabilistic encryption
• Proving nondeterministically specified safety properties using progress measures
• Semantic domains for combining probability and non-determinism
• The existence of refinement mappings

Cited in

(2)

• Layout randomization and nondeterminism
• On layout randomization for arrays and functions

This page was built for publication: Layout Randomization and Nondeterminism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418953)