Layout randomization and nondeterminism

DOI10.1016/J.ENTCS.2013.09.006MaRDI QIDQ265789zbMATH OpenOpenAlexWikidataFDO

Authors 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

full abstractionnondeterminismprobabilitiessecuritysemantics

Mathematics Subject Classification ID

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

Recommendations

• Layout Randomization and Nondeterminism
• On layout randomization for arrays and functions
• scientific article; zbMATH DE number 1759622
• scientific article; zbMATH DE number 3876560
• Probabilistic programming: a true verification challenge

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
• 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)

• On layout randomization for arrays and functions
• Layout Randomization and Nondeterminism

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 Q265789)