Sökning: "Mads Dam"

Visar resultat 1 - 5 av 12 avhandlingar innehållade orden Mads Dam.

  1. 1. Algorithmic Verification Techniques for Mobile Code

    Författare :Irem Aktug; Dilian Gurov; Mads Dam; Ulfar Erlingsson; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Verification; Mobile Code Security; Reference Monitoring; Maximal Models; Compositional Verification; Theoretical computer science; Teoretisk datalogi;

    Sammanfattning : Modern computing platforms strive to support mobile code without putting system security at stake. These platforms can be viewed as open systems, as the mobile code adds new components to the running system. Establishing that such platforms function correctly can  be divided into two steps. LÄS MER

  2. 2. State space representation for verification of open systems

    Författare :Irem Aktug; Mads Dam; Parosh Abdulla; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; Datalogi;

    Sammanfattning : When designing an open system, there might be no implementation available for cer- tain components at verification time. For such systems, verification has to be based on assumptions on the underspecified components. In this thesis, we present a framework for the verification of open systems through explicit state space representation. LÄS MER

  3. 3. Logics for Information Flow Security:From Specification to Verification

    Författare :Musard Balliu; Mads Dam; David Naumann; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Computer Science; Datalogi;

    Sammanfattning : Software is becoming  increasingly  ubiquitous and today we find software running everywhere. There is software driving our favorite  game  application or  inside the web portal we use to read the morning  news, and   when we book a vacation. LÄS MER

  4. 4. Logics of Knowledge and Cryptography : Completeness and Expressiveness

    Författare :Mika Cohen; Mads Dam; Alessio Lomuscio; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; epistemic logic; first-order logic; formal cryptography; static equivalence; security protocols; BAN logic; multi-agent system; completeness; logical omniscience problem; Computer science; Datavetenskap;

    Sammanfattning : An understanding of cryptographic protocols requires that we examine the knowledge of protocol participants and adversaries: When a participant receives a message, does she know who sent it? Does she know that the message is fresh, and not merely a replay of some old message? Does a network spy know who is talking to whom? This thesis studies logics of knowledge and cryptography. Specifically, the thesis addresses the problem of how to make the concept of knowledge reflect feasible computability within a Kripke-style semantics. LÄS MER

  5. 5. Towards a Trustworthy Stack: Formal Verification of Low-Level Hardware and Software

    Författare :Ning Dong; Roberto Guanciale; Mads Dam; Magnus Myreen; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Formal Verification; Information Flow; Refinement; Interactive Theorem Prover; HOL4; Serial Interface; Pipelined Processor; Microarchitecture; Out-of-order Execution; Formell Verifiering; Informationsflöde; Förfining; Interaktiva Bevisprogrammet; HOL4; Seriellt Gränssnitt; Pipelined Processor; Mikroarkitektur; Omordnad Exekvering; Datalogi; Computer Science;

    Sammanfattning : Computer systems, consisting of hardware and software, have gained significant importance in the digitalised world. These computer systems rely on critical components to provide core functionalities and handle sensitive data. LÄS MER