Sökning: "Symbolic Execution"

Visar resultat 1 - 5 av 23 avhandlingar innehållade orden Symbolic Execution.

  1. 1. Proving Safety and Security of Binary Programs

    Författare :Andreas Lindner; Roberto Guanciale; Mads Dam; Tamara Rezk; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Binary Code; Binary Analysis; Formal Verification; Model-Based Testing; Theorem Proving; HOL4; Intermediate Language; Instruction Set Architectures; ISA; Observational Models; Symbolic Execution; Weakest-Precondition; Execution Time Analysis; binärkod; binärkodsanalys; formell verifiering; modellbaserad testning; satsbevisning; HOL4; mellankod; instruktionsuppsättningar; ISA; observationsmodeller; symbolisk exekvering; minst restriktiva villkoret; analys av övre tidsgräns; Datalogi; Computer Science;

    Sammanfattning : With the increasing ubiquity of computing devices, their correct and secure operation is of growing importance. In particular, critical components that provide core functionalities or process sensitive data have to operate as intended. LÄS MER

  3. 2. Robust execution of robot task-plans : a knowledge-based approach

    Författare :Abdelbaki Bouguerra; Lars Karlsson; Alessandro Saffiotti; Froduald Kabanza; Örebro universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Autonomous mobile robots; plan execution and monitoring; semantic knowledge; cognitive robotics.; Computer science; Datavetenskap; Computer and Systems Science; Data- och systemvetenskap;

    Sammanfattning : Autonomous mobile robots are being developed with the aim of accomplishing complex tasks in different environments, including human habitats as well as less friendly places, such as distant planets and underwater regions. A major challenge faced by such robots is to make sure that their actions are executed correctly and reliably, despite the dynamics and the uncertainty inherent in their working space. LÄS MER

  4. 3. Towards a Deductive Compilation Approach

    Författare :Ran Ji; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Software Engineering; Software Verification; Partial Evaluation; Symbolic Execution; Deductive Compilation;

    Sammanfattning : Software correctness is an important topic, however, it is difficult to achieve. This thesis is a step towards a new way to ensure the software correctness in both source code and bytecode level. KeY is a state-of-the-art verification tool for Java source code. LÄS MER

  5. 4. Model-Based Protocol Testing in an Erlang Environment

    Författare :Johan Blom; Bengt Jonsson; Sven-Olof Nyström; Bernhard Aichernig; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Testing; Erlang; Model-Based Testing; Symbolic Execution; Communication Protocols; Datavetenskap; Computer Science;

    Sammanfattning : Testing is the dominant technique for quality assurance of software systems. It typically consumes considerable resources in development projects, and is often performed in an ad hoc manner. This thesis is concerned with model-based testing, which is an approach to make testing more systematic and more automated. LÄS MER

  7. 5. Symbolic Supervisory Control of Timed Discrete Event Systems

    Författare :Sajed Miremadi; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Supervisory Control Theory; Timed Discrete Event Systems; Extended Finite Automata; Binary Decision Diagrams.;

    Sammanfattning : With the increasing complexity of computer systems, it is crucial to have efficient design of correct and well-functioning hardware and software systems. To this end, it is often desired to control the behavior of systems to possess some desired properties. A specific class of systems is called discrete event systems (DES). LÄS MER