Sökning: "Formal Verification"

Visar resultat 1 - 5 av 43 uppsatser innehållade orden Formal Verification.

  1. 1. A Petri Nets Semantics for Privacy-Aware Data Flow Diagrams

    Master-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknik

    Författare :Mushfiqur Rahman; [2017-07-12]
    Nyckelord :privacy policy; verification; privacy by design; data flow diagrams; privacy-aware data flow diagrams; Petri nets;

    Sammanfattning : Privacy of personal data in information systems is gaining importance rapidly. Although data flow diagrams (DFDs) are commonly used for designing information systems, they do not have appropriate elements to address privacy of personal data. Privacy-aware data flow diagrams (PA-DFDs) were introduced recently to tackle this issue. LÄS MER

  2. 2. Runtime Verification of A PLC System: An Industrial Case Study

    Master-uppsats, Mälardalens högskola/Akademin för innovation, design och teknik

    Författare :Mohammad Heidari; [2017]
    Nyckelord :PLC; Runtime verification; Formal specification; Embedded system;

    Sammanfattning : The term verification can mean different things to different people based on their background and the context of research. Comparably the term runtime might bring about similar disarray with lesser confusion. LÄS MER

  3. 3. A Language-Recognition Approach to Unit Testing Message-Passing Systems

    Master-uppsats, KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Författare :Ifeanyi Ubah; [2017]
    Nyckelord :Unit testing; Message-passing; Verification;

    Sammanfattning : This thesis addresses the problem of unit testing components in message-passing systems. A message-passing system is one that comprises components communicating with each other solely via the exchange of messages. LÄS MER

  4. 4. Formal Verification of Hardware Peripheral with Security Property

    Kandidat-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC); KTH/Skolan för datavetenskap och kommunikation (CSC)

    Författare :Jonathan Yao Håkansson; Niklas Rosencrantz; [2017]
    Nyckelord :Formal Verification NuSMV JavaPathFinder Spin Promela CTL LTL DMA UART Model Checking Theorem Proving;

    Sammanfattning : One problem with computers is that the operating system automatically trusts any externallyconnected peripheral. This can result in abuse when a peripheral technically can violate the security model because the peripheral is trusted. Because of that the security is an important issue to look at. LÄS MER

  5. 5. Explanation of Counterexamples in the Context of Formal Verification

    Kandidat-uppsats, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Alexander Ek; [2016]
    Nyckelord :;

    Sammanfattning : With the current rapid computerisation and automation of systems, which were previously controlled manually, a growing demand for measures to ensure correctness of systems is arising. This can be achieved with formal verification. With formal verification, systems can be proved to satisfy, or not satisfy, a set of given properties. LÄS MER

BEVAKA DENNA SÖKNING

Få ett mail när det kommer in nya uppsatser på ämnet Formal Verification.

Din email-adress: