Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 35 for “"Correctness proof"”.

  1. Security modeling and correctness proof using Specware and Isabelle

    … Specware to Isabelle Interface, to be proven for correctness in Isabelle which is a generic, interactive theorem proving environment. It is found that the translation between Specware and Isabelle is almost seamless and there is much potential in the use of Isabelle/HOL to discharge proof …

    nps Repository record for Security modeling and correctness proof using Specware and Isabelle (opens in a new tab)

  2. Non-Blocking Data Structures Handling Multiple Changes Atomically

    … location of its cursor. We provide a detailed proof of correctness for our list implementation. We also give an amortized analysis for our list implementation, which is the first upper bound on amortized time complexity that has been proved for a concurrent doubly-linked list. In addition, we …

    york Repository record for Non-Blocking Data Structures Handling Multiple Changes Atomically (opens in a new tab)

  3. Analysis and synthesis of inductive families

    … typed functional programming language, in which proofs and programs are treated as the same entities. Two modes of programming can then be distinguished: in externalism, we construct a program separately from its correctness proof with respect to a given specification, whereas in internalism, we …

    oxford Restricted access

  4. Deadlock and deadlock freedom

    … We also show that the problem of proving total correctness may be translated to one of proving deadlock freedom, with the consequence that our techniques for proving deadlock freedom may be utilised to effect a total correctness proof.</p>

    oxford Repository record for Deadlock and deadlock freedom (opens in a new tab)

  5. Analysis and synthesis of inductive families

    … typed functional programming language, in which proofs and programs are treated as the same entities. Two modes of programming can then be distinguished: in <em>externalism</em>, we construct a program separately from its correctness proof with respect to a given specification, whereas in …

    oxford Repository record for Analysis and synthesis of inductive families (opens in a new tab)

  6. Verified Function Inlining Optimization fro the PureCake Compiler

    … and verified using the HOL4 theorem prover. The correctness proof of inlining is defined at two levels of abstraction. The meta-theory level and the compiler level. The implementation is heuristic agnostic and can be used with any inlining strategy. The thesis also describes a function …

    chalmers Repository record for Verified Function Inlining Optimization fro the PureCake Compiler (opens in a new tab)

  7. On the formal verification of an intrusion-tolerant group communication protocol

    … and Group Key Management. Then we derive a correctness proof for the whole protocol using an adaptive combination of techniques, namely, model checking, theorem proving and mathematical analysis. We use the Murphi model checking tool to verify authentication , then the PVS theorem prover to …

    concordia Download PDF for On the formal verification of an intrusion-tolerant group communication protocol (opens in a new tab)

  8. Modeling an algebraic stepper

    Programmers rely on the correctness of their tools. Semanticists have long studied the correctness of compilers, but we make the case that other tools deserve semantic models, too, and that using these models can help in developing these tools. We examine these ideas in the context of DrScheme's …

    rice Repository record for Modeling an algebraic stepper (opens in a new tab)

  9. Formal Verification Techniques for Safety Critical Medical Device Software Control

    … cation methodology that can be used to check the correctness of object code programs that implement the safety-critical control functions of these medical devices. Our methodology is based on the theory of Well-Founded Equivalence Bisimulation (WEB) re nement, where both formal speci cations and …

    ndsu Repository record for Formal Verification Techniques for Safety Critical Medical Device Software Control (opens in a new tab)

  10. An Implementation of Separation Logic in Coq

    For certain applications, the correctness of software involved is crucial, particularly if human life is in danger. In order to achieve correctness, common practice is to gather evidence for program correctness by testing the system. Even though testing may find certain errors in the code, it …

    brock Repository record for An Implementation of Separation Logic in Coq (opens in a new tab)

  11. MULTI-CORE PARALLEL GRAPH ALGORITHMS

    … graph algorithms from the algorithm design, correctness proof, and performance analysis. Our experiments on multicore machines show significant speedups over various real and synthetic graphs.

    mcmaster Repository record for MULTI-CORE PARALLEL GRAPH ALGORITHMS (opens in a new tab)

  12. Two algorithms for leader election and network size estimation in mobile ad hoc networks

    … algorithm for asynchronous MANETs along with a correctness proof for it. Our work involves substantial modifications of an existing algorithm and its proof, and we adapt the existing algorithm to the asynchronous environment. Our algorithm’s running time and message complexity compare favorably …

    tamu Repository record for Two algorithms for leader election and network size estimation in mobile ad hoc networks (opens in a new tab)

  13. Traces, interpolants, and automata : a new approach to automatic software verification

    … is the task of constructing a mathematical proof that shows the correctness of a program. Manual software verification is error-prone, time consuming, and impractical for large programs. Automatic software verification is a promising technique, but even state-of-the-art verification tools …

    freiburg-diss Repository record for Traces, interpolants, and automata : a new approach to automatic software verification (opens in a new tab)

  14. Pushing the Limits of Compiler Verification

    Modern computer systems rely on the correctness of at least one compiler for correct operation. Formal verification is a powerful technique for constructing correct systems. While there have been many efforts to develop formally verified compilers, those compilers are still not widely used. In this …

    washington Repository record for Pushing the Limits of Compiler Verification (opens in a new tab)

  15. POSIX Regular Expression Matching and Lexing

    … to classify tokens.<br/><br/>While a formalised correctness proof for Sulzmann and Lu’s algorithm already exists, this proof does not include any of the crucial simplification rules. These simplification rules are however necessary in order to have an acceptable runtime for this algorithm. Our …

    kings Repository record for POSIX Regular Expression Matching and Lexing (opens in a new tab) Download PDF for POSIX Regular Expression Matching and Lexing (opens in a new tab)

  16. Region-based Program Specialization

    … allocation and deallocation explicit. The formal correctness proof of our novel specialization technique based on a region type system requires two theoretical building blocks: a type soundness proof for the region calculus and a correctly proven equational theory between region-annotated terms. …

    freiburg-diss Repository record for Region-based Program Specialization (opens in a new tab)

  17. Secure architectures on a verified microkernel

    … us an unprecedented level of assurance for the correctness of system initialisation. Our proof formally connects to the existing functional correctness proof of the seL4 microkernel. In the process of this work, we develop a custom separation algebra, with a fine-level of granularity, for …

    unsw Repository record for Secure architectures on a verified microkernel (opens in a new tab)

  18. Construct by Contract: Construct by Contract: An Approach for Developing Reliable Software

    … as contracts from the client’s desires to the correctness proof in verification stage, especially in everyday-used software like web applications, mobile applications and desktop application. Such methodology can be converted in a single integrated workspace as standalone tool to develop …

    maynooth Download PDF for Construct by Contract: Construct by Contract: An Approach for Developing Reliable Software (opens in a new tab)

  19. Data flow in program verification

    … questions. 1. The analogue to classical Floyd proofs in the data flow view are data flow proofs. What is their potential and what are their limitations? 2. Data flow becomes much more complex in the presence of arrays. Can we develop a scalable abstract domain that is powerful enough to find a …

    freiburg-diss Repository record for Data flow in program verification (opens in a new tab)

Page 1 of 2