Layout randomization and nondeterminism

DOI10.1016/j.entcs.2013.09.006zbMath1334.68045OpenAlexW2128160513WikidataQ113317970 ScholiaQ113317970MaRDI QIDQ265789

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

Publication date: 12 April 2016

Full work available at URL: https://doi.org/10.1016/j.entcs.2013.09.006

zbMATH Keywords

securitysemanticsfull abstractionnondeterminismprobabilities

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Layout Randomization and Nondeterminism

Cites Work

• 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