Sökning: "automated theorem proving"

Visar resultat 1 - 5 av 13 avhandlingar innehållade orden automated theorem proving.

  1. 1. Automated Theorem Proving with Extensions of First-Order Logic

    Författare :Evgenii Kotelnikov; Chalmers University of Technology; []
    Nyckelord :NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; NATURAL SCIENCES; clausal normal form; Program Verification; automated theorem proving; program analysis; TPTP; Vampire; first-order logic;

    Sammanfattning : Automated theorem provers are computer programs that check whether a logical conjecture follows from a set of logical statements. The conjecture and the statements are expressed in the language of some formal logic, such as first-order logic. LÄS MER

  2. 2. Stålmarck's Method for Automated Theorem Proving in First Order Logic

    Författare :Magnus Björk; Chalmers University of Technology; []
    Nyckelord :automated theorem proving; Stålmarck s method; tableaux; first order logic;

    Sammanfattning : We present an extension of Stålmarck's method to classical first order predicate logic. Stålmarck's method is a satisfiability checking method for propositional logic, and it resembles tableaux and KE. Its most distinctive feature is the dilemma rule, which is an extended branching rule, that allows branches to be recombined. LÄS MER

  3. 3. Automated Theorem Proving in a First-Order Logic with First class Boolean Sort

    Författare :Evgenii Kotelnikov; Chalmers University of Technology; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; first-order logic; program analysis; program verification; TPTP; automated theorem proving; Vampire;

    Sammanfattning : Automated theorem proving is one of the central areas of computer mathematics. It studies methods and techniques for establishing validity of mathematical problems using a computer. The problems are expressed in a variety of formal logics, including first-order logic. LÄS MER

  4. 4. Deductive Program Analysis with First-Order Theorem Provers

    Författare :Simon Robillard; Chalmers University of Technology; []
    Nyckelord :NATURVETENSKAP; TEKNIK OCH TEKNOLOGIER; HUMANIORA; NATURAL SCIENCES; ENGINEERING AND TECHNOLOGY; HUMANITIES; Automated theorem proving; Program semantics; Program Verification; Program analysis; Automated reasoning; First-order logic;

    Sammanfattning : Software is ubiquitous in nearly all aspects of human life, including safety-critical activities. It is therefore crucial to analyze programs and provide strong guarantees that they perform as expected. LÄS MER

  5. 5. Verification of Distributed Erlang Programs using Testing, Model Checking and Theorem Proving

    Författare :Hans Svensson; Chalmers University of Technology; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; distributed algorithms; fault-tolerance; theorem proving; verification; distributed programming; Erlang; model checking; testing;

    Sammanfattning : Software infiltrates every aspect of modern society. Production, transportation, entertainment, and almost every other sphere that influences modern living are either directly or indirectly dependent on software systems. LÄS MER