Lazy-CSeq 2.0: combining lazy sequentialization with abstract interpretation: (Competition contribution)


NGUYEN, TRUC L, Inverso, Omar, Fischer, Bernd, La Torre, Salvatore and Parlato, Gennaro, (2017) Lazy-CSeq 2.0: combining lazy sequentialization with abstract interpretation: (Competition contribution) Legay, Axel and Margaria, Tiziana (eds.) In Tools and Algorithms for the Construction and Analysis of Systems: 23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, P. Springer. 4 pp.

Download

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

Download (55kB)

Description/Abstract

Lazy sequentialization has emerged as one of the most effective techniques to find bugs in concurrent programs. However, the size of the shared global and thread-local state still poses a problem for further scaling. We there- fore use abstract interpretation to minimize the representation of the concurrent program’s state variables. More specifically, we run the Frama-C abstract interpretation tool over the sequentialized program output by Lazy-CSeq to compute over-approximating 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 demonstrate that this leads to substantial performance gains on complex instances.

Item Type: Conference or Workshop Item (Paper)
ISBNs: 783662545805 (electronic)
Venue - Dates: 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017-02-27
Organisations: Electronic & Software Systems
ePrint ID: 406349
Date :
Date Event
23 February 2017Published
Date Deposited: 10 Mar 2017 10:45
Last Modified: 10 Mar 2017 10:45
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/406349

Actions (login required)

View Item View Item