Deductive software verification-the key book
• There are IDEs for KeY, including an Eclipse extension, that make it easy to keep track of
proof obligations in larger projects [Hentschel et al., 2014c].• A stripped down version of …
proof obligations in larger projects [Hentschel et al., 2014c].• A stripped down version of …
OpenJDK's Java. utils. Collection. sort () is broken: the good, the bad and the worst case
We investigate the correctness of TimSort, which is the main sorting algorithm provided by
the Java standard library. The goal is functional verification with mechanical proofs. During …
the Java standard library. The goal is functional verification with mechanical proofs. During …
Deductive software verification
JC Filliâtre - International Journal on Software Tools for Technology …, 2011 - Springer
Deductive software verification, also known as program proving, expresses the correctness
of a program as a set of mathematical statements, called verification conditions. They are …
of a program as a set of mathematical statements, called verification conditions. They are …
Verification of non-functional programs using interpretations in type theory
JC Filliâtre - Journal of Functional Programming, 2003 - cambridge.org
We study the problem of certifying programs combining imperative and functional features
within the general framework of type theory. Type theory is a powerful specification …
within the general framework of type theory. Type theory is a powerful specification …
Verifying OpenJDK's sort method for generic collections
TimSort is the main sorting algorithm provided by the Java standard library and many other
programming frameworks. Our original goal was functional verification of TimSort with …
programming frameworks. Our original goal was functional verification of TimSort with …
Certification of Sorting Algorithms Using Theorema and Coq
Sorting is an operation that has very important practical applications, in particular for
instance in the storage and analysis of data related to the environment, climat change, etc …
instance in the storage and analysis of data related to the environment, climat change, etc …
Proof pearl: the KeY to correct and stable sorting
Proof Pearl: The KeY to Correct and Stable Sorting Page 1 DOI 10.1007/s10817-013-9300-y
Proof Pearl: The KeY to Correct and Stable Sorting Stijn de Gouw ·Frank de Boer ·Jurriaan Rot …
Proof Pearl: The KeY to Correct and Stable Sorting Stijn de Gouw ·Frank de Boer ·Jurriaan Rot …
Simpler proofs with decentralized invariants
JC Filliâtre - Journal of Logical and Algebraic Methods in …, 2021 - Elsevier
When verifying programs where the data have some recursive structure, it is natural to make
use of global invariants that are themselves recursively defined. Though this is …
use of global invariants that are themselves recursively defined. Though this is …
A logical analysis of aliasing in imperative higher-order functions
We present a compositional program logic for call-by-value imperative higher-order
functions with general forms of aliasing, which can arise from the use of reference names as …
functions with general forms of aliasing, which can arise from the use of reference names as …
Верификация предикатной программы пирамидальной сортировки с применением обратных трансформаций
ВИ Шелехов - Системная информатика, 2020 - elibrary.ru
Проводится дедуктивная верификация алгоритма классической пирамидальной
сортировки Дж. Вильямса, реализованного программой sort на языке Си в библиотеке …
сортировки Дж. Вильямса, реализованного программой sort на языке Си в библиотеке …