Scalable Thread-Modular Approach for Data Race Detection

Andrianov, Pavel S.; Mutilin, Vadim

doi:10.1007/978-3-030-57663-9_24

Cited by 3 publications

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Accordingly, if no error state is found, the program is considered to be correct. Another possible property is absence of data races [8]. Theoretically, it can be expressed via reachability [9], however in practice it is more efficient to consider it separately.…”

Section: Software Model Checkingmentioning

confidence: 99%

Predicate Abstraction Refinement in Thread-Modular Analysis

Rudenchik,

Andrianov

2023

Proceedings of ISP RAS

View full text Add to dashboard Cite

Thread-modular approach over predicate abstraction is an efficient technique for software verification of complicated real-world source code. One of the main problems in the technique is a predicate abstraction refinement in a multithreaded case. A default predicate refiner considers only a path related to one thread, and does not refine the thread-modular environment. For instance, if we have applied an effect from the second thread to the current one, then the path in the second thread to the applied effect is not refined. Our goal was to develop a more precise refinement procedure, reusing a default predicate refiner to refine both: a path in a current thread and a path to an effect in the environment. The idea is to construct a joined boolean formula from these two paths. Since some variables may be common, a key challenge is to correctly rename and equate variables in two parts of the formula to accurately represent the way threads interact. It is essential to get reliable predicates that can potentially prove spuriousness of the path. The proposed approach is implemented on top of CPAchecker framework. It is evaluated on standard SV-COMP benchmark set, and the results show some benefit. Evaluation on the real-world software does not demonstrate significant accuracy increase, as the described flaw of predicate refinement is not the only reason of false positive results. While the proposed approach can successfully prove some specific paths to be spurious, it is not enough to fully prove correctness of some programs. However, the approach has further potential for improvements.

show abstract

Section: Software Model Checkingmentioning

confidence: 99%

Predicate Abstraction Refinement in Thread-Modular Analysis

Rudenchik,

Andrianov

2023

Proceedings of ISP RAS

View full text Add to dashboard Cite

show abstract

“…More information about the approach and theoretical preliminaries can be found in [1]. Practical application of the theory to the Linux kernel drivers can be found in [2].…”

Section: Fig 1 Computation Of a Thread Environment And Its Applicationmentioning

confidence: 99%

“…It allows constructing a predicate abstraction in a thread-modular case. More information about CPALockator may be found in [1,2]. First, we need to emphasize that the tool is targeted and used in practice for finding bugs in large industrial software systems, for example, operating system cores.…”

Section: Software Architecturementioning

confidence: 99%

cpalockator: Thread-Modular Analysis with Projections

Andrianov

Mutilin

Хорошилов

2021

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

Our submission to SV-COMP’21 is based on the software verification framework "Image missing" and implements the extension to the thread-modular approach. It considers every thread separately, but in a special environment which models thread interactions. The environment is expressed by projections of normal transitions in each thread. A projection contains a description of possible effects over shared data and synchronization primitives, as well as conditions of its application. Adjusting the precision of the projections, one can find a balance between the speed and the precision of the whole analysis.Implementation on the top of the "Image missing" framework allows combining our approach with existing algorithms and analyses. Evaluation on the sv-benchmarks confirms the scalability and soundness of the approach.

show abstract

RaceHunter Dynamic Data Race Detector

Gerlits

2024

Program Comput Soft

View full text Add to dashboard Cite

Scalable Thread-Modular Approach for Data Race Detection

Cited by 3 publications

References 17 publications

Predicate Abstraction Refinement in Thread-Modular Analysis

Predicate Abstraction Refinement in Thread-Modular Analysis

cpalockator: Thread-Modular Analysis with Projections

RaceHunter Dynamic Data Race Detector

Contact Info

Product

Resources

About