Realizability Checking of Contracts with Kind 2
Logic in Computer Science
2022-05-19 v1
Abstract
We present a new feature of the open-source model checker Kind 2 which checks whether a component contract is realizable; i.e., it is possible to construct a component such that for any input allowed by the contract assumptions, there is some output value that the component can produce that satisfies the contract guarantees. When the contract is proven unrealizable, it provides a deadlocking computation and a set of conflicting guarantees. This new feature can be used to detect flaws in component specifications and to ensure the correctness of Kind 2's compositional proof arguments.
Cite
@article{arxiv.2205.09082,
title = {Realizability Checking of Contracts with Kind 2},
author = {Daniel Larraz and Cesare Tinelli},
journal= {arXiv preprint arXiv:2205.09082},
year = {2022}
}