Eliminating Concurrency Bugs in Multithreaded Software: An Approach Based on Control of Petri Nets

Lafortune, Stéphane; Wang, Yin; Reveliotis, Spyros

doi:10.1007/978-3-642-38697-8_2

Cited by 5 publications

(3 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One of the solutions that allow eliminating the occurrence of deadlock class errors is a project called Gadara [22], [60], [61], which used the previously mentioned Gadara nets. These nets are used in the state machine, which is built during the compilation process based on the application's source code, and then built on the basis of this net, the supervisor is injected into the application.…”

Section: ) Deadlockmentioning

confidence: 99%

Detection of Concurrency Errors in Multithreaded Applications Based on Static Source Code Analysis

Giebas

Wojszczyk

2021

IEEE Access

View full text Add to dashboard Cite

Computer systems that allow multithreaded execution of applications have become extremely common, even small portable devices operate in multithreaded mode. This is undoubtedly very convenient for users, but for programmers it is associated with many unwanted errors, which can occur after writing application code. These errors include race condition, deadlock, atomicity violation and order violation. The subject of this work is related to the detection of these errors in the process of static software analysis. The paper presents the author's model, which was then used to detect the above-mentioned occurrences, additionally each error has been discussed in detail. A tool supporting the detection of errors in multithreaded applications was also developed and the results of this tool were presented.

show abstract

Section: ) Deadlockmentioning

confidence: 99%

Detection of Concurrency Errors in Multithreaded Applications Based on Static Source Code Analysis

Giebas

Wojszczyk

2021

IEEE Access

View full text Add to dashboard Cite

show abstract

“…One of the solutions that make the elimination of deadlock possible is a project called Gadara [7,19,20]. This project focuses on placing a supervisor in a multithreaded application during the source code compilation process, within which an application state machine is also created using Petri Nets.…”

Section: Gadara Projectmentioning

confidence: 99%

Deadlocks Detection in Multithreaded Applications Based on Source Code Analysis

Giebas

Wojszczyk

2020

Applied Sciences

View full text Add to dashboard Cite

This paper extends multithreaded application source code model and shows how to using it to detect deadlocks in C language applications. Four known deadlock scenarios from literature can be detected using our model. For every scenario we created theorems and proofs whose fulfillment guarantees the occurrence of deadlocks in multithreaded applications. Paper also contains comparison of multithreaded application source code model and Petri nets and describe advantages and disadvantages both of them.

show abstract

“…The most common external methods are testing all the possible interleavings at runtime and embedding control logic at compiling time. For example, in Lafortune et al, Petri nets–based control logic is added into the source codes to eliminate concurrency problems. However, such methods may cause high cost.…”

Section: Introductionmentioning

confidence: 99%

Comparative modelling and verification of Pthreads and Dthreads

Yuan

Zhu

et al. 2017

J Software Evolu Process

View full text Add to dashboard Cite

The POSIX threads (Pthreads) library is a thread API for C/C++ to control parallel threads and spawn concurrent process flows. Programming in Pthreads usually suffers from undesirable deadlock, data race, and race condition problems due to the potential nondeterministic execution behaviors between parallel threads. Dthreads, as another multithreading model that re‐implements Pthreads, was proposed by Liu et al for efficient deterministic multithreading. They found out that, under specific test cases, Dthreads can effectively prevent data races. However, no comparison test has been made with Pthreads. To perform a formal comparison between Pthreads and Dthreads over deadlocks, data races, and race conditions, in this paper, we adopt CSP (communicating sequential processes) as a formal model for specifying part of API functions in Pthreads and Dthreads and illustrate the model construction using 4 classical example programs. By feeding the models into the model checker PAT (process analysis toolkit), we have verified that deadlocks and data races exist in Pthreads, but do not exist in Dthreads, for the considered programs. We have also found that neither of them can prevent race conditions. Our comparative modelling and verification of Pthreads and Dthreads show that though Dthreads cannot prevent all the deadlock situations, shown by verification results of another 2 example programs, Dthreads is better than Pthreads on eliminating data races and preventing deadlocks. Considering limited scalability of Dthreads, we have introduced a new programming model to support coarse granularity in bank transfer. Our modelling is also extended by covering the synchronization operations in Liu et al work.

show abstract

Eliminating Concurrency Bugs in Multithreaded Software: An Approach Based on Control of Petri Nets

Cited by 5 publications

References 34 publications

Detection of Concurrency Errors in Multithreaded Applications Based on Static Source Code Analysis

Detection of Concurrency Errors in Multithreaded Applications Based on Static Source Code Analysis

Deadlocks Detection in Multithreaded Applications Based on Source Code Analysis

Comparative modelling and verification of Pthreads and Dthreads

Contact Info

Product

Resources

About