Sökning: "type based program analysis"

Visar resultat 1 - 5 av 87 avhandlingar innehållade orden type based program analysis.

  1. 1. Type Based Techniques for Covert Channel Elimination and Register Allocation

    Författare :Johan Agat; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; type and effect systems; program analysis; functional languages; confidentiality; register allocation; privacy; computer security; covert timing channels; program transformation; information flow; type systems;

    Sammanfattning : As the title suggests, this thesis consists of two parts that address two rather different topics. The first part investigates secure information flow in sequential programs, with the aim of completely eliminating covert timing channels. The second part presents a technique to describe register allocation for a functional language. LÄS MER

  3. 2. Securing Interactive Systems

    Författare :Willard Thor Rafnsson; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; program analysis; concurrency; multi-threading; covert channels; semantics-based security; language-based security; information-flow security; runtime enforcement; parallelism; scheduling; program transformation; information-flow control; fairness;

    Sammanfattning : This thesis provides means to achieve end-to-end information-flow security in interactive systems. The elusiveness of this problem stems from the fact that interaction patterns, primitives, synchronous communication and nondeterminism combine in ways where seemingly innocuous systems compromise security in unexpected ways under interaction. LÄS MER

  4. 3. Tracking Information Flows in Interactive and Object-Oriented Programs

    Författare :Willard Thor Rafnsson; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; information security; privacy; static analysis; information flow; program analysis; confidentiality; dependency analysis;

    Sammanfattning : This thesis improves the current state of the art on information-flow control of interactive and object-oriented programs, respectively. Given a policy which specifies which information flows are permitted in a program, the objective here is to ensure that only flows satisfying the policy can occur. LÄS MER

  5. 4. Demand-Driven Static Backward Program Slicing Based on Predicated Code Block Graphs

    Författare :Husni Khanfar; Björn Lisper; Hans Hansson; Saad Mubeen; Daniel Hedin; Welf Löwe; Mälardalens högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Static Program Analysis; Static Program Slicing; Control Dependency;

    Sammanfattning : Static backward program slicing is a technique to compute the set of program statements, predicates and inputs that might affect the value of a particular variable at a program location. The importance of this technique comes from being an essential part of many critical areas such as program maintenance, testing, verification, debugging, among others. LÄS MER

  7. 5. Combining and Strengthening Program Analysis and Verification

    Författare :Tobias Gedell; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis is about methods for establishing semantic properties of programsand how those methods can be strengthened. Finding (semi-)algorithms fordeciding semantic properties is a non-trivial task and such algorithms will, bynecessity, give approximate answers. LÄS MER