Search for dissertations about: "proving"

Showing result 1 - 5 of 149 swedish dissertations containing the word proving.

  1. 1. Proving and Disproving in Dynamic Logic for Java

    University dissertation from Göteborg : Chalmers University of Technology

    Author : Philipp Rümmer; Göteborgs universitet.; Gothenburg University.; [2006]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; theorem proving; disproving; dynamic logic; program verification; testing;

    Abstract : This thesis is about proving the functional correctness and incorrectness of imperative, object-oriented programs. One of the main approaches for the first item is deductive program verification, whereas the second item is traditionally handled by techniques like testing. READ MORE

  2. 2. Testing and Proving using Narrowing

    University dissertation from Göteborg : Göteborg University

    Author : Fredrik Lindblad; Göteborgs universitet.; Gothenburg University.; [2007]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; program correctness; software testing; formal verification; proof construction; dependent types; type theory; narrowing;

    Abstract : In order to know if a program is correct a specification of its intended behaviour must be stated. The two main activities concerning program correctness are testing and verification. READ MORE

  3. 3. Exercising Mathematical Competence: Practising Representation Theory and Representing Mathematical Practice

    University dissertation from Göteborg : Göteborg University

    Author : Anna Ida Säfström; Göteborgs universitet.; Gothenburg University.; [2013]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Mathematical competence; exercising competencies; young children; whole number arithmetic; tertiary level; proving; highest weight representation; tensor product decomposition; skew-symmetric matrix; moment map; infinite dimensional unitary representation;

    Abstract : This thesis assembles two papers in mathematics and two papers in mathematics education. In the mathematics part, representation theory is practised. Two Clebsch-Gordan type problems are addressed. READ MORE

  4. 4. Induction Rules for Proving Correctness of Imperative Programs

    University dissertation from Göteborg : Chalmers University of Technology

    Author : Angela Wallenburg; Göteborgs universitet.; Gothenburg University.; Göteborgs universitet.; Gothenburg University.; [2004]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; program verification; software testing; interactive theorem proving; mathematical induction; customised induction rules;

    Abstract : This thesis is aimed at simplifying the user-interaction in semi-interactive theorem proving for imperative programs. More specifically, we describe the creation of customised induction rules that are tailor-made for the specific program to verify and thus make the resulting proof simpler. READ MORE

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

    University dissertation from Göteborg : Chalmers University of Technology

    Author : Hans Svensson; [2008]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; distributed algorithms; fault-tolerance; theorem proving; verification; distributed programming; Erlang; model checking; testing;

    Abstract : 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. READ MORE