Slicing Concurrent Programs Based on Program Reachability Graphs

Qi, Xinming; Zhou, Xiaoyu; Xu, Xiaojing; Zhang, Yingzhou

doi:10.1109/qsic.2010.37

Cited by 4 publications

(4 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These include two important aspects: 1) the representation used to describe the concurrent semantics of Ada programs, and 2) the technique used to implement analysis on top of a given representation. Regarding the former, the most common representations used for Ada analytics are Petri nets [25], control flow graphs [26], and different forms of task graphs such as program reachability graphs [27], real-time task digraphs [28] and system dependence nets [29]. Concerning the latter, most analysis techniques for Ada are based on model checking 6 , which allows the automatic verification of a system's correctness.…”

Section: The Openmp Tasking Modelmentioning

confidence: 99%

Safe Parallelism: Compiler Analysis Techniques for Ada and OpenMP

Royuela

Martorell

Quiñones

et al. 2018

Reliable Software Technologies – Ada-Europe 2018

View full text Add to dashboard Cite

There is a growing need to support parallel computation in Ada to cope with the performance requirements of the most advanced functionalities of safety-critical systems. In that regard, the use of parallel programming models is paramount to exploit the benefits of parallelism. Recent works motivate the use of OpenMP for being a de facto standard in high-performance computing for programming shared memory architectures. These works address two important aspects towards the introduction of OpenMP in Ada: the compatibility of the OpenMP syntax with the Ada language, and the interoperability of the OpenMP and the Ada runtimes, demonstrating that OpenMP complements and supports the structured parallelism approach of the tasklet model. This paper addresses a third fundamental aspect: functional safety from a compiler perspective. Particularly, it focuses on race conditions and considers the fine-grain and unstructured capabilities of OpenMP. Hereof, this paper presents a new compiler analysis technique that: 1) identifies potential race conditions in parallel Ada programs based on OpenMP or Ada tasks or both, and 2) provides solutions for the detected races.Royuela, S. [et al.]. Safe parallelism: Compiler analysis techniques for Ada and OpenMP.

show abstract

Section: The Openmp Tasking Modelmentioning

confidence: 99%

Safe Parallelism: Compiler Analysis Techniques for Ada and OpenMP

Royuela

Martorell

Quiñones

et al. 2018

Reliable Software Technologies – Ada-Europe 2018

View full text Add to dashboard Cite

show abstract

“…John Hatcliff et al provided the operational semantics for a multithreaded language with concurrency primitives and a bi‐simulation‐based notion for the correctness of slice in multithreaded programs with infinite execution traces. Xiaofang Qi et al extended the concept of serialization to the parallel data flow, using thread interaction reachability graph and M‐S pair program dependence graph (MSDG). In this approach, global data dependence analysis and a slicing algorithm using MSDG were used for finding the precise program slice.…”

Section: Overview Of Studiesmentioning

confidence: 99%

A systematic review of approaches for testing concurrent programs

Arora

Bhatia

Singh

2015

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYConcurrent programs are replacing the sequential programs as they utilize the true capabilities of multicore architecture. The extensive use of multicore systems and multithreaded paradigms warrants more attention to the testing of the concurrent programs. The testing concurrent program is not a new field as it has been more than 40 years because the first problem related to the testing concurrent program was addressed by the researchers. The field covers various domains, which include concurrency problems, testing approaches, techniques, graphical representations, tools, and subject systems. This paper aims at providing an overview of research in the domain of testing concurrent programs by classifying it into eight categories: (a) reachability testing, (b) structural testing, (c) model-based testing, (d) mutation-based testing, (e) slicing-based testing, (f) formal methods, (g) random testing, and (h) search-based testing. The survey is focused on the techniques applied, methodologies followed, and tools used in these aforementioned approaches. Furthermore, the gaps are also identified in different approaches. The paper concludes with the consolidation of various testing parameters along with the future directions.

show abstract

“…Since his approach needs to inline methods that use synchronization, it cannot completely handle recursion. Qi and Xu (2005) present the task communication reachability graph (TCRG) to eliminate time travels in Ada programs. The TCRG is basically a control flow graph that unrolls the symbolic execution committed by Krinke's and Nanda and Ramesh's algorithms and describes all possible execution orders of a program.…”

Section: Slicing Concurrent Programsmentioning

confidence: 99%

Advanced chopping of sequential and concurrent programs

Giffhorn

2010

Software Qual J

View full text Add to dashboard Cite

A chop for a source statement s and a target statement t reveals the program parts involved in conveying effects from s to t. While precise chopping algorithms for sequential programs are known, no chopping algorithm for concurrent programs has been reported at all. This work introduces six chopping algorithms for concurrent programs, which offer different degrees of precision, ranging from imprecise over context-sensitive to time-sensitive. Our evaluation on concurrent Java programs shows that context-sensitive and time-sensitive chopping reduces chop sizes significantly. We further present an extensive evaluation of chopping algorithms for sequential programs and describe a new, easy-to-implement chopping technique for sequential programs that computes fast and almost context-sensitive chops.

show abstract

Slicing Concurrent Programs Based on Program Reachability Graphs

Cited by 4 publications

References 18 publications

Safe Parallelism: Compiler Analysis Techniques for Ada and OpenMP

Safe Parallelism: Compiler Analysis Techniques for Ada and OpenMP

A systematic review of approaches for testing concurrent programs

Advanced chopping of sequential and concurrent programs

Contact Info

Product

Resources

About