Sökning: "Hoare logik"

Hittade 3 uppsatser innehållade orden Hoare logik.

  1. 1. Automated inference of ACSL function contracts using TriCera

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Jesper Amilon; [2021]
    Nyckelord :Formal Verification; Contract inference; Hoare Logic; Model Checking; Horn clauses; Formell verifikation; Kontraktgenerering; Formell semantik; Hoare logik; Modellprovning; Horn clauses;

    Sammanfattning : This thesis explores synergies between deductive verification and model checking, by using the existing model checker TriCera to automatically infer specifications for the deductive verifier Frama-C. To accomplish this, a formal semantics is defined for a subset of ANSI C, extended with assume statements, called Csmall. LÄS MER

  3. 2. A contract language for modular specification and verification of temporal properties

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Lars Hummelgren; [2020]
    Nyckelord :;

    Sammanfattning : Deductive software verification is used to prove correctness of programs with respect to contracts. Contracts are commonly expressed on procedures of a program using Hoare logic. LÄS MER

  4. 3. Verifying Temporal Properties Using Deductive Verifiers

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Jesper Amilon; Axel Lindeberg; [2019]
    Nyckelord :;

    Sammanfattning : Formal verification is an area of theoretical computer science where mathematical logic is used to prove that a program behaves in a certain way. With the methods in formal verification, you can prove that the program follows some given specification and thereby behaves in the desired way. The area is largely split up into two distinct parts. LÄS MER