A topological analysis of the complexity of computer programs with less than three binary branches-Reference-Cited by-同舟云学术

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

Published:1981-04 Issue:4 Volume:16 Page:51-63
ISSN:0362-1340
Container-title:ACM SIGPLAN Notices
language:en
Short-container-title:SIGPLAN Not.

Author:

Harrison Warren¹,Magel Kenneth¹

Affiliation:

1. University of Missouri-Rolla

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Graphics and Computer-Aided Design,Software

Reference6 articles.

1. Halstead M. Elements of Software Science Elsevier North Holland Inc. New York 1977. Halstead M. Elements of Software Science Elsevier North Holland Inc. New York 1977.

2. Measurement of program complexity by the pair

3. Harrison W. and Magel K. "A Complexity Measure Based On Nesting Level" ACM SIGPLAN Notices (to appear). 10.1145/947825.947829 Harrison W. and Magel K. "A Complexity Measure Based On Nesting Level" ACM SIGPLAN Notices (to appear). 10.1145/947825.947829

4. Katzan H. Systems Design and Documentation Van Nostrand Reinhold Co. New York 1976. Katzan H. Systems Design and Documentation Van Nostrand Reinhold Co. New York 1976.

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An empirical study on software understandability and its dependence on code characteristics;Empirical Software Engineering;2023-11

2. An empirical evaluation of the “Cognitive Complexity” measure as a predictor of code understandability;Journal of Systems and Software;2023-03

3. Quipu;ACM Transactions on Reconfigurable Technology and Systems;2013-05

4. A Quantitative Prediction Model for Hardware/Software Partitioning;2007 International Conference on Field Programmable Logic and Applications;2007-08

5. A Discourse on Complexity of Process Models;Business Process Management Workshops;2006