Quantification of structural information: on a question raised by Brooks

ABSTRACT

We introduce the notion of generative software complexity to illustrate some of the problems one may run into when trying to tackle a special case of a question recently raised by Brooks.

REFERENCES

• 1: B. S. Baker, On finding duplication and near-duplication in large software systems, Proceedings of the Second Working Conference on Reverse Engineering, p.86, July 14-16, 1995
• 2: Ted J. Biggerstaff, A perspective of generative reuse, Annals of Software Engineering, 5, p.169-226, 1998
• 3: Frederick P. Brooks, Jr., Three great challenges for half-century-old computer science, Journal of the ACM (JACM), v.50 n.1, p.25-26, January 2003 [doi>10.1145/602382.602397]
• 4: {CE00} K. Czarnecki and U. Eisenecker. Generative Programming. Addison-Wesley, 2000.
• 5: Norman E. Fenton , Shari Lawrence Pfleeger, Software Metrics: A Rigorous and Practical Approach, PWS Publishing Co., Boston, MA, 1998
• 6: Ming Li , Paul Vitányi, An introduction to Kolmogorov complexity and its applications (2nd ed.), Springer-Verlag New York, Inc., Secaucus, NJ, 1997
• 7: {SBnd} Y. Smaragdakis and D. Batory. Application generators. Technical report, Department of Computer Science, University of Texas at Austin, n.d. http://www.cc.gatech.edu/~yannis/generators.pdf.