Advanced search
Found 5 essays matching the above criteria.
-
1. Automated inference of ACSL function contracts using TriCera
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : 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. READ MORE
-
2. Extracting scalable program models for TLA model checking
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Program verification has long been of interest to researchers and practitioners for its role in asserting reliability in critical systems. Many such systems feature reactive behavior, where temporal properties are of interest. Consequently, a number of systems and program verification tools for dealing with temporal logic have been developed. READ MORE
-
3. A contract language for modular specification and verification of temporal properties
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : 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. READ MORE
-
4. Verifying Temporal Properties Using Deductive Verifiers
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : 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. READ MORE
-
5. Provably Sound and Secure Automatic Proving and Generation of Verification Conditions
University essay from KTH/Teoretisk datalogi, TCSAbstract : Formal verification of programs can be done with the aid of an interactive theorem prover. The program to be verified is represented in an intermediate language representation inside the interactive theorem prover, after which statements and their proofs can be constructed. This is a process that can be automated to a high degree. READ MORE