FERA: A Framework for Critical Assessment of Execution Monitoring Based Approaches for Finding Concurrency Bugs

Jahic, Jasmin; Bauer, Thomas W.; Kuhn, Thomas S.; Wehn, Norbert; Antonino, Pablo Oliveira

doi:10.1007/978-3-030-52249-0_5

Cited by 2 publications

(3 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Synchronization primitives are widely used in today's multithreaded programs [1,2,3]. However, many concurrency bugs including data races [4,5,6], and deadlocks [7,8,9] may happen if synchronization mechanisms are not properly designed.…”

Section: Introductionmentioning

confidence: 99%

“…The latter situation will cause false positives. (2) Causal dependency of operations belong to different threads can be caused by thread start or join operations. However, that is not all.…”

Section: Introductionmentioning

confidence: 99%

“…denotes the local configuration of e and   e the cardinality of this latter 2. For a P/T-net( )Min N is defined as the set…”

mentioning

confidence: 99%

See 2 more Smart Citations

Petri Net Unfolding-Based Detection and Replay of Program Deadlocks

Lu,

Lv,

Cui

et al. 2024

IEEE Access

View full text Add to dashboard Cite

Program deadlock detection plays an important role in ensuring the stability of software systems. In view of the high efficiency and low false alarm rate, dynamic deadlock analysis methods are widely studied. However, existing dynamic analysis methods use lock graph or its extended variants to model program behavior. Since there are information loss in existing lock graphs, deadlock false positives still exist. To solve the problem, a novel 2-stage dynamic deadlock analysis method is proposed. In the first stage, a Petri net model of the program is constructed by analyzing program running traces. Then, unfolding-based Petri net dead marking detection methods are used to identify potential program deadlocks. In the second stage, based on Petri net unfolding techniques, a deterministic program scheduling scheme that can be used for deadlock replay is derived for each potential deadlock. Each successfully replayed program deadlock is a real deadlock. It is shown that the proposed deadlock detection and replay method can eliminate more false positives compared to general dynamic methods, and the deadlock replay scheme is deterministic and easy to understand compared with existing random scheduling strategies.

show abstract