A topological analysis of the complexity of computer programs with less than three binary branches

@inproceedings{Harrison1981ATA,
  title={A topological analysis of the complexity of computer programs with less than three binary branches},
  author={Warren A. Harrison and Kenneth I. Magel},
  booktitle={SIGP},
  year={1981}
}
Katzan [4] defines the complexity of a system as referrin g to the number of relations or connections among components of th e system . Most would agree that it is an understatement to sa y that computer programs are complex entities . Indeed, they are s o complex that at times one marvels at the fact that they are eve n developed . Even more important than their original developmen t however, is the fact that they must often be modified an d therefore comprehended over and over again by people… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…