Using a competitive learning neural network to evaluate software complexity

Authors:
John Sheppard;William R. Simpson
Affiliations:
ARINC Research Corporation;ARINC Research Corporation
Venue:
SIGSMALL '90 Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems
Year:
1990

Citing 5
Cited 0

The program dependence graph in static program testing

Information Processing Letters
Feature discovery by competitive learning

Parallel distributed processing: explorations in the microstructure of cognition, vol. 1
Functional path analysis: an approach to software verification

CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
On the control dependence in the program dependence graph

CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Elements of Software Science (Operating and programming systems series)

Elements of Software Science (Operating and programming systems series)

Quantified Score

Hi-index	0.00

Visualization

Abstract

With recent advances in neural networks, an increasing number of application areas are being explored for this technology. Also, as software takes a more prominent role in systems engineering, ensuring the quality of software is becoming a critical issue. This paper explores the application of one neural network paradigm—the competitive learning network—to the problem of evaluating software complexity. The network was developed by ARINC Research Corporation for its SofTest software analysis system, developed on a Sun workstation. In this paper, we discuss the network used in SofTest and the approach taken to train the network. We conclude with a discussion of the implications of the approach and areas for further research.