An information-theoretical framework for modeling component-based systems

IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews

Volumn 34, Issue 4, 2004, Pages 475-484

  Seker, Remzi ^a   Tanik, Murat M ^b  

^a EMBRY RIDDLE AERONAUTICAL UNIVERSITY   (United States)

^b UNIVERSITY OF ALABAMA AT BIRMINGHAM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY; GRAPH THEORY; INFORMATION THEORY; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBLEM SOLVING;

CAPACITY; COMPONENT BASED SOFTWARE; METRICS; PERVASIVE SHANNON METRICS; SHANNON LANGUAGES;

SOFTWARE ENGINEERING;

EID: 7744230841     PISSN: 10946977     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCC.2004.829297     Document Type: Article

References (74)

1. R. Seker, "Component-based software modeling based on Shannon's information channels," Ph.D. dissertation, Univ. of Alabama at Birmingham, Birmingham, 2002.
2. A. P. Sage and J. D. Palmer, [i Software Systems Engineering i]. New York: Wiley, 1990.
3. M. M. Tanik and E. S. Chan, [i Fundamentals of Computing for Software Engineers i]. New York: Van Nostrand, 1991.
4. Y. Tang, "A methodology for component-based system integration," Ph.D. dissertation, New Jersey Institute of Technology, Newark, NJ, 1999.
5. L. K. Jololian, "A meta-semantic language for smart component-adapters," Ph.D. dissertation, New Jersey Institute of Technology, Newark, NJ, 2000.
6. J. Hopkins, "Component primer," [i Commun. ACM i], vol. 43, no. 10, pp. 27-30, 2000.
7. K. C. Wallnau, S. A. Hissam, and R. C. Seacord, [i Building Systems From Commercial Components i]. Reading, MA: Addison-Wesley, 2002.
8. P. Brereton and D. Budgen, "Component-based systems: A classification of issues," [i IEEE Comput. i], vol. 33, pp. 54-62, Nov. 2000.
9. W. Emmerich, "Distributed component technologies and their software engineering implications," in [i Proc. 24th Int. Conf. Software Engineering i], Orlando, FL, 2002, pp. 537-546.
10. A. W. Brown and K. C. Wallnau, "The current state of CBSE," [i IEEE Software i], pp. 37-46, Sept./Oct. 1998.
11. J. Grundy, R. Mugridge, J. Hosking, and M. Apperley, "Tool integration, collaboration and user interaction issues in component-based software architectures," [i Technol. Object-Oriented Lang. i], pp. 299-312, 1998.
12. P. T. Cox and S. Baoming, "A formal model for component-based software," in [i Proc. IEEE Symp. Human-Centric Computing Languages and Environments i], 2001, pp. 304-311.
13. E. Martins, C. M. Toyota, and R. L. Yanagawa, "Constructing self-testable software components," in [i Proc. Int. Conf. Dependable Systems and Networks i], 2001, pp. 151-160.
14. G. T. Heineman and W. T. Councill, [i Component-Based Software Engineering: Putting the Pieces Together i]. Reading, MA: Addison-Wesley, 2001.
15. H. Chestnut, [i Systems Engineering Tools i]. New York: Wiley, 1965.
16. S. Wolfram, [i A New Kind of Science i]: Wolfram Media Inc., 2002.
17. R. E. Prather, "Design and analysis of hierarchical software metrics," [i ACM Comput. Surveys (CSUR) i], vol. 27, no. 4, pp. 497-518, 1995.
18. E. J. Weyuker, "Evaluating software complexity measures," [i IEEE Trans. Software Eng. i], vol. 14, pp. 1357-1365, Sept. 1988.
19. M. J. Harrold, D. Liang, and S. Sinha, "An approach to analyzing and testing component-based systems," in [i Proc. 1st Int. ICSE Workshop on Testing Distributed Component-Based Systems i].
20. M. J. Harrold, "Testing: A roadmap," in [i Proc. Conf. Future of Software Engineering i] , 2000, pp. 61-72.
21. Y. Wu, D. Pan, and M.-H. Chen, "Techniques for testing component-based software," in [i Proc. 7th IEEE Int. Conf. Engineering of Complex Computer Systems i], 2001, pp. 222-232.
22. H. Zhu and X. He, "An observational theory of integration testing for component-based software development," in [i Proc. 25th Annu. Int. Computer Software and Applications Conference (COMPSAC 2001) i], 2001, pp. 363-368.
23. C. Szyperski, [i Component Software: Beyond Object-Oriented Programming i]. New York: ACM Press/Addison-Wesley, 1998.
24. X. Cai, M. R. Lyu, W. Kam-Fai, and K. Roy, "Component-based software engineering: Technologies, development frameworks, and quality assurance schemes," in [i Proc. 7th Asia-Pacific Software Engineering Conf. (APSEC 2000) i], 2000, pp. 372-379.
25. A. Fujimura and F. Moore, "Quality on time," [i Software Quality J. i], vol. 7, no. 2, pp. 97-106, July 1997.
26. E. J. Weyuker, T. J. Ostrand, J. Brophy, and B. Prasad, "Clearing a career path for software testers," [i IEEE Software i], vol. 17, pp. 76-82, Mar.-Apr. 2000.
27. R. R. Dumke and A. S. Winkler, "Managing the component-based software engineering with metrics," in [i Proc. 5th Int. Symp. Assessment of Software Tools and Technologies i], 1997, pp. 104-110.
28. R. Cherinka, C. M. Overstreet, and J. Ricci, "Maintaining a COTS integrated solution -are traditional static analysis techniques sufficient for this new programming methodology," in [i Proc. Int. Conf. Software Maintenance i], 1998, pp. 160-169.
29. E. J. Weyuker, "Testing component-based software: A cautionary tale," [i IEEE Software i], vol. 15, no. 5, pp. 54-59, Sept.-Oct. 1998.
30. M. Ancona, W. Cazzola, G. Dodero, and V. Gianuzzi, "Communication modeling by channel reification," in [i Proc. Workshop "Advances in Languages for User Modeling" - 6th Int. Conf. User Modeling i], Chia Laguna, Sardinia Italia, June 1997, pp. 1-9.
31. P. Maes, "Concepts and experiments in computational reflection," in [i Proc. Conf. Object-Oriented Programming Systems, Languages and Applications i], 1987, pp. 147-155.
32. L. Liu and R. Meersman, "The building blocks for specifying communication behavior of complex objects: An activity-driven approach," [i ACM Trans. Database Syst. (TODS) i], vol. 21, no. 2, pp. 157-207, 1996.
33. S. S. Muchnick and N. D. Jones, [i Program Flow Analysis: Theory and Applications i]. Englewood Cliffs, NJ: Prentice-Hall, 1981.
34. A. Khandekar, R. McEliece, and E. Rodemich, "The discrete noiseless channel revisited," in [i Proc. 1999 Int. Symp. Communication Theory and Applications i], 1999, pp. 115-137.
35. C. V. Ramamoorthy, "Analysis of graphs by connectivity considerations," [i J. ACM (JACM) i], vol. 13, no. 2, pp. 211-222, 1966.
36. C. V. Ramamoorthy and S.-B. F. Ho, "Testing large software with automated software evaluation systems," [i IEEE Trans. Software Eng. i], vol. SE-1, pp. 46-58, Mar. 1975.
37. C. V. Ramamoorthy, S.-B. F. Ho, and W. T. Chen, "On the automated generation of program test data," [i IEEE Trans. Software Eng. i], vol. SE-2, pp. 293-300, Dec. 1976.
38. P. van den Broek and K. van den Berg, "Generalized approach to software structure metrics," [i Software Eng. J. i], vol. 10, no. 2, pp. 61-67, Mar. 1995.
39. C. Böhm and G. Jacopini, "Flow diagrams, turing machines and languages with only two formation rules," [i Commun. ACM i], vol. 9, no. 5, pp. 366-371, 1966.
40. E. W. Dijkstra, "Letters to the editor: Go to statement considered harmful," [i Commun. ACM i], vol. 11, no. 3, pp. 147-148, 1968.
41. E. W. Dijkstra, "The humble programmer," [i Commun. ACM i], vol. 15, no. 10, pp. 859-866, 1972.
42. D. E. Knuth, "Structured programming with go to statements," [i ACM Comput. Surveys (CSUR) i], vol. 6, no. 4, pp. 261-301, 1974.
43. R. E. Prather, "Regular expressions for program computations," [i Amer Mathemat. Monthly i], vol. 104, no. 2, pp. 120-130, Feb. 1997.
44. R. Greenlaw and R. Petreschi, "Cubic graphs," [i ACM Comput. Surveys (CSUR) i], vol. 27, no. 4, pp. 471-495, 1995.
45. R. E. Prather, "Convexity and independence in software metric theory," [i Software Eng. J. i], vol. 11, no. 4, pp. 238-246, July 1996.
46. C. E. Shannon and W. Weaver, [i The Mathematical Theory of Communication i]. Urbana: Univ. of Illinois Press, 1963.
47. K. K. Nambiar, "Shannon's communication channels and word spaces," [i Mathemat. Comput. Modeling i], vol. 34, no. 7-8, pp. 757-759, 2001.
48. D. Lind and B. Markus, [i An Introduction to Symbolic Dynamics and Coding i]. Cambridge, U.K.: Cambridge Univ. Press, 1999.
49. G. J. Chaitin, "Randomness and mathematical proof," [i Sci. Amer. i], vol. 232, no. 5, pp. 47-52, May 1975.
50. L. Hellerman, "A measure of computational work," [i IEEE Trans. Comput. i], vol. C-21, pp. 439-446, May 1972.
51. N. Coulter, R. B. Cooper, and M. K. Solomon, "Information-theoretic complexity of program specifications," [i Comput. J. i], vol. 30, no. 3, pp. 223-227, 1987.
52. E. B. Allen and T. M. Khoshgoftaar, "Measuring coupling and cohesion: An information-theory approach," in [i Proc. 6th IEEE Symp. Software Metrics i], Nov. 1999, pp. 119-127.
53. R. Seker and M. M. Tanik, "Component-based software modeling based on noisy information channels," in [i Proc. Int. Conf. Computer, Communication, and Control Technologies (CCCT'03) i], vol. 3, H.-W. Chu, J. Ferrer, and J. M. Pineda, Eds., Orlando, FL, July/Aug. 2003, pp. 144-149.
54. R. Seker, "Discrete noiseless information channel and search engines," Univ. of Alabama at Birmingham, Tech. Rep. 2002-04-ECE-002, 2002.
55. H. Minc, [i Nonnegative Matrices i]. New York: Wiley, 1988.
56. A. Berham and R. J. Plemmons, [i Nonnegative Matrices in the Mathematical Sciences i]. New York: Academic, 1979.
57. R. Seker and M. M. Tanik, "Division ring, information theory, and discrete noiseless communication channel," Univ. of Alabama at Birmingham, Tech. Rep. 2001 12-ECE-018, 2001.
58. K. K. Nambiar, "Matrices with elements from a division ring," [i Mathemat. Comput. Modeling i], vol. 24, no. 1, pp. 1-3, 1996.
59. K. K. Nambiar, "Theory of search engines," [i Comput. Mathemat. Applicat. i], vol. 42, no. 12, pp. 1523-1526, 2001.
60. Y. Tang, A. H. Dogru, F. J. Kurfess, and M. M. Tanik, "Computing cyclomatic complexity with cubic graphs," [i J. Syst. Integrat. i], vol. 10, no. 4, pp. 395-409, Sept. 2001.
61. I. H. Unwala and H. G. Cragon, "A markov chain modeling technique for evaluating pipelined processor designs," in [i Proc. 37th Midwest Symp. Circuits and Systems i], vol. 1, 1994, pp. 319-322.
62. I. H. Unwala, "Design evaluation of pipelined processors using finite state machine analysis with markov chains," in [i Proc. 3rd Int. Conf. Economics of Design, Test, and Manufacturing i], 1994, pp. 147-151.
63. J. Tian and M. V. Zelkowitz, "Complexity measure evaluation and selection," [i IEEE Trans. Software Eng. i], vol. 21, pp. 641-650, Aug. 1995.
64. B. Yener, Y. Ofek, and M. Yung, "Combinatorial design of congestion-free networks," [i IEEE/ACM Trans. Networking i], vol. 5, pp. 989-1000, Dec. 1997.
65. C. J. Colbourn, "Projective planes and congestion-free networks," Discrete Appl. Mathemat., to be published.
66. R. J. Mihalek, [i Projective Geometry and Algebraic Structures i]. New York: Academic, 1972.
67. J. G. Kemeny and J. L. Snell, [i Finite Markov Chains i]. Princeton, NJ: Van Nostrand, 1960.
68. M. Levene and G. Loizou, "Kemeny's constant and the random surfer," Amer. Mathemat. Monthly, vol. 109, 2002, to be published.
69. I. Sommerville, [i Software Engineering i], 6 ed. Reading, MA: Addison-Wesley, 2001.
70. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, [i Introduction to Algorithms i]. Cambridge, MA: MIT Press, 1990.
71. C. V. Ramamoorthy, "A study of the service industry-functions, features and control," [i IEICE Trans. Commun. i], vol. E83-B, no. 5, pp. 885-902, May 2000.
72. M. Sahinoglu, "Compound-poisson software reliability model," [i IEEE Trans. Software Eng. i], vol. 18, pp. 624-630, 1992.
73. J. D. Carothers and H. G. Cragon, "Graph-theoretic techniques for computer intraconnection minimization," [i IEEE Trans. Syst., Man, Cybern. i], vol. 23, pp. 876-888, May-June 1993.
74. T. A. Welch, "Bounds of information retrieval efficiency in static file structures," Ph.D. dissertation, Massachusetts Inst. Technol., Cambridge, MA.