Avancerad sökning
Visar resultat 1 - 5 av 43 avhandlingar som matchar ovanstående sökkriterier.
1. Verification of Distributed Erlang Programs using Testing, Model Checking and Theorem Proving
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
2. Automated Theorem Proving with Extensions of 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
3. Proving Safety and Security of Binary Programs
Sammanfattning : With the increasing ubiquity of computing devices, their correct and secure operation is of growing importance. In particular, critical components that provide core functionalities or process sensitive data have to operate as intended. LÄS MER
4. Theory Exploration and Inductive Theorem Proving
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. Stålmarck's Method for Automated Theorem Proving in 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