Concurrent program verification with Lazy sequentialization and interval analysis

NGUYEN, TRUC L, Fischer, Bernd, La Torre, Salvatore and Parlato, Gennaro (2017) Concurrent program verification with Lazy sequentialization and interval analysis In The 5th Edition of The International Conference on Networked sYStems. Springer. 15 pp.


[img] PDF lazy-cseq-abs - Accepted Manuscript
Restricted to Repository staff only

Download (245kB)


Lazy sequentialization has proven to be one of the most effective techniques for concurrent program verification. The Lazy-CSeq sequentialization tool performs a “lazy” code-to-code translation from a concurrent program into an equivalent non-deterministic sequential program, i.e., it preserves the valuations of the program variables along its executions. The obtained program is then analyzed using sequential bounded model checking tools. However, the sizes of the individual states still pose problems for further scaling. We therefore use abstract interpretation to minimize the representation of the concurrent program’s (shared global and thread-local) state variables. More specifically, we run the Frama-C abstract interpretation tool over the programs constructed by Lazy-CSeq to compute overapproximating intervals for all (original) state variables and then exploit CBMC’s bitvector support to reduce the number of bits required to represent these in the sequentialized program. We have implemented this approach in the last release of Lazy-CSeq and demonstrate the effectiveness of this approach; in particular, we show that it leads to large performance gains for very hard verification problems.

Item Type: Conference or Workshop Item (Paper)
Organisations: Electronics & Computer Science, Electronic & Software Systems
ePrint ID: 406362
Date :
Date Event
23 February 2017Accepted/In Press
Date Deposited: 10 Mar 2017 10:45
Last Modified: 16 Apr 2017 17:11
Further Information:Google Scholar

Actions (login required)

View Item View Item