Search for dissertations about: "type based program analysis"
Showing result 1 - 5 of 80 swedish dissertations containing the words type based program analysis.
-
1. Type Based Techniques for Covert Channel Elimination and Register Allocation
Abstract : 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. READ MORE
-
2. Securing Interactive Systems
Abstract : 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. READ MORE
-
3. Tracking Information Flows in Interactive and Object-Oriented Programs
Abstract : 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. READ MORE
-
4. Demand-Driven Static Backward Program Slicing Based on Predicated Code Block Graphs
Abstract : 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. READ MORE
-
5. Combining and Strengthening Program Analysis and Verification
Abstract : 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. READ MORE