Untitled

Kavi, Krishna M.; Moshtaghi, Alireza; Chen, Deng-Jyi

doi:10.1023/a:1019917329895

Cited by 28 publications

(4 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Shared resources were omitted. Representation of the AP1 application in the form of PN is also not fully compatible with the representation that would be created if all the principles described in work [23] were applied. However, PN simplification does not adversely affect the process of locating the resource conflict, causing the deadlock.…”

Section: Deadlock Detection Using Petri Netsmentioning

confidence: 98%

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

Section: Deadlock Detection Using Petri Netsmentioning

confidence: 98%

Deadlocks Detection in Multithreaded Applications Based on Source Code Analysis

Giebas

Wojszczyk

2020

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…Sometimes more complicated mechanisms such as conditional variables are used. However, their use may lead to an error called "lost signal", the symptoms of which may be similar to deadlock [63].…”

Section: E Order Violationmentioning

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

“…Kavi et al [33] present PN components for the synchronization primitives in the Pthread library for C/C++, including condition variables. However, their modelling of CVs just allows the synchronization between two threads, and no argument is presented on how to use it with more threads.…”

Section: Conversion To Petri Netsmentioning

confidence: 99%

“…Finally, Van der Aalst et al [34] present strategies for modelling complex parallel applications as CPNs. We borrow many ideas from this work, especially the modelling of hierarchical CPNs.…”

Section: Conversion To Petri Netsmentioning

confidence: 99%

Specification and verification of synchronization with condition variables

Gomes

Gurov

Huisman

et al. 2018

Science of Computer Programming

View full text Add to dashboard Cite

a r t i c l e i n f o a b s t r a c tThis paper proposes a technique to specify and verify the correct synchronization of concurrent programs with condition variables. We define correctness of synchronization as the liveness property: "every thread synchronizing under a set of condition variables eventually exits the synchronization block", under the assumption that every such thread eventually reaches its synchronization block. Our technique does not avoid the combinatorial explosion of interleavings of thread behaviours. Instead, we alleviate it by abstracting away all details that are irrelevant to the synchronization behaviour of the program, which is typically significantly smaller than its overall behaviour. First, we introduce SyncTask, a simple imperative language to specify parallel computations that synchronize via condition variables. We consider a SyncTask program to have a correct synchronization iff it terminates. Further, to relieve the programmer from the burden of providing specifications in SyncTask, we introduce an economic annotation scheme for Java programs to assist the automated extraction of SyncTask programs capturing the synchronization behaviour of the underlying program. We show that every Java program annotated according to the scheme (and satisfying the assumption mentioned above) has a correct synchronization iff its corresponding SyncTask program terminates. We then show how to transform the verification of termination of the SyncTask program into a standard reachability problem over Coloured Petri Nets that is efficiently solvable by existing Petri Net analysis tools. Both the SyncTask program extraction and the generation of Petri Nets are implemented in our STaVe tool. We evaluate the proposed framework on a number of test cases. C. Gomes), dilian @kth .se (D. Gurov), m .huisman @utwente .nl (M. Huisman), artho @kth .se (C. Artho).

show abstract

Untitled

Cited by 28 publications

References 5 publications

Deadlocks Detection in Multithreaded Applications Based on Source Code Analysis

Deadlocks Detection in Multithreaded Applications Based on Source Code Analysis

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

Specification and verification of synchronization with condition variables

Contact Info

Product

Resources

About