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 6 of 6 for “"Computer programs--Correctness"”.

  1. On the formal specification of recursive functions

    … D.)--Michigan State University. Department of Computer Science, 1995

    msu Repository record for On the formal specification of recursive functions (opens in a new tab)

  2. Low-cost and efficient architectural support for correctness and performance debugging

    With rapid growth in computer hardware technologies and architectures, software programs have become increasingly complex and error-prone. This software complexity has resulted in program crashes and even security threats. Correctness Debugging is making sure that the program does not exhibit any …

    gatech Repository record for Low-cost and efficient architectural support for correctness and performance debugging (opens in a new tab)

  3. Test Overfitting in Automated Program Repair: Measurements and Approaches Using Formal Methods

    … and evaluate generated candidate patches' correctness; thus, it is named dynamic APR. Test overfitting is one of the main challenges of dynamic APR tools, which is evident from several recent studies. Test overfitting means the repaired program is not correct based on the program's expected …

    ucf Repository record for Test Overfitting in Automated Program Repair: Measurements and Approaches Using Formal Methods (opens in a new tab)

  4. Translations to Support Loop Invariant Generation in JML

    … However, for Hoare-style verification of loop correctness, loop invariants are necessary but are difficult for people to write themselves. Since Java is one of the most popular programming languages in the world, it is useful to have a tool to generate loop invariants for Java programs. OpenJML …

    ucf Repository record for Translations to Support Loop Invariant Generation in JML (opens in a new tab)

  5. Quantifiability: Concurrent Correctness from First Principles

    … histories motivate a new approach to concurrent correctness. Desiderata for a new correctness condition are that it be independent of sequential histories, compositional over objects, flexible as to timing, modular as to semantics and free of inherent locking or waiting. This dissertation …

    ucf Repository record for Quantifiability: Concurrent Correctness from First Principles (opens in a new tab)