A complexity measure based on nesting level

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A complexity measure based on nesting level

Full text

Pdf (539 KB)

Source

ACM SIGPLAN Notices archive
Volume 16 , Issue 3 (March 1981) table of contents

Pages: 63 - 74

Year of Publication: 1981

ISSN:0362-1340

Authors

Warren A. Harrison	University of Missouri-Rolla
Kenneth I. Magel	University of Missouri-Rolla

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 32, Citation Count: 21

Additional Information:

references cited by collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/947825.947829 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Maurice H. Halstead, Elements of Software Science (Operating and programming systems series), Elsevier Science Inc., New York, NY, 1977
	2	Gary A. Kildall, A unified approach to global program optimization, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.194-206, October 01-03, 1973, Boston, Massachusetts [doi>10.1145/512927.512945]
	3	McCabe, Thomas J., "A Complexity Measure", IEEE Transactions of Software Engineering, Vol. SE-2, No. 4 (Dec 1976).

CITED BY 21

	Henry Basson , Jean Claude Derniame, Quality tree extensions and partial instantiation for Ada objects, Proceedings of the eighth annual Washington Ada symposium & summer SIGAda meeting on Ada: software: foundation for competitveness, p.156-171, June 17-21, 1991, McLean, Virginia, United States
	Narayan C. Debnath, A new abstraction for the study of module interconnection, Proceedings of the 19th annual conference on Computer Science, p.181-189, April 1991, San Antonio, Texas, United States
	J. Chris Coppick , Thomas J. Cheatham, Software metrics for object-oriented systems, Proceedings of the 1992 ACM annual conference on Communications, p.317-322, March 03-05, 1992, Kansas City, Missouri, United States
	Kenneth Magel, A theory of small program complexity, ACM SIGPLAN Notices, v.17 n.3, p.37-45, March 1982
	Anne Schroeder, Integrated program measurement and documentation tools, Proceedings of the 7th international conference on Software engineering, p.304-313, March 26-29, 1984, Orlando, Florida, United States
	Christian Collberg , Clark Thomborson , Douglas Low, Manufacturing cheap, resilient, and stealthy opaque constructs, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.184-196, January 19-21, 1998, San Diego, California, United States
	Huisheng Gong , Monika Schmidt, A complexity measure based on selection and nesting, ACM SIGMETRICS Performance Evaluation Review, v.13 n.1, p.14-19, June 1985
	Paul Piwowarski, A nesting level complexity measure, ACM SIGPLAN Notices, v.17 n.9, p.44-50, September 1982
	Henry Basson , Jean Claude Derniame, Towards an evolutive kernel of mesurements on Ada sources developed on an integrated software engineering environmentsoftware engineering environment, Proceedings of the seventh Washington Ada symposium on Ada, p.37-53, July 1990, McLean, Virginia, United States
	J. S. Davis , R. J. LeBlanc, A Study of the Applicability of Complexity Measures, IEEE Transactions on Software Engineering, v.14 n.9, p.1366-1372, September 1988
	Warren Harrison , Curtis Cook, A method of sharing industrial software complexity data, ACM SIGPLAN Notices, v.20 n.2, February 1985
	Kenneth Magel, Efficient calculation of the scope program complexity metric, ACM SIGPLAN Notices, v.21 n.9, September 1986
	Giovanni Cantone , Aniello Cimitile , Lucio Sansone, Complexity in program schemes: the characteristic polynomial, ACM SIGPLAN Notices, v.18 n.3, March 1983
	Warren Harrison , Kenneth Magel, A topological analysis of the complexity of computer programs with less than three binary branches, ACM SIGPLAN Notices, v.16 n.4, April 1981
	Jacques J. Tamine, On the use of tree-like structures to symplify measures of complexity, ACM SIGPLAN Notices, v.18 n.9, September 1983
	Timothy K. Shih , Shi-Kuo Chang , Jeffrey Tsai , Jianhua Ma , Runhe Huang, Supporting Well-Engineered Web Documentation Development – a Multimedia Software Engineering Approach toward Virtual University Courseware Designs, Annals of Software Engineering, v.12 n.1, p.139-165, December 2001
	I Ion , R Arhire , M Macesanu, Programs complexity: comparative analysis hierarchy, classification, ACM SIGPLAN Notices, v.22 n.4, p.94-102, April 1987
	John M. Roche, Software metrics and measurement principles, ACM SIGSOFT Software Engineering Notes, v.19 n.1, p.77-85, Jan. 1994
	Christian Collberg , Ginger Myles , Andrew Huntwork, Sandmark--A Tool for Software Protection Research, IEEE Security and Privacy, v.1 n.4, p.40-49, July 2003
	Christian S. Collberg , Clark Thomborson , Gregg M. Townsend, Dynamic graph-based software fingerprinting, ACM Transactions on Programming Languages and Systems (TOPLAS), v.29 n.6, p.35-es, October 2007
	Bertrand Anckaert , Matias Madou , Bjorn De Sutter , Bruno De Bus , Koen De Bosschere , Bart Preneel, Program obfuscation: a quantitative approach, Proceedings of the 2007 ACM workshop on Quality of protection, October 29-29, 2007, Alexandria, Virginia, USA

Collaborative Colleagues:

Warren A. Harrison: colleagues

Kenneth I. Magel: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player