Sökning: "program correctness"
Visar resultat 1 - 5 av 61 avhandlingar innehållade orden program correctness.
1. Functional Program Correctness Through Types
Sammanfattning : This thesis addresses the problem of avoiding errors in functionalprograms. The thesis has three parts, discussing different aspects ofprogram correctness, with the unifying theme that types are anintegral part of the methods used to establish correctness. LÄS MER
2. Induction Rules for Proving Correctness of Imperative Programs
Sammanfattning : This thesis is aimed at simplifying the user-interaction in semi-interactive theorem proving for imperative programs. More specifically, we describe the creation of customised induction rules that are tailor-made for the specific program to verify and thus make the resulting proof simpler. LÄS MER
3. Demand-Driven Static Backward Program Slicing Based on Predicated Code Block Graphs
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
4. Testing and Proving using Narrowing
Sammanfattning : In order to know if a program is correct a specification of its intended behaviour must be stated. The two main activities concerning program correctness are testing and verification. LÄS MER
5. Type Based Techniques for Covert Channel Elimination and Register Allocation
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