Použitie separačnej logiky pre dokazovanie korektnosti programov
Loading...
Files
Downloads
0
Date issued
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Vysoká škola báňská – Technická univerzita Ostrava
Location
Signature
Abstract
This master's thesis deals with formal method of proving programs correctness with the help of separation logic. The thesis explains separation logic in general and presents a Coq library designed to work with separation logic. Using this library, the thesis formally proves the correctness of the list reversal algorithm, the height of binary tree algorithm, and the Schorr-Waite algorithm.
Description
Subject(s)
separation logic, proof of program correctness, Coq, library, list reversal, height of binary tree, Schorr-Waite algorithm