|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| C.M. McNamee, R.A. Olsson, "Comments on 'Critical Races in Ada Programs'," IEEE Transactions on Software Engineering, vol. 16, no. 12, pp. 1439, December, 1990. | |||
| BibTex | x | ||
| @article{ 10.1109/32.62452, author = {C.M. McNamee and R.A. Olsson}, title = {Comments on 'Critical Races in Ada Programs'}, journal ={IEEE Transactions on Software Engineering}, volume = {16}, number = {12}, issn = {0098-5589}, year = {1990}, pages = {1439}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.62452}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Software Engineering TI - Comments on 'Critical Races in Ada Programs' IS - 12 SN - 0098-5589 SP EP EPD - 1439 A1 - C.M. McNamee, A1 - R.A. Olsson, PY - 1990 KW - semantics; Ada rendezvous mechanism; critical race problem; critical race-free programs; Ada; programming VL - 16 JA - IEEE Transactions on Software Engineering ER - | |||
Comments are made on the above named work by G.M. Karam, C.M. Stanczyk, and G.W. Bond, in which the semantics of the Ada rendezvous mechanism are discussed in terms of the critical race problem and a method is proposed for designing critical race-free programs. It is noted that this problem has been well described and numerous solutions have been presented in the literature during the past ten years (1980-90).
[1] G. R. Andrews, "Synchronizing resources," Dep. Comput. Sci., Cornell Univ., Tech. Rep. TR 78-360, Feb. 1979.
[2] G. R. Andrews, "Synchronizing resources,"ACM Trans. Program. Lang. Syst., vol. 3, no. 4, pp. 405-430, Oct. 1981.
[3] G. R. Andrews, "The distributed programming language SR--Mechanisms, design, and implementation,"Software--Practice and Experience, vol. 12, no. 8, pp. 719-753, 1982.
[4] G. R. Andrews and F. B. Schneider, "Concepts and notations for concurrent programming,"ACM Comput. Surveys, vol. 15, no. 1, pp. 3-43, Mar. 1983.
[5] T. Bloom, "Evaluating synchronization mechanisms," inProc. Seventh Symp. Operating Systems Principles, ACM-SIGOPS, Dec. 1979.
[6] G. Bruno, "Using Ada for discrete event simulation,"Software--Practice and Experience, vol. 14, no. 7, pp. 685-695, 1984.
[7] A. Burns, A. Lister, and A. Wellings.Lecture Notes in Computer Science: A Review of the Ada Tasking Model. New York: Springer-Verlag, 1987.
[8] N. H. Gehani and W. D. Roome, "Concurrent C,"Software-Practice and Experience, vol. 16, no. 9, pp. 821-844, Sept. 1986.
[9] N. H. Gehani and W. D. Roome, "Rendezvous facilities: Concurrent C and the Ada language,"IEEE Trans. Software Eng., vol. 14, no. 11, pp. 1546-1553, Nov. 1988.
[10] P. B. Hansen, "Distributed processes: A concurrent programming concept,"Commun. ACM, vol. 21, no. 11, pp. 934-941, Nov. 1987.
[11] G. M. Karam, C. M. Stanczyk, and G. W. Bond, "Critical races in Ada programs,"IEEE Trans. Software Eng., vol. 15, no. 11, p. 1471-1480, Nov. 1989.
[12] B. Liskov, M. Herlihy, and L. Gilbert, "Limitations of synchronous communication with static process structure in languages for distributed computing," inProc. 13th ACM Symp. Principles of Programming Languages, Jan. 1986, pp. 1546-1553.
[13] A. Silberschatz, "Cell: A distributed computing modularization concept,"IEEE Trans. Software Eng., vol. SE-10, no. 2, pp. 178-185, 1984.