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 …

Cubicle CMurphi Szymanski at 0.30 s 8.04 s (8) 5m12s (10) 2h50m (12) German Baukus
7.03 s 0.74 s (4) 19m35s (8) 4h49m (10) German. CTC 3m23s 1.83 s (4) 43m46s (8)
12h35m (10) German pfs 3m58s 0.99 s (4) 22m56s (8) 5h30m (10) Chandra-Toueg 2h01m
5.68 s (4) 2m58s (5) 1h36m (6)