Lazy Sequentialization for the Safety Verification of Unbounded Concurrent Programs

Nguyen, Truc L.; Fischer, Bernd; Torre, Salvatore La; Parlato, Gennaro

doi:10.1007/978-3-319-46520-3_12

Cited by 18 publications

(9 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here, we automate this reduction and integrate abstract interpretation into the lazy sequentialization described in [6], in order to minimize the representation of the concurrent program's state variables, and to scale up sequentialization to more complex concurrent verification tasks. This integration of abstract interpretation is the main novelty of Lazy-CSeq 2.0 over previous versions [5,8].…”

Section: Verification Approachmentioning

confidence: 93%

Lazy-CSeq 2.0: Combining Lazy Sequentialization with Abstract Interpretation

Nguyen

Inverso

Fischer

et al. 2017

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

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 therefore 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.

show abstract

Section: Verification Approachmentioning

confidence: 93%

Lazy-CSeq 2.0: Combining Lazy Sequentialization with Abstract Interpretation

Nguyen

Inverso

Fischer

et al. 2017

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…Unbounded model checking [20,40,33,18] is a technique to verify the correctness of potentially non-terminating programs. In our setting, we deploy algorithms that use abstract reachability trees (ARTs) [22,29,40] to represent the already explored state space and schedules, and perform this exploration in a forward manner.…”

Section: Related Workmentioning

confidence: 99%

Extracting Safe Thread Schedules from Incomplete Model Checking Results

Metzler

Suri

Weißenbacher

2019

Model Checking Software

View full text Add to dashboard Cite

Model checkers frequently fail to completely verify a concurrent program, even if partial-order reduction is applied. The verification engineer is left in doubt whether the program is safe and the effort towards verifying the program is wasted. We present a technique that uses the results of such incomplete verification attempts to construct a (fair) scheduler that allows the safe execution of the partially verified concurrent program. This scheduler restricts the execution to schedules that have been proven safe (and prevents executions that were found to be erroneous). We evaluate the performance of our technique and show how it can be improved using partial-order reduction. While constraining the scheduler results in a considerable performance penalty in general, we show that in some cases our approachsomewhat surprisingly-even leads to faster executions.

show abstract

“…Lazy-CSeq [16] avoids such recomputations and achieves efficiency by handling context-switches with a very lightweight and decentralized control code. Lazy-CSeq has been recently extended to handle relaxed memory models [34] and to prove correctness [25].…”

Section: Related Workmentioning

confidence: 99%

Concurrent Program Verification with Lazy Sequentialization and Interval Analysis

et al. 2017

Self Cite

View full text Add to dashboard Cite

Abstract. 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.

show abstract

Lazy Sequentialization for the Safety Verification of Unbounded Concurrent Programs

Cited by 18 publications

References 29 publications

Lazy-CSeq 2.0: Combining Lazy Sequentialization with Abstract Interpretation

Lazy-CSeq 2.0: Combining Lazy Sequentialization with Abstract Interpretation

Extracting Safe Thread Schedules from Incomplete Model Checking Results

Concurrent Program Verification with Lazy Sequentialization and Interval Analysis

Contact Info

Product

Resources

About