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 3 of 3 for “"natural proofs"”.

  1. Testing in learning conjunctive invariants

    … our method in a verification engine that uses natural proofs for heap verification. We implement our method by running tests for linked list data structures and evaluate it by comparing the results to the original approach without testing. We also use an existing GPU verification tool, called …

    uiuc Repository record for Testing in learning conjunctive invariants (opens in a new tab)

  2. A Dual Perspective on Computational Complexity

    … and well-understood. On the other hand, proofs of hardness, or lower bounds as they are often called, seem to be elusive and relatively poorly understood. Perhaps the most famous conjectured lower bound is P ≠ NP, which informally states that there are problems whose solutions can be …

    mit Repository record for A Dual Perspective on Computational Complexity (opens in a new tab)

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

    … are amenable to automated reasoning using the natural proof strategy, a radically new approach to software verification. Dryad and the natural proof techniques are so far the most efficient logic-based approach that can verify the full correctness of a wide variety of challenging programs, …

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