Abstract
This paper proposes two new types of basic program dependences in concurrent programs, named the synchronization dependence and the communication dependence, and a new program representation for concurrent Ada programs, named the Task Dependence Net (TDN). The task dependence net can be used as a unified representation in a concurrent Ada programming environment.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H. Agrawal and J. R. Horgan, “Dynamic Program Slicing”, Proc. ACM SIGPLAN'90, pp.246–256, 1990.
A. V. Aho, R. Sethi, and J. D. Ullman, “Compilers: Principles, Techniques, and Tools”, Addison-Wesley, 1986.
K. Araki, Z. Furukawa, and J. Cheng, “A General Framework for Debugging”, IEEE-CS Software, Vol.8, No.3, pp.14–20, 1991.
J. Cheng, “Logical Tool of Knowledge Engineering: Using Entailment Logic rather than Mathematical Logic”, Proc. ACM 19th Annual Computer Science Conference, pp.228–238, 1991.
J. Cheng, K. Araki, and K. Ushijima, “Development and Practical Applications of EDEN — An Event-Driven Execution Monitor for Concurrent Ada Programs”, Transactions of IPSJ, Vol.30, No.1, pp.12–24, 1989 (in Japanese).
J. Cheng, Y. Kasahara, and K. Ushijima, “A Tasking Deadlock Detector for Ada Programs”, Proc. IEEE-CS 15th Annual COMPSAC, pp.56–63, 1991.
J. Ferrante, K. J. Ottenstein, and J. D. Warren, “The Program Dependence Graph and Its Use in Optimization”, ACM TOPLAS, Vol.9, No.3, pp.319–349, 1987.
K. B. Gallagher and J. R. Lyle, “Using Program Slicing in Software Maintenance”, IEEE-CS TOSE, Vol.17, No.8, pp.751–761, 1991.
G. S. Goldszmidt, S. Temini, and S. Katz, “High-Level Language Debugging for Concurrent Programs”, ACM TOCS, Vol.8, No.4, pp.311–336, 1990.
S. Horwitz, T. Reps, and D. Binkley, “Interprocedural Slicing Using Dependence Graphs”, ACM TOPLAS, Vol.12, No.1, pp.26–60, 1990.
B. Korel and J. Laski, “Dynamic Program Slicing”, Information Processing Letters, Vol.29, No.10, pp.155–163, 1988.
C. E. McDowell and D. P. Helmbold, “Debugging Concurrent programs”, ACM Computing Surveys, Vol.21, No.4, pp.593–622, 1989.
G. J. Myers, “The Art of Software Testing”, John Wiley & Sons, 1979.
K. J. Ottenstein and L. M. Ottenstein, “The Program Dependence Graph in a Software Development Environment”, ACM Software Engineering Notes, Vol.9, No.3, pp.177–184, 1984.
A. Podgurski and L. A. Clarke, “A Formal Model of Program Dependences and Its Implications for Software Testing, Debugging, and Maintenance”, IEEE-CS TOSE, Vol.16, No.9, pp.965–979, 1990.
M. Weiser, “Programmers Use Slices When Debugging”, CACM, Vol.25, No.7, pp.446–452, 1982.
M. Weiser, “Program Slicing”, IEEE-CS TOSE, Vol.SE-10, No.4, pp.352–357, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheng, J. (1992). Task Dependence Net as a representation for concurrent Ada programs. In: van Katwijk, J. (eds) Ada: Moving Towards 2000. Ada-Europe 1992. Lecture Notes in Computer Science, vol 603. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55585-4_14
Download citation
DOI: https://doi.org/10.1007/3-540-55585-4_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55585-8
Online ISBN: 978-3-540-47240-7
eBook Packages: Springer Book Archive