1989
DOI: 10.1145/70470.70473
|View full text |Cite
|
Sign up to set email alerts
|

Software metrics: using measurement theory to describe the properties and scales of static software complexity metrics

Abstract: Over the last decade many software metrics have been introduced by researchers and many software tools have been developed using software metrics to measure the "quality" of programs. These metrics for measuring productivity, reliability, maintainability, and complexity, for example, are vital to software development planning and management. In this paper a new approach is presented to describe the properties of the software metrics and their scales using measurement theory. Methods are shown to describe a sof… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

1991
1991
2002
2002

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 31 publications
(6 citation statements)
references
References 5 publications
0
6
0
Order By: Relevance
“…We see that Theorem 2 gives us conditions for the additive ratio scale. In Bollmann and Zuse (t 987), Zuse and Bollmann (1989) and Zuse (1991) these concepts are applied to static software complexity measures on ftowgraphs.…”
Section: A•>_/ B~*#(a) ~> #(B)mentioning
confidence: 99%
See 3 more Smart Citations
“…We see that Theorem 2 gives us conditions for the additive ratio scale. In Bollmann and Zuse (t 987), Zuse and Bollmann (1989) and Zuse (1991) these concepts are applied to static software complexity measures on ftowgraphs.…”
Section: A•>_/ B~*#(a) ~> #(B)mentioning
confidence: 99%
“…We proposed the concatenation operations BSEQ and BALT, which are related to programs/ flowgraphs, in Bollmann and Zuse (1987); Zuse (1985;1991); Zuse and Bollmann (1989;1992). Additionally, the concatenation operations DSEQ and DALT for the Constantine software design method are proposed.…”
Section: Measurement Theory and Complexity Measuresmentioning
confidence: 99%
See 2 more Smart Citations
“…A viewpoint is a binary relation .> defined on the set P. For P, P', P" e set P , the following axioms must hold: P .> P (reflexivity) P .> P or P .> P (completeness) P.> P', P'.> P" => P.> P" (transitivity) i.e., a viewpoint must be of weak order [Zuse, 1987].…”
Section: Introductionmentioning
confidence: 99%