Detecting concurrently executed pairs of statements using an adapted MHP algorithm

Authors:
Zhenqiang Chen;Baowen Xu;Huiming Yu
Affiliations:
Southeast University, Nanjing 210096, China;Southeast University, Nanjing 210096, China;North Carolina A&T State University, Greensboro, NC
Venue:
Proceedings of the 2001 annual ACM SIGAda international conference on Ada
Year:
2001

Citing 9
Cited 2

Static analysis of low-level synchronization

PADD '88 Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging
Concurrency analysis in the presence of procedures using a data-flow framework

TAV4 Proceedings of the symposium on Testing, analysis, and verification
Non-concurrency analysis

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Static slicing of threaded programs

Proceedings of the 1998 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
A conservative data flow algorithm for detecting all pairs of statements that may happen in parallel

SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
Transforming Ada serving tasks into protected objects

Proceedings of the 1998 annual ACM SIGAda international conference on Ada
An efficient algorithm for computing MHP information for concurrent Java programs

ESEC/FSE-7 Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering
Slicing concurrent java programs

ACM SIGPLAN Notices
An Approach to Analyzing Dependency of Concurrent Programs

APAQS '00 Proceedings of the The First Asia-Pacific Conference on Quality Software (APAQS'00)

A compile-time optimization framework for Ada rendezvous

ACM SIGPLAN Notices
Process algebra model of Ada protected objects

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

Information about which pairs of statements in a program can be executed concurrently is important for improving the accuracy of dataflow analysis, optimizing programs, and detecting errors. This paper presents a new method named Concurrent Control Flow Graph for representing concurrent Ada 95 programs in a simple and precise way. Based on this method, we develop an Adapted MHP algorithm that can statically detect all pairs of statements that may be executed concurrently. This algorithm checks not only whether a rendezvous can be triggered, but also whether it can be finished. Although this algorithm generates a conservative superset of the perfect pairs of statements, it is more precise than many existing methods.