Unbounded Lazy-CSeq: A Lazy Sequentialization Tool for C with unboundedly many Context Switches: (Competition Contribution)

Abstract

We describe a new CSeq module for the verification of multi-threaded
C programs with dynamic thread creation. This module implements a variation
of the lazy sequentialization algorithm implemented in Lazy-CSeq. The main
novelty is that we do not bound here the number of round-robin schedules in an
execution and the loops that do not contain a thread creation statement are not
unwound (and thus unboundedly many iterations can be considered). As in Lazy-
CSeq the number of thread creations per run is bounded as well as the depth of
recursive calls. For the experiments we use CPAChecker as backend

More information

Identifiers

Catalogue record

Export record