Circuit theoretic approaches to determining software complexity
| Autor: | H. Singh, L. Anneberg |
|---|---|
| Rok vydání: | 2002 |
| Předmět: |
Theoretical computer science
Computer science Programming complexity Search-based software engineering Operand Software metric Software quality Software sizing Component-based software engineering Software construction Software design Software system Halstead complexity measures Software design description Software verification |
| Zdroj: | Proceedings of 36th Midwest Symposium on Circuits and Systems. |
| DOI: | 10.1109/mwscas.1993.343212 |
| Popis: | New methodologies for complexity of software engineering systems are proposed. The new methodologies proposed in this paper are based on the classical approach of McCabe [1976], Halstead [1977], and Ramamurthy and Melton [1988]. In this new method, the McCabe method (based on graph theoretic loops) is modified to take into account the effect of the number of operators and operands. Comparison results for the four methodologies based on different programs are presented. In this paper, a combination of McCabe's and Halstead's methods similar to Ramamurthy and Melton is developed. > |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|