scientific article; zbMATH DE number 3924114

MaRDI QIDQ3698290zbMATH OpenFDO

Authors Curtis R. Cook, Warren A. Harrison

Publication date 1984

zbMATH Keywords

call graphflow graphprogram complexity measureprogram graph

Mathematics Subject Classification ID

Graph theory (05C99) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 3913694
• scientific article; zbMATH DE number 168428
• Measuring prime program complexity
• A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS
• Publication:4896252

Cited in

(15)

• Complexity measures for concurrent programs based on information- theoretic metrics
• Measuring prime program complexity
• Using software complexity measures to analyze algorithms -- an experiment with the shortest-paths algorithms.
• An axiomatic approach to network complexity
• Control flow graphs and code coverage
• Applying Mccabe's complexity measure to multiple-exit programs
• Cyclomatic complexity for generalized nets
• scientific article; zbMATH DE number 3913694 (Why is no real title available?)
• A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS
• A complexity measure for data flow models
• scientific article; zbMATH DE number 168428 (Why is no real title available?)
• scientific article; zbMATH DE number 1008446 (Why is no real title available?)
• Evaluating Measure of Program Quality
• scientific article; zbMATH DE number 936824 (Why is no real title available?)
• The structured complexity of object-oriented programs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3698290)