Layout Randomization and Nondeterminism

DOI10.1007/978-3-319-06880-0_1zbMATH Open1407.68270OpenAlexW2733470343MaRDI QIDQ5418953

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

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

Cites Work

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

This page was built for publication: Layout Randomization and Nondeterminism