This Article 
 Bibliographic References 
 Add to: 
Towards Complexity Metrics for Ada Tasking
August 1988 (vol. 14 no. 8)
pp. 1122-1127

Using Ada as a representative distributed programming language, the author discusses some ideas on complexity metrics that focus on Ada tasking and rendezvous. Concurrently active rendezvous are claimed to be an important aspect of communication complexity. A Petri net graph model of Ada rendezvous is used to introduce a rendezvous graph, an abstraction that can be useful in viewing and computing effective communication complexity.

[1] S. M. Shatz and J.-P. Wang, "An introduction to distributed-software engineering,"IEEE Comput. Mag., vol. 20, no. 10, pp. 23-31, Oct. 1987.
[2] T. McCabe, "A complexity measure,"IEEE Trans. Software Eng., vol. SE-2, no. 4, pp. 308-320, Dec. 1976.
[3] M. Halstead,Elements of Software Science. New York: Elsevier-North Holland, 1977.
[4] W. Harrison, K. Magel, R. Kluezny, and A. DeKock, "Applying software complexity metrics to program maintenance,"Computer, Vol. 15, no. 9, pp. 65-79, Sept. 1982.
[5] M. Evangelist, "Program complexity and program style," inProc. Int. Conf. Data Engineering, Los Angeles, CA, Apr. 1984, pp. 534- 541.
[6] D. Kafura and S. Henry, "Software quality metrics based on interconnectivity,"J. Syst. Software, Vol. 2, pp. 121-131, 1981.
[7] J. Gannon, E. Katz, and V. Basili, "Measures for Ada packages: an initial study,"Commun. ACM, vol. 29, no. 7, July 1986.
[8] H. D. Rombach and V. R. Basili, "TAME--Tools for an Ada measurement environment," inProc. 5th Nat. Conf. Ada Technology, Arlington, VA, Mar. 1987.
[9] J. Welsh and A. Lister, "A comparative study of task communication in Ada,"Software--Practice and Experience, vol. 11, pp. 257-290, 1981.
[10] C. V. Ramamoorthy, W. T. Tsai, T. Yamaura, and A. Bhide, "Metrics guided methodology," inProc. 9th Computer Software and Applications Conf., Oct. 1985, p. 111.
[11] M. Woodward, M. Hennell, and D. Hedley, "A measure of control flow complexity in program text,"IEEE Trans. Software Eng., vol. SE-5, pp. 45-50, Jan. 1979.
[12] J. L. Peterson,Petri Net Theory and the Modeling of Systems. Englewood Cliffs, NJ: Prentice-Hall, 1981.
[13] S. M. Shatz and W. K. Cheng, "A Petri net framework for automated static analysis of Ada tasking behavior,"J. Syst. Software, vol. 8, pp. 343-359, 1988.
[14] T. Murata, B. Shenker, and S. Shatz, "'Detection of Ada static deadlocks using Petri net invariants,"IEEE Trans. Software Eng., to be published.
[15] D. Mandrioli, R. Zicari, C. Ghezzi, and F. Tisato, "Modeling the Ada task system by Petri nets,"Comput. Lang., vol. 10, no. 1, 1985.
[16] E. T. Morgan and R. R. Razouk, "Computer-aided analysis of concurrent systems," inProtocol Specification, Testing, and Verification, V. M. Diax, Ed. New York: North Holland, 1986, pp. 49-58.
[17] K. C. Tai and E. E. Obaid, "Reproducible testing of Ada tasking programs," inProc. IEEE 2nd Int. Conf. Ada Applications and Environments, Apr. 1986, pp. 69-79.
[18] K. C. Tai, "A graphical representation of rendezvous sequences of concurrent Ada programs,"ACM Ada Lett., vol. VI, no. 1, pp. 94-103, Jan./Feb. 1986.
[19] K. Kolence and P. Kiviat, "Software unit profiles and Kiviat figures,"ACM Sigmetrics Perform. Eval. Rev., June 1973.
[20] E. M. Clarke, E. A. Emerson, and A. P. Sistla, "Automatic verification of finite-state concurrent systems using temporal logic,"ACM Trans. Program. Lang. Syst., vol. 8, no. 2, pp. 244-263, Apr. 1986.

Index Terms:
concurrently active rendezvous; software engineering; software complexity; complexity metrics; Ada tasking; representative distributed programming language; communication complexity; Petri net graph model; Ada rendezvous; rendezvous graph; Ada; computational complexity; directed graphs; distributed processing; software engineering
S.M. Shatz, "Towards Complexity Metrics for Ada Tasking," IEEE Transactions on Software Engineering, vol. 14, no. 8, pp. 1122-1127, Aug. 1988, doi:10.1109/32.7623
Usage of this product signifies your acceptance of the Terms of Use.