Fully abstract trace semantics for protected module architectures. (July 2015)

• Record Type: Journal Article
• Authors: Patrignani, Marco; Clarke, Dave
• Is Part Of: Computer languages, systems & structures. Volume 42(2015)
• Page Start: 22
• Page End: 45
• Publication Date: 2015-07
• Subjects: Fully abstract semantics -- Trace semantics -- Untyped assembly language -- Protected modules architectures -- Formal languages; Programming languages (Electronic computers) -- Periodicals; Computer networks -- Periodicals; Computer architecture -- Periodicals; Computer systems -- Periodicals; Langage de programmation; Réseau d'ordinateurs; Architecture d'ordinateur; Périodique électronique (Descripteur de forme); Ressource Internet (Descripteur de forme); 005.13
• DOI: 10.1016/j.cl.2015.03.002
• Languages: English
• ISSNs: 1477-8424

Abstract

Abstract: Protected module architectures (PMAs) are isolation mechanisms of emerging processors that provide security building blocks for modern software systems. Reasoning about these building blocks means reasoning about elaborate assembly code, which can be very complex due to the loose structure of the code. One way to overcome this complexity is providing the code with a well-structured semantics. This paper presents one such semantics, namely a fully abstract trace semantics, for an assembly language enhanced with PMA. The trace semantics represents the behaviour of protected assembly code with simple abstractions, unburdened by low-level details, at the maximum degree of precision. Furthermore, it captures the capabilities of attackers to protected code and simplifies the formulation of a secure compiler targeting PMA-enhanced assembly language. Abstract : Highlights: Formalises A + I : an assembly language extended with protected module architectures – an isolation mechanism found in emerging processors. Presents two trace semantics for A + I programs and proves that both are fully abstract w.r.t. the operational semantics. Details which problems arise when considering readout and writeout labels in the trace semantics of A + I programs.