Sökning: "theorem-proving."

Visar resultat 1 - 5 av 30 avhandlingar innehållade ordet theorem-proving..

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

   Författare :Hans Svensson; Chalmers tekniska högskola; []
   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

3. 2. Automated Theorem Proving with Extensions of First-Order Logic

   Författare :Evgenii Kotelnikov; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; 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

4. 3. Theory Exploration and Inductive Theorem Proving

   Författare :Dan Rosén; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

   Sammanfattning : We have built two state-of-the-art inductive theorem provers named HipSpec and Hipster. The main issue when automating proofs by induction is to discover essential helper lemmas. Our theorem provers use the technique theory exploration, which is a method to systematically discover interesting conclusions about a mathematical theory. LÄS MER

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

   Författare :Magnus Björk; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; 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

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

   Författare :Evgenii Kotelnikov; Chalmers tekniska högskola; []
   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