Software documents: Comparison and measurement

19th International Conference on Software Engineering and Knowledge Engineering, SEKE 2007

Volumn , Issue , 2007, Pages 740-745

  Arbuckle, Tom ^a   Balaban, Adam ^b   Peters, Dennis K ^c   Lawford, Mark ^d  

^a UNIVERSITY OF LIMERICK   (Ireland)

^b UNIVERSITY OF WARSAW   (Poland)

^c MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

^d MCMASTER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CODE DOCUMENTS; EVALUATING SOFTWARE; KOLMOGOROV COMPLEXITY; SIMILARITY METRICS; SOFTWARE COMPARISONS; SOFTWARE MEASUREMENT;

ENTROPY; INFORMATION THEORY; KNOWLEDGE ENGINEERING;

SOFTWARE ENGINEERING;

EID: 84886931549     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (62)

1. D. L. Parnas, "Precise description and specification of software, " in MDS '95üProc. 2nd international conference on Mathematics of dependable systems II. Oxford University Press, Inc., 1997, pp. 1-14.
2. M. Li, X. Chen, X. Li, B. Ma, and P. Vitányi, "The similarity metric, " in SODA '03üProceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 2003, pp. 863-872.
3. R. Cilibrasi, "The CompLearn Toolkit, " 2003. [Online]. Availableühttp://complearn.sourceforge.net/.
4. R. Cilibrasi and P. Vitányi, "Clustering by compression, " IEEE Trans. Information Theory, vol. 51, no. 4, pp. 1523-1545, April 2005.
5. R. J. Rubey and R. D. Hartwick, "Quantitative measurement of program quality, " in Proceedings of the 1968 23rd ACM national conference. New York, NY, USAüACM Press, 1968, pp. 671-677.
6. M. H. Halstead, Elements of Software Science (Operating and programming systems series). New York, USAüElsevier Science Inc., 1977.
7. B. H. Yin and J. W. Winchester, "The establishment and use of measures to evaluate the quality of software designs, " in Proceedings of the software quality assurance workshop on Functional and performance issues, 1978, pp. 45-52.
8. N. E. Fenton and S. L. Pfleeger, Software MetricsüA Rigorous and Practical Approach. Boston, MA, USAüPWS Publishing Co., 1998.
9. H. Zuse, Software ComplexityüMeasures and Methods. Hawthorne, NJ, USAüWalter de Gruyter & Co., 1990.
10. M. Lorenz and J. Kidd, Object-oriented software metricsüa practical guide. Upper Saddle River, NJ, USAüPrentice-Hall, Inc., 1994.
11. N. Fenton, "Software measurementüA necessary scientific basis, " IEEE Trans. Softw. Eng., vol. 20, no. 3, pp. 199-206, 1994.
12. B. Henderson-Sellers, "The mathematical validity of software metrics, " SIGSOFT Softw. Eng. Notes, vol. 21, no. 5, pp. 89-94, 1996.
13. E. J. Weyuker, "Evaluating software complexity measures, " IEEE Trans. Softw. Eng., vol. 14, no. 9, pp. 1357-1365, 1988.
14. L. C. Briand, S. Morasca, and V. R. Basili, "Property-based software engineering measurement, " IEEE Trans. Softw. Eng., vol. 22, no. 1, pp. 68-86, 1996.
15. N. Fenton, "When a software measure is not a measure, " Softw. Eng. J., vol. 7, no. 5, pp. 357-362, 1992.
16. C. E. Shannon, "A mathematical theory of communication, " The Bell System Technical Journal, vol. 27, pp. 379-423 and 623-656, 1948.
17. T. M. Cover and J. A. Thomas, Elements of Information Theory. Wiley- Interscience, 2006.
18. M. Li and P. Vitányi, An introduction to Kolmogorov complexity and its applications (2nd ed.). Springer-Verlag, 1997.
19. R. J. Solomonoff, "A formal theory of inductive inference. part I and part II, " Information and Control, vol. 7, no. 1 and 2, pp. 1-22 and 224-254, 1964.
20. A. N. Kolmogorov, "Three approaches to the quantitative definition of information, " Probl. Inform. Trans., vol. 1, no. 1, pp. 1-7, 1965.
21. G. J. Chaitin, "On the length of programs for computing finite binary sequencesüstatistical considerations, " J. ACM, vol. 16, no. 1, pp. 145- 159, 1969.
22. P. D. Grünwald and P. M. B. Vitányi, "Kolmogorov complexity and information theory with an interpretation in terms of questions and answers, " J. of Logic, Lang. and Inf., vol. 12, no. 4, pp. 497-529, 2003.
23. P. D. Grünwald and P. M. B. Vitányi, "Shannon information and Kolmogorov complexity, " September 2004, submitted to IEEE Trans. Information Theory.
24. C. H. Bennett, P. Gács, M. Li, P. M. B. Vitányi, and W. H. Zurek, "Thermodynamics of computation and information distance, " in STOC '93üProceedings of the twenty-fifth annual ACM symposium on Theory of computing. New York, NY, USAüACM Press, 1993, pp. 21-30.
25. R. Landauer, "Irreversibility and heat generation in the computing process, " IBM J. Res. Develop., vol. 5, no. 3, pp. 183-191, July 1961.
26. C. H. Bennett, P. Gács, M. Li, P. Vitányi, and W. H. Zurek, "Information distance, " IEEE Transactions on Information Theory, vol. 44, no. 4, pp. 1407-1423, July 1998.
27. M. Li, X. Chen, X. Li, B. Ma, and P. Vitányi, "The similarity metric, " IEEE Transactions on Information Theory, vol. 50, no. 12, pp. 3250- 3264, December 2004.
28. M. Li, J. H. Badger, X. Chen, S. Kwong, P. Kearney, and H. Zhang, "An information-based sequence distance and its application to whole mitochondrial genome phylogeny." Bioinformatics, vol. 17, no. 2, pp. 149-154, 2001.
29. L. L. Campbell, "Entropy as a measure, " IEEE Trans. Information Theory, vol. 11, no. 1, pp. 112-11, 1965.
30. L. Hellerman, "A measure of computational work, " IEEE Trans. Computers, vol. C-21, no. 5, pp. 439-446, May 1972.
31. M. H. van Emden, "Hierarchical decomposition of complexity, " Machine Intelligence, vol. 5, pp. 361-380, 1969.
32. M. H. van Emden, "An analysis of complexity, " Ph.D. dissertation, Mathematisches Zentrum, Amsterdam, 1971.
33. R. N. Chanon, "On a measure of program structure, " in Programming Symposium, Proceedings Colloque sur la Programmation. London, UKüSpringer-Verlag, 1974, pp. 9-16.
34. R. N. Chanon, "On a measure of program structure." Ph.D. dissertation, Carnegie- Mellon University, 1974.
35. S. Henry and D. Kafura, "Software structure metrics based on information flow, " IEEE Transactions on Software Engineering, vol. 7, no. 5, pp. 510-518, September 1981.
36. N. Chapin, "An entropy metric for software maintainability, " in Proceedings of the Twenty-Second Anuual Hawaii International Conference on System Sciences, vol. II, Jan 1989, pp. 522-533.
37. W. R. Torres and M. H. Samadzadeh, "Software reuse and information theory based metrics, " in Proc. 1991 Symposium on Applied Computing, April 1991, pp. 437-446.
38. N. S. Coulter, R. B. Cooper, and M. K. Solomon, "Information- theoretic complexity of program specifications, " Comput. J., vol. 30, no. 3, pp. 223-227, 1987.
39. J. Bansiya, C. Davis, and L. Etzkorn, "An entropy-based complexity measure for object-oriented designs, " Theor. Pract. Object Syst., vol. 5, no. 2, pp. 111-118, 1999.
40. D. P. Tegarden, S. D. Sheetz, and D. E. Monarchi, "A software complexity model of object-oriented systems, " Decis. Support Syst., vol. 13, no. 3-4, pp. 241-262, 1995.
41. E. B. Allen and T. M. Khoshgoftaar, "Measuring coupling and cohesionüAn information-theory approach, " in METRICS '99üProc. 6th Int. Symp. on Software Metrics. IEEE Computer Society, 1999, p. 119.
42. E. B. Allen, T. M. Khoshgoftaar, and Y. Chen, "Measuring coupling and cohesion of software modulesüAn information-theory approach, " in METRICS '01üProceedings of the 7th International Symposium on Software Metrics. IEEE Computer Society, 2001, p. 124.
43. J. C. Munson and T. M. Khoshgoftaar, "The dimensionality of program complexity, " in ICSE '89üProceedings of the 11th international conference on Software engineering. ACM Press, 1989, pp. 245-253.
44. T. M. Khoshgoftaar and D. L. Lanning, "Are the principal components of software complexity data stable across software products?" in Proc. 2nd Int. Software Metrics Symposium, 1994, pp. 61-72.
45. D. L. Lanning and T. M. Khoshgoftaar, "Modeling the relationship between source code complexity and maintenance difficulty, " Computer, vol. 27, no. 9, pp. 35-40, 1994.
46. N. E. Gold, A. M. Mohan, and P. J. Layzell, "Spatial complexity metricsüAn investigation of utility, " IEEE Trans. Softw. Eng., vol. 31, no. 3, pp. 203-212, 2005.
47. S. Sarkar, G. M. Rama, and A. C. Kak, "API-based and informationtheoretic metrics for measuring the quality of software modularisation, " IEEE Trans. Softw. Eng., vol. 33, no. 1, pp. 14-32, 2007.
48. X. Chen, B. Francia, M. Li, B. McKinnon, and A. Seker, "Shared information and program plagiarism detection, " IEEE Trans. Information Theory, vol. 50, no. 7, pp. 1545-1551, July 2004.
49. K. Koroutchev and M. Cebrián, "Detecting translations of the same text and data with common source, " Journal of Statistical MechanicsüTheory and Experiment, vol. 10, October 2006.
50. R. Cilibrasi, P. Vitányi, and R. de Wolf, "Algorithmic clustering of music based on string compression, " Computer Music Journal, vol. 28, no. 4, pp. 49-67, 2004.
51. P. Vitányi, "Universal similarity, " in Proc. IEEE ISOC ITW2005 on Coding and Complexity, M. Dinneen, Ed., 2005, pp. 238-243.
52. K. Lindsay, "slocate, " 1998, Canonical URL is http://slocate.trakker.ca/. [Online]. Availableühttp://freshmeat.net/ projects/slocate/.
53. D. L. Parnas and M. Dragomiroiu, "Module Interface Documentation - Using the Trace Function Method (TFM), " 2006, submitted to IEEE Trans. Softw. Eng.
54. W. Bartussek and D. L. Parnas, "Using traces to write abstract specifications for software modules, " in Proc. 2nd Conf. European Cooperation in Informatics, ser. LNCS 65. Springer-Verlag, 1978, pp. 211-236.
55. S. J. Prowell, "Developing black box specifications through sequence enumeration, " in SESD '99üProceedings of the Science and Engineering for Software DevelopmentüA Recognition of Harlan D. Mills' Legacy. Washington, DC, USAüIEEE Computer Society, 1999, p. 14.
56. S. J. Prowell and J. H. Poore, "Foundations of sequence-based software specification, " IEEE Trans. Softw. Eng., vol. 29, no. 5, pp. 417-429, 2003.
57. S. Andler, "Predicate path expressions, " in POPL '79üProceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages. New York, NY, USAüACM Press, 1979, pp. 226-236.
58. M. Broy and I. Krüger, "Interaction interfaces - Towards a scientific foundation of a methodological usage of message sequence charts, " in ICFEM '98üProc. 2nd IEEE Int. Conf. on Formal Engineering Methods. IEEE Computer Society, 1998, pp. 2-13.
59. D. K. Peters, M. Lawford, and B. T. Widemann, "Software specification using tabular expressions and OMDoc, " 2007, Work in progress.
60. M. Kohlhase, OMDoc - An Open Markup Format for Mathematical Documents [V. 1.2], ser. LNAI 4180. Berlin, GermanyüSpringer, 2006.
61. G. H. Walton and J. H. Poore, "Measuring complexity and coverage of software specifications, " Information and Software Technology, vol. 42, pp. 859-872, 2000.
62. M. Cebrián, M. Alfonseca, and A. Ortega, "Common pitfalls using the normalized compression distanceüWhat to watch out for in a compressor, " Comms. Info. Sys., vol. 5, no. 4, pp. 367-384, 2005.