|
 ABSTRACT
Developing and verifying concurrent programs presents several problems. A static analysis algorithm is presented here that addresses the following problems: how processes are synchronized, what determines when programs are run in parallel, and how errors are detected in the synchronization structure. Though the research focuses on Ada, the results can be applied to other concurrent programming languages such as CSP.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
 |
2
|
|
| |
3
|
Buxton, J. N., and Stanning, V. Requirements for Ada programming support environments: "Stoneman." Department of Defense, Feb. 1980.
|
| |
4
|
Gallucci, Michael A. SAM/SAL User Manual and Report. University of Colorado Technical Report #CU-CS-198-81, Department of Computer Science, Feb. 1981.
|
| |
5
|
|
| |
6
|
|
| |
7
|
Howden, W. E. Symbolic Testing and the DISSECT symbolic evaluation system. IEEE Trans. Software Engineering, SE-3, 4 (July 1977), 266-278.
|
| |
8
|
Ichbiah, J. D., Krieg-Bmeckner, B., Wichmann, B. A., Ledgard, H. F., and Heliard, J. Reference manual for the Ada programming language: Proposed standard document. Report AD-A090 709/7, Department of Defense, July 198o.
|
| |
9
|
|
| |
10
|
|
| |
11
|
Martin, F. HAL/S-The avionics programming system for shuttle. Proc. AIAA Conference on Computers in Aerospace. Los Angeles, CA (November 1977}, 308-318.
|
| |
12
|
Osterweil, L. J., and Fosdick, L. D. DAVE--A validation, error detection, and documentation system for Fortran programs. Soflware---Prac0ce and Experience, 6 (1976), 473--486.
|
| |
13
|
Taylor, R. N., and Osterweil, L. J, Anomaly detection in concurrent soitware by static data flow analysis. IEEE Tmns SoJtware Engineering, SE-6, 3 (May 1980), 265-278.
|
| |
14
|
Taylor, R. N. Complexity of Analyzing Concurrent Programs. Department of Computer Science Technical Report #DC.S-9-IR, University of Victoria (May, 1981).
|
CITED BY 97
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Evelyn Duesterwald , Mary Lou Soffa, Concurrency analysis in the presence of procedures using a data-flow framework, Proceedings of the symposium on Testing, analysis, and verification, p.36-48, October 08-10, 1991, Victoria, British Columbia, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Matthew B. Dwyer , Lori A. Clarke , Kari A. Nies, A compact Petri net representation for concurrent programs, Proceedings of the 17th international conference on Software engineering, p.147-157, April 24-28, 1995, Seattle, Washington, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Jyh-Herng Chow , William Ludwell Harrison, III, Compile-time analysis of parallel programs that share memory, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.130-141, January 19-22, 1992, Albuquerque, New Mexico, United States
|
|
|
|
|
|
Douglas Long , Lori A. Clarke, Data flow analysis of concurrent systems that use the rendezvous model of synchronization, Proceedings of the symposium on Testing, analysis, and verification, p.21-35, October 08-10, 1991, Victoria, British Columbia, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Wei Jen Yeh , Michal Young, Compositional reachability analysis using process algebra, Proceedings of the symposium on Testing, analysis, and verification, p.49-59, October 08-10, 1991, Victoria, British Columbia, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Michal Young , Richard N. Taylor , David L. Levine , Kari A. Nies , Debra Brodbeck, A concurrency analysis tool suite for Ada programs: rationale, design, and preliminary experience, ACM Transactions on Software Engineering and Methodology (TOSEM), v.4 n.1, p.65-106, Jan. 1995
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
REVIEW
"Jorgen Staunstrup : Reviewer"
This paper outlines an algorithm for a static analysis of the concurrency
aspects of Ada programs. It is proposed that
dynamic properties (e.g., posssible synchronizations) are
verified by a static analysis which yields all potential
behaviors.
more...
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
D.2