Loop Verification with Invariants and Contracts

Korn—Software Verification with Horn Clauses (Competition Contribution)

“…Finally, Eldarica is executed for the remaining time. From past experience, it should be slightly better in comparison to Z3 in the long run on this specific set of tasks [10]. The generated invariants from Eldarica tend to be simpler and avoid the existential quantifiers often introduced by Z3, which improves witness generation.…”

“…Here the main distinction is that Korn uses a large block encoding, such that the verification conditions closely reflect the structure of the program. Korn offers a second verification approach with loop contracts [16,14,7]. This was the original motivation to develop the tool, and neither SeaHorn nor TriCera supports this feature, albeit it was not used for SV-COMP because it offers no advantages [10] and because the encoding of loop contracts into loop invariants would require quantifiers in the witnesses format.…”

“…Korn is developed and maintained by the author. G. Alexandru [1] and J. Blau have contributed insights to approach of loop contracts [7].…”

Exploring annotations for deductive verification

“…While most tools rely on loop invariants, there is a different approach namely loop contracts [Ern22]. A loop contract consists of a precondition and a relational postcondition.…”

Методы Комплексного Подхода К Автоматизации Дедуктивной Верификации Программ С Финитными Итерациями

“…Туэрк (Tuerk) [178] предлагает задавать для циклов предусловия и постусловия специального вида вместо ин вариантов. Обобщение данного подхода описано в статье Эрнста (Ernst) [79]. В работе Волкова и др.…”