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 4 of 4 for “"Natural proofs"”.
-
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 …
-
The complexity of meta-computational problems
… to proving “barely” non-trivial lower bounds for natural problems like MCSP against weak circuit classes. In most interesting cases, we already have such required lower bounds, but for a different, seemingly easier problem. Firstly, we establish that instantiations of magnification for certain …
-
On learning from lower bounds
… a contribution of this thesis; the model arises naturally from Nisan's method, but remains independently motivated for future study. Generic transformations of circuit lower bounds proved by Nisan's method into nontrivial agnostic membership query learning algorithms, exact learning algorithms …
-
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, …