DOCSLIB.ORG

Module 29: Operating System Memory Protection

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Module 29: Operating System Memory Protection e-PG Pathshala Information Technology Information security Module 29: Operating System Memory Protection • An operating system is the multiprogramming system allowing multiple users to use concurrently. • Operating system is designed in such a way that one user's computation cannot be intercepted by malicious user. • For this purpose, operating system has following facilities. 1. Memory protection, 2. File protection, 3. General control on how objects are accessed, e-PG Pathshala Information Technology Information security 4. User authentication Memory and Address Protection • Memory protection in multiprogramming prevents other programs from interfering to user’s program. • Hardware is designed to provide memory protection. Memory and Address Protection – Fixed Fence Addresses Memory 0 Operating system n Hardware address for defining limit n+1 Memory space for User program upper limit • A fence defines a boundary on one side and restricts the user. • The fence address location is fixed. The operating system resides on one side and the user works on the other side of the fence. • This implementation was restrictive – operating system always occupied predefined amount of space, whether it was needed or not. e-PG Pathshala Information Technology Information security Memory and Address Protection – Variable Fence Register Addresses Memory Addresses Memory 0 0 Operating Operating system n system p Hardware register defines limit n+1 n+1 Hardware register defines limit p+1 p+1 Memory space Memory space for User for User program program upper limit upper limit • Operating system defines register part of hardware, termed as a fence register; holds the address indicating the operating system ends at this address. • This scheme differs from fixed fence, as in this scheme change can take place in the location of the fence. • For every data modification request by user program, address referred for data modification, is checked against the address defined as fence. The address used is above the fence address then this address falls in the user area and the instruction gets executed. In case the address is below the fence address then it penetrates in the operating system area which raises a fault. Variable Fence Register – Limitation A fence register derives the boundary between operating system and users. The fence cannot prevent penetration of one user into the area of another user. e-PG Pathshala Information Technology Information security Memory and Address Protection – Relocation • Relocation process takes a program considering address 0 for the first instruction and replaces rest of the addresses with the actual addresses in memory that the program is residing at. • Every time each address adds constant relocation factor to get the address. The first address of the program becomes the value of relocation factor. • The fence register acts as a relocation device defined in hardware. To generate address of the program, the fence register contents are read and added to the address for each instruction of the program. Memory and Address Protection – Base/Bounds Registers • Fence registers mention the beginning not the end of memory meaning specifies the lower bound but does not specify upper limit. • An upper limit can count the available space and checks that overflow does not lead into "forbidden" areas. e-PG Pathshala Information Technology Information security Addersses Memory 0 Operating System n Base register n+1 n+1 Space for programs (User1) x Bound register x x+1 Space for programs (User2) y Bound register y y+1 Space for programs(User3) upper limit • The bounds register marks the upper address limit and a base or fence register marks the lower address limit. • The address generated for program has to be above the base address because addition is performed on the contents of the base register and the address assigned to program. Each address is checked against the bounds address to make sure that it is below the bounds address. This helps in saving the program's addresses from modification by other users. e-PG Pathshala Information Technology Information security • When operating system switches from program of one user to program of other user, the contents of the base and bound registers are changed to reflect the actual address space assigned to the current user. This is called a context switch. The operating system performs context switching means assign control to other user from current user. • A user error occurs in following situations. 1) When an array subscript refers to an element that is out of range 2) An undefined variable is used in executable instruction which refers to an address lying in the user's space. 3) A user accidentally stores data in the memory area of instructions which destroys a user's own program. To solve the problem of overwriting data to instructions, one more pair of base/bounds register is used. Instructions of the program(code) holds one register and data space holds another register. Two pairs of base/bound registers are used. When instructions are to be executed, their relocation address is checked against the first register pair, and check against second register pair is performed for all kinds of data accesses (operands of instructions). Memory Operating System Code(program) space(User1) e-PG Pathshala Information Technology Information security Data base Data Space( User2) Data bound Data Space (User1) Data Space (User 3) Program base Code space (user 2) Program bound Memory and Address Protection – Tagged Architecture • In Tagged architecture, allocated registers are three or more than three pairs: one for code, one for read-only data, and one for data values that can be modified. e-PG Pathshala Information Technology Information security • In some cases - some data values need to be protected but not all. • A programmer allows certain data values to be modified while initializing the program but program is not allowed to modify these data values at later stage, thus ensures integrity. • A programmer invokes a shared subprogram from a common library. • Base/bounds registers create an all-or-nothing environment for sharing: meaning that a program allows access and modification of data or all accesses are prohibited. • There are four resources P,Q,R,S. A procedure wants to share P, Q, and R data items with one module; P, R, and S with a second module, and P, Q, and S with a third module. These sets need to be saved in contiguous space so that they are effectively shared. e-PG Pathshala Information Technology Information security Consider that these data items are either large records or arrays or even structures, then this solution is infeasible. • In case of tagged architecture, one or more extra bits of information are attached to each word of machine memory so that the access rights to that word can be identified. Only operating system can set these access bits. The bits are tested every time to check whether an instruction can access that location. Tag Memory Word Execute only access is given to one memory location, R 0001 while read only data access is RW 0099 given to other while write access is allowed to third. R 3099 Two adjacent locations possess different access rights. X • A tagged architecture makes operating system code prohibitively expensive. Feasibility of implementation of tagged architecture has been proven because of memory becoming cheap. Memory and Address Protection – Segmentation Logical Physical placement of segments arrangement of program Operating system segments MAIN Segment used by other program Function Segment used by other program Data_segment Data_segment Segment used by other program MAIN Function e-PG Pathshala Information Technology Information security • In Segmentation, a program is divided into separate parts. Each part exhibits a code or data values relationship and making a logical unit. • For example, a segment represents a specific module consisting of the code that belongs to a procedure, or an array representing data items, or bunch of all the local data items. • Segmentation divides a program and provides rights for access. • Each segment is identified by a unique name. In a segment, a code or data item is addressed as the pair <name, offset >, where name is the name of the segment holding the data item and offset is its location within the segment ( offset from the start of the segment). • The operating system keeps a table in memory having segment names and their actual addresses. • An address in a program is referred by < name, offset >. The operating system goes through directory holding segment related information and reads the address which is starting memory address. To get actual address of code or data item, the operating system adds offset. • Operating system considers the executing processes and for each executing process keeps a segment address table. The same segment can be shared by two processes. In that case, each process will keep the segment name and address in their segment tables. • A user program is not aware of the actual physical memory addresses referred to access the segment. These hidden physical addresses have proven advantageous to the operating system. 1) The operating system decides the location and places the segment. The operating system can move the segment to other location, even if the program is in execution mode. The operating system takes care of all address references by a segment address table. In case segment is moved, the address in that one table is changed. 2) A segment if not in use can be shifted to auxiliary device from main memory. 3) Every address has to be through the operating system, so the operating system can check each one for protection. e-PG Pathshala Information Technology Information security The segmentation process uses both hardware and software. Benefits of Segmentation Each address reference can be verified for protection. Different levels of protection can be assigned to different classes of data items.
Load more

