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 “"automated proofs"”.

  1. Termination of Narrowing: Automated Proofs and Modularity Properties

    En 1936 Alan Turing demostro que el halting problem, esto es, el problema de decidir si un programa termina o no, es un problema indecidible para la inmensa mayoria de los lenguajes de programacion. A pesar de ello, la terminacion es un problema tan relevante que en las ultimas decadas un gran …

    upv Repository record for Termination of Narrowing: Automated Proofs and Modularity Properties (opens in a new tab)

  2. Interaction Trees and Formal Specifications

    … Trees that enables efficient, syntactic automated proofs of properties of Interaction Trees.

    penn Repository record for Interaction Trees and Formal Specifications (opens in a new tab)

  3. Using Automata Theory to Solve Problems in Additive Number Theory

    … no number theory at all. Instead, we construct automated proofs using automata. The general proof technique is to build an appropriate machine, and then run decision algorithms to establish our theorems.

    waterloo Repository record for Using Automata Theory to Solve Problems in Additive Number Theory (opens in a new tab)

  4. New Methods for Analyzing the Properties of Automatic Sequences

    Automatic sequences and morphic words lie at the intersection of automata theory, logic, and combinatorics on words. Many of their structural properties can be formulated as logical predicates over integer representations and decided using automata. This thesis presents automata-based methods for …

    waterloo Repository record for New Methods for Analyzing the Properties of Automatic Sequences (opens in a new tab)