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 746 for “"Correctness"”.

  1. Termination, correctness and relative correctness

    … a software fault is, the concept of relative correctness, the property of a program to be more-correct than another with respect to a given specification, is discussed. Subsequently, a feature of a program is a fault (for a given specification) only because there exists an alternative to it …

    njit Repository record for Termination, correctness and relative correctness (opens in a new tab)

  2. Modular Compilers and Their Correctness Proofs

    This thesis explores the construction and correctness of modular compilers. Modular compilation is a compiler construction technique allowing the construction of compilers for high-level programming languages from reusable compiler building blocks. Modular compilers are defined in terms of …

    uiuc Repository record for Modular Compilers and Their Correctness Proofs (opens in a new tab)

  3. Composition and correctness of heterogeneous planning systems

    … analysis methods to address the particular correctness needs of composite planning systems. Applying formal methods to model the internal communications of planning architectures is a promising way to address this gap.

    mit Repository record for Composition and correctness of heterogeneous planning systems (opens in a new tab)

  4. Correctness of vehicle control systems a case study

    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.

    mit Repository record for Correctness of vehicle control systems a case study (opens in a new tab)

  5. New Techniques to Verify Timing Correctness of Integrated Circuits

    A preliminary study of the relationship between false paths and delay fault testing is also presented. We first show an example where a circuit that does not have any delay variations behaves incorrectly during normal operation due to the common assumptions on false paths used in determining the …

    uiuc Repository record for New Techniques to Verify Timing Correctness of Integrated Circuits (opens in a new tab)

  6. Automatic techniques for proving correctness of heap-manipulating programs

    … embedded systems and cloud systems. The correctness of these programs, especially for security, is highly desirable, as they should provide a trustworthy platform for higher-level applications and the end-users. Unfortunately, due to its inherent complexity, the verification process of …

    uiuc Repository record for Automatic techniques for proving correctness of heap-manipulating programs (opens in a new tab)

  7. Attention: not just another dataset for patch-correctness checking

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-09-01 without embargo terms

    uiuc Repository record for Attention: not just another dataset for patch-correctness checking (opens in a new tab)

  8. Correctness proofs of the Peterson-Fischer mutual exclusion algorithms

    Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1989.

    mit Repository record for Correctness proofs of the Peterson-Fischer mutual exclusion algorithms (opens in a new tab)

  9. Verification of full functional correctness for imperative linked data structures

    We present the verification of full functional correctness for a collection of imperative linked data structures implemented in Java. A key technique that makes this verification possible is a novel, integrated proof language that we have developed within the context of the Jahob program …

    mit Repository record for Verification of full functional correctness for imperative linked data structures (opens in a new tab)

  10. Explanation Alignment: Quantifying the Correctness of Model Reasoning At Scale

    To improve the reliability of machine learning models, researchers have developed metrics to measure the alignment between model saliency and human explanations. Thus far, however, these saliency-based alignment metrics have been used to conduct descriptive analyses and instance-level evaluations …

    mit Repository record for Explanation Alignment: Quantifying the Correctness of Model Reasoning At Scale (opens in a new tab)

  11. Verification of correctness properties of programs that read input files

    This thesis presents new techniques for verifying correctness properties of programs that process input files. These techniques apply to programs written in standard programming languages such as C and focus on relationships that must hold between program execution points, the current location of …

    mit Repository record for Verification of correctness properties of programs that read input files (opens in a new tab)

  12. On the Local Correctness of L1-minimization for Dictionary Learning Algorithm

    Item withdrawn by Rebecca Bryant (rabryant@illinois.edu) on 2011-12-01T20:45:07Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 GENG_QUAN.pdf: 460059 bytes, checksum: 9fe702d7efe57d2efd8da6d4af67f05b (MD5)

    uiuc Repository record for On the Local Correctness of L1-minimization for Dictionary Learning Algorithm (opens in a new tab)

  13. Correctness, Precision and Efficiency in the Sharing Analysis of Real Logic Languages

    … a practical sharing analysis tool, such as the correctness, the precision and the efficiency of the analysis, have lacked satisfactory solutions. The thesis reports on our work in rectifying this situation and, thereby, enhancing the state-of-the-art on sharing analysis. Our contributions …

    whiterose Repository record for Correctness, Precision and Efficiency in the Sharing Analysis of Real Logic Languages (opens in a new tab)

  14. Misheard Me Oronyminator: Using Oronyms to Validate the Correctness of Frequency Dictionaries

    <p>In the field of speech recognition, an algorithm must learn to tell the difference between "a nice rock" and "a gneiss rock". These identical-sounding phrases are called oronyms. Word frequency dictionaries are often used by speech recognition systems to help resolve phonetic sequences with more …

    calpoly Repository record for Misheard Me Oronyminator: Using Oronyms to Validate the Correctness of Frequency Dictionaries (opens in a new tab)

  15. Proving correctness of a controller algorithm for the RAID Level 5 system

    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.

    mit Repository record for Proving correctness of a controller algorithm for the RAID Level 5 system (opens in a new tab)

  16. Enhancing Input/Output Correctness, Protection, Performance, and Scalability for Process Control Platforms

    Most modern control systems use digital controllers to ensure safe operation. We modify the traditional digital control system architecture to integrate a new component known as a trusted input/output processor (TIOP). TIOP interface to the inputs (sensors) and outputs (actuators) of the system …

    vt Repository record for Enhancing Input/Output Correctness, Protection, Performance, and Scalability for Process Control Platforms (opens in a new tab)

  17. Detecting Persistence Bugs from Non-volatile Memory Programs by Inferring Likely-correctness Conditions

    … and automatic manner by inferring likely-correctness conditions from programs. A likely-correctness condition is a possible correctness condition, which is a condition a program must maintain to make the program crash-consistent. This dissertation proposes to infer two forms of …

    vt Repository record for Detecting Persistence Bugs from Non-volatile Memory Programs by Inferring Likely-correctness Conditions (opens in a new tab)

  18. A component-based approach to proving the correctness of the Schorr-Waite algorithm

    … a component-based approach to proving the correctness of programs involving pointers. Unlike previous work, our component-based approach supports modular reasoning, which is essential to the scalability of systems. Specifically, we specify the behavior of a graph-marking algorithm known as …

    vt Repository record for A component-based approach to proving the correctness of the Schorr-Waite algorithm (opens in a new tab)

Page 1 of 38