My Account Log in

1 option

Software Complexity : Measures and Methods / Horst Zuse.

DGBA Physical Sciences 1990 - 1999 Available online

View online
Format:
Book
Author/Creator:
Zuse, Horst, Author.
Series:
Programming complex systems ; 4.
Programmierung Komplexer Systeme / Programming Complex Systems ; 4
Language:
English
Subjects (All):
Computer software--Evaluation.
Computer software.
Physical Description:
1 online resource (xv, 605 pages) : illustrations.
Edition:
Reprint 2019
Place of Publication:
Berlin ; Boston : De Gruyter, [2019]
Language Note:
In English.
Summary:
Presents the knowledge and tools necessary for critically evaluating existing and future software complexity measures, understanding software measurement and theory, and applying standardized software complexity measures in practice. After a theoretical discussion, some 90 software complexity measures and their application to software complexity measurement are presented. Annotation copyrighted by Book News, Inc., Portland, OR
Contents:
Software Complexity
Frontmatter
Preface
Acknowledgements
Contents
1. Introduction
2. Problems in Evaluating the Complexity of Programs
2.1. Difficulties in Interpreting the Results of Software Complexity Measurement
2.2. Problems in Interpreting Numerical Values
2.3. Problems in Determining the Complexity of Programs
2.4. Problems in Calculating the Arithmetic Mean
2.5. Problems in Selecting Appropriate Software Complexity Measures
3. Discussion about Software Measurement and Measures
3.1. What is Software Measurement?
3.2. An Overview of Software Measurement
3.3. What are Software Metrics/Measures?
3.4. Classification of Software Complexity Measures
3.5. Verbal Definitions of the Term Complexity
3.6. Limits to the Values of Software Measures
3.7. Remarks About Measures in Relationship to Measurement Theory and Scales
3.8. Summary
4. Measurement Theory and Criteria for Scales
4.1. The Definition of the Empirical Relational System and the Formal Relational System
4.2. The Definition of Scales and Meaningfulness
4.3. Criteria for Ordinal and Ratio Scales
4.4. Description of Measures as an Ordinal and Ratio Scale
4.5. Characterization of the Measure of McCabe
4.6. Summary
5. Models of Programs and their Definitions
5.1. Definitions of Control Flowgraphs
5.2. Definitions of Subflowgraphs and Primes
5.3. Definitions and Notation for Decomposition of Flowgraphs, Sequence and Nesting
5.4. Definitions of Structuredness of Flowgraphs
5.5. Definition of Intervals and Reducibiiity
5.6. Definition of Loops
5.7. Definition of Unstructuredness of Flowgraphs
5.8. Notations Used in this Book
6. Ideas Behind the Complexity of Programs
6.1. Desirable Properties of Measures by Tsai, Lopez, Rodriguez and Volovik
6.2. Desirable Properties of Measures by Evangeiisti
6.3. Ideas of Complexity by McCabe
6.4. Ideas of Complexity by Belady
6.5. Axioms of Complexity by Piwowarski
6.6. Axioms of Complexity by Bache
6.7. Desireable Properties of Complexity Measures by Weyuker
6.8. Required Properties for Measures by Jayaprakash, Lakshmanan and Sinha
6.9. Summary
7. Our Investigation of Software Complexity Measures
7.1. Overview of our Investigation of the Measures
7.2. The "Measure Demonstration System" MDS
7.3. Atomic Modifications, Partial Properties and the Ordinal Scale
7.4. Extensive Structure and Binary Operations between Programs
7.5. Conditions for the Use of Measures as an Ordinal and a Ratio Scale in Practice
7.6. Summary
8. Characterization of Software Complexity Measures
8.1. Selection of the Software Complexity Measures
8.2. Measures of Halstead
8.3. Measure Lines of Code
8.4. Measures of McCabe and Modifications
8.5. Measures "Relative and Absolute Logical Complexity" of Gilb
8.6. Measure "Control Flow Density" of Szentes and Potier
8.7. Measures of Szentes and Gras
8.8. Measure of Oviedo
8.9. Measure PATH of Schneidewind
8.10. Measures of Whitworth and Szulewski
8.11. Measures of Hecht and Extensions
8.12. Measure of Moawad and Hassan and Extensions
8.13. Measure "Reachability" of Schneidewind
8.14. Measures of Chen
8.15. Measures Based on the Prime Decomposition of Flowgraphs
8.16. Measure of Schmidt and Gong and Extensions
8.17. Measures Based on Ranges
8.18. Measures for Analyzing the Unstructuredness of Flowgraphs
9. Results and Research in the Future
9.1. List of the Investigated Measures
9.2. Partial Properties of the Measures
9.3. Properties of Measures Related to the Extensive Structure
9.4. Set of Measures to Measure the Intra-Modular Complexity
9.5. Measurement Process of Restructure and Software Reuse
9.6. Wrong and Correct Calculation of the Arithmetic Mean
9.7. Complexity In Comparison to Reference Programs and Program Versions
9.8. Validation of a Measure
9.9. Correlation between Software Complexity Measures
9.10. Open Problems and Research in the Future
10. Glossary of Terms
11. References
Name Index
Subject Index
Measure Index
Definition Index
Backmatter
Notes:
Description based on online resource; title from PDF title page (publisher's Web site, viewed 28. Sep 2020)
ISBN:
9783110866087
3110866080
OCLC:
1125194519

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account