Recommended publications
  • Openvms Record Management Services Reference Manual
    OpenVMS Record Management Services Reference Manual Order Number: AA-PV6RD-TK April 2001 This reference manual contains general information intended for use in any OpenVMS programming language, as well as specific information on writing programs that use OpenVMS Record Management Services (OpenVMS RMS). Revision/Update Information: This manual supersedes the OpenVMS Record Management Services Reference Manual, OpenVMS Alpha Version 7.2 and OpenVMS VAX Version 7.2 Software Version: OpenVMS Alpha Version 7.3 OpenVMS VAX Version 7.3 Compaq Computer Corporation Houston, Texas © 2001 Compaq Computer Corporation Compaq, AlphaServer, VAX, VMS, the Compaq logo Registered in U.S. Patent and Trademark Office. Alpha, PATHWORKS, DECnet, DEC, and OpenVMS are trademarks of Compaq Information Technologies Group, L.P. in the United States and other countries. UNIX and X/Open are trademarks of The Open Group in the United States and other countries. All other product names mentioned herein may be the trademarks of their respective companies. Confidential computer software. Valid license from Compaq required for possession, use, or copying. Consistent with FAR 12.211 and 12.212, Commercial Computer Software, Computer Software Documentation, and Technical Data for Commercial Items are licensed to the U.S. Government under vendor’s standard commercial license. Compaq shall not be liable for technical or editorial errors or omissions contained herein. The information in this document is provided "as is" without warranty of any kind and is subject to change without notice. The warranties for Compaq products are set forth in the express limited warranty statements accompanying such products. Nothing herein should be construed as constituting an additional warranty.
    [Show full text]
  • Chapter 1. Origins of Mac OS X
    1 Chapter 1. Origins of Mac OS X "Most ideas come from previous ideas." Alan Curtis Kay The Mac OS X operating system represents a rather successful coming together of paradigms, ideologies, and technologies that have often resisted each other in the past. A good example is the cordial relationship that exists between the command-line and graphical interfaces in Mac OS X. The system is a result of the trials and tribulations of Apple and NeXT, as well as their user and developer communities. Mac OS X exemplifies how a capable system can result from the direct or indirect efforts of corporations, academic and research communities, the Open Source and Free Software movements, and, of course, individuals. Apple has been around since 1976, and many accounts of its history have been told. If the story of Apple as a company is fascinating, so is the technical history of Apple's operating systems. In this chapter,[1] we will trace the history of Mac OS X, discussing several technologies whose confluence eventually led to the modern-day Apple operating system. [1] This book's accompanying web site (www.osxbook.com) provides a more detailed technical history of all of Apple's operating systems. 1 2 2 1 1.1. Apple's Quest for the[2] Operating System [2] Whereas the word "the" is used here to designate prominence and desirability, it is an interesting coincidence that "THE" was the name of a multiprogramming system described by Edsger W. Dijkstra in a 1968 paper. It was March 1988. The Macintosh had been around for four years.
    [Show full text]
  • The Evolution of the Unix Time-Sharing System*
    The Evolution of the Unix Time-sharing System* Dennis M. Ritchie Bell Laboratories, Murray Hill, NJ, 07974 ABSTRACT This paper presents a brief history of the early development of the Unix operating system. It concentrates on the evolution of the file system, the process-control mechanism, and the idea of pipelined commands. Some attention is paid to social conditions during the development of the system. NOTE: *This paper was first presented at the Language Design and Programming Methodology conference at Sydney, Australia, September 1979. The conference proceedings were published as Lecture Notes in Computer Science #79: Language Design and Programming Methodology, Springer-Verlag, 1980. This rendition is based on a reprinted version appearing in AT&T Bell Laboratories Technical Journal 63 No. 6 Part 2, October 1984, pp. 1577-93. Introduction During the past few years, the Unix operating system has come into wide use, so wide that its very name has become a trademark of Bell Laboratories. Its important characteristics have become known to many people. It has suffered much rewriting and tinkering since the first publication describing it in 1974 [1], but few fundamental changes. However, Unix was born in 1969 not 1974, and the account of its development makes a little-known and perhaps instructive story. This paper presents a technical and social history of the evolution of the system. Origins For computer science at Bell Laboratories, the period 1968-1969 was somewhat unsettled. The main reason for this was the slow, though clearly inevitable, withdrawal of the Labs from the Multics project. To the Labs computing community as a whole, the problem was the increasing obviousness of the failure of Multics to deliver promptly any sort of usable system, let alone the panacea envisioned earlier.
    [Show full text]
  • I.T.S.O. Powerpc an Inside View
    SG24-4299-00 PowerPC An Inside View IBM SG24-4299-00 PowerPC An Inside View Take Note! Before using this information and the product it supports, be sure to read the general information under “Special Notices” on page xiii. First Edition (September 1995) This edition applies to the IBM PC PowerPC hardware and software products currently announced at the date of publication. Order publications through your IBM representative or the IBM branch office serving your locality. Publications are not stocked at the address given below. An ITSO Technical Bulletin Evaluation Form for reader′s feedback appears facing Chapter 1. If the form has been removed, comments may be addressed to: IBM Corporation, International Technical Support Organization Dept. JLPC Building 014 Internal Zip 5220 1000 NW 51st Street Boca Raton, Florida 33431-1328 When you send information to IBM, you grant IBM a non-exclusive right to use or distribute the information in any way it believes appropriate without incurring any obligation to you. Copyright International Business Machines Corporation 1995. All rights reserved. Note to U.S. Government Users — Documentation related to restricted rights — Use, duplication or disclosure is subject to restrictions set forth in GSA ADP Schedule Contract with IBM Corp. Abstract This document provides technical details on the PowerPC technology. It focuses on the features and advantages of the PowerPC Architecture and includes an historical overview of the development of the reduced instruction set computer (RISC) technology. It also describes in detail the IBM Power Series product family based on PowerPC technology, including IBM Personal Computer Power Series 830 and 850 and IBM ThinkPad Power Series 820 and 850.
    [Show full text]
  • History of General-Purpose Operating Systems Unix Opera
    Software systems and issues Operating system • operating systems • a program that controls the resources of a computer – controlling the computer – interface between hardware and all other software • file systems and databases – examples: Windows 95/98/NT/ME/2000/XP/Vista/7, – storing information Unix/Linux, Mac OS X, Symbian, PalmOS, ... • applications – programs that do things • runs other programs ("applications", your programs) • middleware, platforms • manages information on disk (file system) – where programs meet systems • controls peripheral devices, communicates with outside • interfaces, standards • provides a level of abstraction above the raw hardware – agreements on how to communicate and inter-operate – makes the hardware appear to provide higher-level services than it • open source software really does – freely available software – makes programming much easier • intellectual property – copyrights, patents, licenses What's an operating system? History of general-purpose operating systems • 1950's: signup sheets "Operating system" means the software code that, inter alia, • 1960's: batch operating systems (i) controls the allocation and usage of hardware resources – operators running batches of jobs (such as the microprocessor and various peripheral devices) of – OS/360 (IBM) a Personal Computer, (ii) provides a platform for developing • 1970's: time-sharing applications by exposing functionality to ISVs through APIs, – simultaneous access for multiple users and (iii) supplies a user interface that enables users to access – Unix (Bell Labs; Ken Thompson & Dennis Ritchie) functionality of the operating system and in which they can • 1980's: personal computers, single user systems run applications. – DOS, Windows, MacOS – Unix US District Court for the District of Columbia • 1990's: personal computers, PDA's, … Final Judgment, State of New York, et al v.
    [Show full text]
  • Role of Operating System
    Role of Operating System • Operating systems are designed to provide uniform abstraction across multiple applications: fair sharing of resources • General purpose OS like Solaris in wizard.cse.nd.edu – Mail, web, samba server, telnet, emacs … – Memory fs, afs, ufs … – Fibre channel devices, floppy disks … • What about applications/services such as video games, data base servers, mail servers – OS gets in the way of these applications in the name of fairness (MSDOS is the ideal OS!!) Nov-20-03 CSE 542: Operating Systems 1 What is the role of OS? • Create multiple virtual machines that each user can control all to themselves – IBM 360/370 … • Monolithic kernel: Linux – One kernel provides all services. – New paradigms are harder to implement – May not be optimal for any one application • Microkernel: Mach – Microkernel provides minimal service – Application servers provide OS functionality • Nanokernel: OS is implemented as application level libraries Nov-20-03 CSE 542: Operating Systems 2 Case study: Multics • Goal: Develop a convenient, interactive, useable time shared computer system that could support many users. – Bell Labs and GE in 1965 joined an effort underway at MIT (CTSS) on Multics (Multiplexed Information and Computing Service) mainframe timesharing system. • Multics was designed to the swiss army knife of OS • Multics achieved most of the these goals, but it took a long time – One of the negative contribution was the development of simple yet powerful abstractions (UNIX) Nov-20-03 CSE 542: Operating Systems 3 Multics: Designed to be the ultimate OS • “One of the overall design goals is to create a computing system which is capable of meeting almost all of the present and near-future requirements of a large computer utility.
    [Show full text]
  • Virtual Memory and Linux
    Virtual Memory and Linux Matt Porter Embedded Linux Conference Europe October 13, 2016 About the original author, Alan Ott ● Unfortunately, he is unable to be here at ELCE 2016. ● Veteran embedded systems and Linux developer ● Linux Architect at SoftIron – 64-bit ARM servers and data center appliances – Hardware company, strong on software – Overdrive 3000, more products in process Physical Memory Single Address Space ● Simple systems have a single address space ● Memory and peripherals share – Memory is mapped to one part – Peripherals are mapped to another ● All processes and OS share the same memory space – No memory protection! – Processes can stomp one another – User space can stomp kernel mem! Single Address Space ● CPUs with single address space ● 8086-80206 ● ARM Cortex-M ● 8- and 16-bit PIC ● AVR ● SH-1, SH-2 ● Most 8- and 16-bit systems x86 Physical Memory Map ● Lots of Legacy ● RAM is split (DOS Area and Extended) ● Hardware mapped between RAM areas. ● High and Extended accessed differently Limitations ● Portable C programs expect flat memory ● Multiple memory access methods limit portability ● Management is tricky ● Need to know or detect total RAM ● Need to keep processes separated ● No protection ● Rogue programs can corrupt the entire system Virtual Memory What is Virtual Memory? ● Virtual Memory is a system that uses an address mapping ● Maps virtual address space to physical address space – Maps virtual addresses to physical RAM – Maps virtual addresses to hardware devices ● PCI devices ● GPU RAM ● On-SoC IP blocks What is Virtual Memory? ● Advantages ● Each processes can have a different memory mapping – One process's RAM is inaccessible (and invisible) to other processes.
    [Show full text]
  • Intra-Process Memory Protection for Applications on ARM And
    "Sections are types, linking is policy" Intra-Process Memory Protection Sergey Bratus for Applications on ARM and Julian Bangert x86: Leveraging the ELF ABI Maxwell Koo The Problem ❖ A buggy library can read or corrupt any of your process memory ❖ "An image parser just stole my private keys" "What's your angle?" ❖ Software is already split into parts ❖ Libraries, compilation units, functions, ... ❖ Their interactions tell a lot about them ❖ Linkers/binary toolchains already know a lot about intended & unintended interactions between these parts ❖ But: runtime discards all this information, wastefully With ELFbac, you can describe how parts of your application interact (via ELF metadata) "Sections are types, linking is policy" Key architectural idea ❖ ELF sections describe identities & layout of program's code & data parts in memory ❖ Great for policy, but discarded by loaders :( ❖ Kernel's virtual memory structures describe layout of process' parts in memory ❖ Intent (r?,w?,x?) is enforced via PTEs & page faults ❖ Connect ELF structs -> VM structs via a "non-forgetful" loader! Enforce intended code & data interaction Outline ❖ Why use ELF ABI for policy ❖ Unforgetful loader for intra-memory ACLs ❖ Case studies: ❖ OpenSSH policy vs CVE-2016-0777 (roaming bug) ❖ ICS protocol proxy ❖ Internals ❖ Linux x86 prototype (Julian) ❖ ARM prototype (Max) Background/Motivation ❖ File-level policies (e.g., SELinux) fail to capture what happens inside a process (cf. Heartbleed, etc.) ❖ CFI, DFI, SFI, etc. are good mitigations, but they aren't policy: they don't describe intended operation of code ❖ ELF ABI has plenty of structure to encode intent of a process' parts: libraries, code & data sections ❖ Already supported by the GCC toolchain! ❖ Policy is easy to create, intuitive for C/C++ programmers Policy vs mitigations ❖ Both aim to block unintended execution (exploits) ❖ Mitigations attempt to derive intent ❖ E.g., no calls into middles of functions, no returns to non- call sites, etc.
    [Show full text]
  • Computer Systems B COMS20012 Introduction to Operating Systems and Security
    Computer Systems B COMS20012 Introduction to Operating Systems and Security 1 A brief history of Operating Systems 2 Phase 0: no operating systems (1940-1955) . Computer are exotic experimental equipments . Program in machine language . Use plugboard to direct computer . Program manually loaded via card decks . Goal: churn table of numbers (e.g. accounting) . Progress: – People develop libraries that they share with each others – These libraries are the precursor to today OSs 3 Phase 1: Expensive computers, cheap people (1955-1970) . Move the users away from the computer, give them (dumb) terminal . OS is a batch monitors, a program that: – Load a user job – Run it – Move to the next . Program fails? Record memory, save it, move on . Efficient use of hardware (less “downtime”) . Hard to debug 4 Phase 1: Technology . Problems: – Utilization is low (one job at a time) – No protection between different jobs – Short jobs get stuck behind long one . Solutions: – Hardware to the rescue: memory protection (separate code and data) and relocation (i.e. non-absolute addresses) – Multiprogramming: many users share the system – Scheduling: let short job finish quickly – OS must manage interactions between concurrent things (you learn that it is not easy last term) – OS becomes an important area of research – OS/360: first OS to run on a family of machine (big and small) 5 Phase 1: the bad . Operating Systems did not really work . OS/360 introduced in 1963… worked in 1968 . Systems were enormously complicated . Written in assembly code . No structured programming (extra read) The Mythical Man-Month 6 Phase 2: expensive computers, expensive people (1970-1980) .
    [Show full text]
  • Memory Protection in a Real-Time Operating System
    Memory Protection In a real-time operating system MEMORY PROTECTION INTRODUCTION Memory protection is an aspect of memory management, and is especially In a real-time operating system (RTOS), memory important in safety-critical applications. In a microprocessor application, protection prevents one Task from overwriting the Tasks that are essential to safety-critical or high-integrity functions must memory space of another, minimising the possibility of not overwrite each other’s memory space, and also need to be protected corrupted memory causing failure of the application. from those parts of the system that are not safety-critical and may have lower integrity. SPATIAL SEPARATION USING THE MPU OR Many available microprocessors for embedded devices include an MMU optional Memory Protection Unit (MPU) or, in some cases, a Memory Management Unit (MMU) to assist in the management of separate An MPU is used to separate different areas of memory spaces. This technical note describes the use of an RTOS in memory so that data from one area cannot overwrite implementing memory protection with a hardware MPU (or MMU). or corrupt that in another area. The MPU can detect access to unauthorised regions within the memory USING THE MPU map. An MMU serves the same function in protecting memory, but also includes more advanced memory The application engineer is responsible for ensuring that the MPU is used control features that are required in complex systems. to the greatest effect. Microprocessors will only provide a certain number of memory regions, depending on the model, and some of those must be MPUs allow a number of regions to be defined in reserved for the RTOS.
    [Show full text]
  • Memory Protection: Kernel and User Address Spaces Andy Wang Operating Systems COP 4610 / CGS 5765 up to This Point
    Memory Protection: Kernel and User Address Spaces Andy Wang Operating Systems COP 4610 / CGS 5765 Up to This Point . Threads provide the illusion of an infinite number of CPUs . On a single processor machine . Memory management provides a different set of illusions . Protected memory . Infinite amount of memory . Transparent sharing Physical vs. Virtual Memory Physical memory Virtual memory No protection Each process isolated from others and from OS Limited size Illusion of infinite memory Sharing visible to Each process cannot tell processes if memory is shared Memory Organizations . Simplest: uniprogramming without memory protection . Each application runs within a hardwired range of physical memory addresses . One application runs at a time . Application can use the same physical addresses every time, across reboots Uniprogramming Without Memory Protection . Applications typically use the lower memory addresses . An OS uses the higher memory addresses . An application can address any physical memory location Application Operating system 000000 ffffff Physical memory Multiprogramming Without Memory Protection . When a program is copied into memory, a linker-loader alters the code of the program (e.g., loads, stores, and jumps) . To use the address of where the program lands in memory . This is kind of what happens when you run the command gcc –o [filename]. It links object code into an executable. Multiprogramming Without Memory Protection . Bugs in any program can cause other programs to crash, even the OS Application 1 Application 2 Operating system 000000 ffffff Physical memory Multiprogrammed OS With Memory Protection . Memory protection keeps user programs from crashing one another and the OS . Two hardware-supported mechanisms .
    [Show full text]
  • Secure Compilation for Memory Protection Alexandre Dang
    Secure compilation for memory protection Alexandre Dang To cite this version: Alexandre Dang. Secure compilation for memory protection. Cryptography and Security [cs.CR]. Université Rennes 1, 2019. English. NNT : 2019REN1S111. tel-02972693 HAL Id: tel-02972693 https://tel.archives-ouvertes.fr/tel-02972693 Submitted on 20 Oct 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. THÈSE DE DOCTORAT DE L’UNIVERSITÉ DE RENNES 1 COMUE UNIVERSITÉ BRETAGNE LOIRE ÉCOLE DOCTORALE N° 601 Mathématiques et Sciences et Technologies de l’Information et de la Communication Spécialité : (voir liste des spécialités) Par Alexandre DANG Compilation Sécurisée pour la Protection de la Mémoire Thèse présentée et soutenue à Rennes, le 10 Décembre 2020 Unité de recherche : Celtique Thèse N° : Rapporteurs avant soutenance : Tamara Rezk Inria Sofia Antipolis Alejandro Russo Chalmers University of Technology Composition du Jury : Attention, en cas d’absence d’un des membres du Jury le jour de la soutenance, la composition du Jury ne comprend que les membres présents Président : Prénom Nom Fonction et établissement d’exercice (à préciser après la soutenance) Examinateurs : Frédéric Besson Inria Rennes Tamara Rezk Inria Sofia Antipolis Alejandro Russo Chalmers University of Technology Heydemann Karine Université Pierre et Marie Curie Viet Triem Tong Valérie CentraleSupélec Dir.
    [Show full text]