Task Dependence and Termination in Ada

ACM Transactions on Software Engineering and Methodology

Volumn 6, Issue 1, 1997, Pages 80-110

  Dillon, Laura K ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of California   (United States)

Author keywords

Ada tasking; Distributed termination; Master dependent relation; Task termination; Tasking execution model

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER NETWORKS; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; STORAGE ALLOCATION (COMPUTER);

ADA TASKING; DISTRIBUTED TERMINATION; MASTER DEPENDENT RELATION; TASK TERMINATION; TASKING EXECUTION MODEL;

ADA (PROGRAMMING LANGUAGE);

EID: 0030822426     PISSN: 1049331X     EISSN: None     Source Type: Journal    
DOI: 10.1145/237432.237459     Document Type: Article

References (30)

1. ACM SIGADA. 1989. The Approved Ada Language Commentaries. ACM SIGAda, Grebyn Corp., Vienna, Va.
2. ACM SIGADA. 1990. Proceedings of the 3rd International Workshop on Real-Time Ada Issues. ACM SIGAda, New York. Also published as Ada Lett. 10, 4 (Spring 1990).
3. ACM SIGADA. 1990. Proceedings of the 3rd International Workshop on Real-Time Ada Issues. ACM SIGAda, New York. Also published as Ada Lett. 10, 4 (Spring 1990).
4. ADA 9X PROJECT OFFICE. 1990. Ada 9X Requirements. Software Engineering Inst., Carnegie Mellon Univ., Ada 9X Office, Pittsburgh, Pa.
5. APT, K. R., FRANCEZ, N., AND DE ROEVER, W. P. 1980. A proof system for communicating sequential processes. ACM Trans. Program. Lang. Syst. 2, 3 (July), 359-385.
6. BAKER, T. AND RICCARDI, G. A. 1985. Ada tasking: From semantics to efficient implementation. IEEE Softw. 2, 2, 34-46.
7. BARNES, J. P. 1993. Introducing Ada 9X. Ada Lett. 13, 6 (Nov./Dec.), 61-132.
8. BARNES, J. P. 1996. Programming in Ada 95. Addison-Wesley, Reading, Mass.
9. BELKHOUCHE, B. AND LAWRENCE, L. M. 1990. A semantic model of Ada tasking. J. Pascal, Ada Modula-2, 9, 2 (Mar./Apr.), 29-41.
10. BERRY, D. M. 1975a. Notes on PL/1. Univ. of California, Los Angeles, Calif. Unpublished lecture notes.
11. BERRY, D. M. 1975b. Notes on the contour model. Univ. of California, Los Angeles, Calif. Unpublished lecture notes.
12. BERRY, D. M. 1988. Treatment of Ada procedures: Aliasing, anomalies, and erroneousness. Tech. Rep., Unisys Corp., Santa Monica, Calif. Feb.
13. BRINDLE, A. E., TAYLOR, R. N., AND MARTIN, D. F. 1989. A debugger for Ada tasking. IEEE Trans. Softw. Eng. 15, 3 (Mar.), 293-304.
14. DILLON, L. K. 1993. A visual execution model for Ada tasking. ACM Trans. Softw. Eng. Meth. 2, 4 (Oct.), 311-345.
15. FELDMAN, M. B. AND MORAN, M. L. 1989. Validating a demonstration tool for graphics-assisted debugging of Ada concurrent programs. IEEE Trans. Softw. Eng. 15, 3 (Mar.), 305-313.
16. GEHANI, N. 1983. Ada, An Advanced Introduction. Prentice-Hall, Englewood Cliffs, N.J.
17. GEHANI, N. 1984. Ada: Concurrent Programming. Prentice-Hall, Englewood Cliffs, N.J.
18. GERTH, R. T. AND DE ROEVER, W. P. 1984. A proof system for concurrent Ada programs. In Science of Computer Programming, Vol. 4. Elsevier Science Publishers B.V. (North-Holland), Amsterdam, 159-204.
19. GOODENOUGH, J. 1990. Real-time tasking semantics working group: Recovering storage for terminated tasks. In Proceedings of the 3rd International Workshop on Real-Time Ada Issues. ACM SIGAda, New York, 46.
20. ICHBIAH, J. 1979. Rationale for the design of the Ada programming language. ACM SIGPLAN Not. 14, 6.
21. ICHBIAH, J., BARNES, J., FIRTH, R., AND WOODGER, M. 1991. Rationale for the Design of the Ada Programming Language. Cambridge University Press, Cambridge, Mass.
22. INTERMETRICS. 1994. Ada Reference Manual: Language and Standard Libraries. Version 6.0. Intermetrics, Inc., Cambridge, Mass.
23. INTERMETRICS. 1995. Ada 95 Rationale. Intermetrics, Inc., Cambridge, Mass.
24. JOHNSTON, J. B. 1971. The contour model of block structured processes. In Proceedings of the ACM Symposium on Data Structures in Programming Languages. ACM SIGPLAN Not. (Feb.), 35-82.
25. LOPES, A. V., FELDMAN, M. B., AND HELLER, R. S. 1993. A controlled experiment with software for teaching Ada tasking. In Proceedings of Tri-Ada 93. ACM SIGAda, New York.
26. ORGANICK, E. I., FORSYTHE, A. I., AND PLUMMER, R. P. 1978. Programming Language Structures. 2nd ed. Academic Press, New York.
27. OWICKI, S. AND GRIES, D. 1976. An axiomatic proof technique for parallel programs. Acta Informatica 6, 4, 319-340.
28. SHUMATE, K. 1988. Understanding Concurrency in Ada. McGraw-Hill, New York.
29. THOMAS, J. W. AND ORGANICK, E. I. 1974. Visible semantics for programming languages. In Proceedings of the 1974 ACM National Conference. ACM, New York, 416-421.
30. UNITED STATES DEPARTMENT OF DEFENSE. 1983. Reference Manual for the Ada Programming Language. ANSI/MIL-STD-1815A. United States Dept. of Defense, Washington, D.C.