1. A Lazy Sequentialization Tool for Unbounded Context Switches
Unbounded Lazy-CSeq
A Lazy Sequentialization Tool for
C Programs with
Unbounded Context Switches
Truc Lam Nguyen
University of Southampton, UK
Bernd Fischer
Stellenbosch University, South Africa
Salvatore La Torre
University of Salerno, Italy
Gennaro Parlato
University of Southampton, UK

2. P P’ Unbounded Lazy-Cseq Predicate Abstraction Tool P’ equivalent to P
problem: analysis of concurrent program
approach: reduction to sequential analysis
inlining,
loop preserving
,...
Unbounded Lazy-Cseq
Predicate Abstraction Tool P P’
Unbounded context switches
CPAChecker
concurrent
C program
sequential
C program
P’ equivalent to P

3. Overview Threads T1 Tn Main driver Simulation function
thread function t1(){...}
GUARD S1;
GUARD S2;
GUARD Sm;
thread function tn(){...}
Simulation function
while (true) {
t1(); …
tn(); } T1 Tn
Main driver

4. Features Support dynamic thread creation with
bounded number of threads
explicit context switch points in thread
Support unbounded number of context switches
Preserve (in)finite loops
Can provide actual correctness proof

5. users.ecs.soton.ac.uk/gp4/cseq
Thank you!
users.ecs.soton.ac.uk/gp4/cseq