Invariants for finite instances and beyond

Sylvain Conchon, Amit Kumar Goel, Sava Krstić, Alain Mebsout, Fatiha Zaïdi

2013 · 36 citations · 15 references

DOIFull text

Open access

Concepts

Abstract

Verification of safety properties of concurrent programs with an arbitrary numbers of processes is an old challenge. In particular, complex parameterized protocols like FLASH are still out of the scope of state-of-the-art model checkers. In this paper, we describe a new algorithm, called BRAB, that is able to automatically infer invariants strong enough to prove a protocol like FLASH. BRAB computes over-approximations of backward reachable states that are checked to be unreachable in a finite instance of the system. These approximations (candidate invariants) are then model checked together with the original safety properties. Completeness of the approach is ensured by a mechanism for backtracking on spurious traces introduced by too coarse approximations.

References

15