Show simple item record

dc.contributor.authorMoll, Keith Eugene
dc.date.accessioned2015-01-27T21:18:12Z
dc.date.available2015-01-27T21:18:12Z
dc.date.issued1989-07-01
dc.identifier.urihttps://hdl.handle.net/11244/14185
dc.description.abstractOver the past 10 to 15 years, several studies showing relationships among static complexity metrics have been performed. These include the number of lines of code, McCabe's cyclomatic complexity, Halstead's Software Science metrics, control flow metrics, and information flow metrics. Other studies have examined the relationships between static metrics and effort, clarity, productivity, quality, faults, and reliability. However, there have been very few studies that explore the relationship between static complexity metrics and dynamic measurements of programs. This exploratory, empirical study examines this relationship. The issues considered in this work include data collection procedures, the development of a counting strategy, the analysis of the static and dynamic measurements collected, and the examination of the significance between pairs of these measurements. A goal is to arrive at possible hypotheses to be tested in future, more extensive, controlled experiments. The results of this study show that there are significant correlations between some of the static and dynamic measurements.
dc.formatapplication/pdf
dc.languageen_US
dc.publisherOklahoma State University
dc.rights(c) Oklahoma Agricultural and Mechanical Board of Regents
dc.titleEmpirical Study of the Relationship Between Static Software Complexity Metrics and Dynamic Measurements of Pascal and C Programs
dc.typetext
osu.filenameThesis-1989-M726e.pdf
osu.accesstypeOpen Access
dc.description.departmentComputing and Information Sciences
dc.type.genreThesis


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record