System and method for determining program complexity
AssigneeCisco Technology, Inc.
InventorsTennis Smith, Dean Hiller, John Waclawsky
Life of this patent
Estimating the term…
Abstract
A system and method for determining complexity of a computer subroutine having a plurality of statements, during development of the subroutine is disclosed. The method includes analyzing the plurality of statements and computing a complexity factor for a completed portion of the subroutine. The steps of analyzing the subroutine and computing a complexity factor are repeated following input of another statement into the subroutine. A system for determining complexity of a subroutine comprises an analyzer operable to analyze the statements and compute a complexity factor following the input of one of the plurality of statements.
Claims28
A method for determining complexity of an incomplete computer comprising a plurality of statements, during development of the subroutine, the method comprising:
- analyzing said plurality of statements;
- computing a complexity factor for a completed portion of the subroutine;
- inserting a non-compilable string of code into the subroutine when the complexity factor exceeds a maximum allowable value;
- and
- repeating analyzing the subroutine and computing a complexity factor following input of another statement into the subroutine.
A method for determining complexity of an incomplete computer subroutine comprising a plurality of statements, during development of the subroutine, the method comprising:
- analyzing said plurality of statements;
- computing a complexity factor for a completed portion of the subroutine by assigning weights to decision point keywords in the subroutine;
- and
- repeating analyzing the subroutine and computing a complexity factor following input of another statement into the subroutine.
A system for determining complexity of an incomplete computer subroutine comprising a plurality of statements, during development of the subroutine, the system comprising:
- an analyzer operable to analyze a completed portion of the subroutine and compute a complexity factor following the input of one of said plurality of statements into the subroutine;
- and
- a notification system operable to insert a non-compilable string of code into the subroutine when the complexity factor reaches a maximum allowable value.
A system for determining complexity of an incomplete computer subroutine comprising a plurality of statements, during development of the subroutine, the system comprising:
- an analyzer operable to analyze a completed portion of the subroutine and compute a complexity factor following the input of one of said plurality of statements into the subroutine, the analyzer comprising a counter operable to count the number of decision point keywords within the completed portion of the subroutine;
- and
- a table containing weights for each of the decision point keywords, the analyzer being operable to apply the weights to the decision point keywords to compute the complexity factor.
A computer program product for determining complexity of an incomplete computer comprising a plurality of statements, during development of the subroutine, the product comprising:
- computer code that analyzes a completed portion of the subroutine;
- computer code that computes a complexity factor following the input of one of said plurality of statements into the subroutine;
- computer code that inserts a non-compilable string of code into the subroutine when the complexity factor exceeds a maximum allowable value;
- and
- a computer readable medium that stores the computer codes.
A method for identifying incomplete computer subroutine complexity during input of statements forming the subroutine into a computer, the method comprising:
- inputting a statement during development of a subroutine;
- analyzing said statement along with previously entered statements of the subroutine;
- computing a complexity factor for a completed portion of the subroutine;
- updating the complexity factor upon input of a new statement;
- and
- preventing the subroutine from running when the complexity factor exceeds a maximum allowable value by inserting a non-compilable string of code into the subroutine.
A method for identifying incomplete computer subroutine complexity during input of statements forming the subroutine into a computer, the method comprising:
- inputting a statement during development of a subroutine;
- analyzing said statement along with previously entered statements of the subroutine;
- computing a complexity factor for a completed portion of the subroutine by assigning weights to decision point keywords in the subroutine;
- and
- updating the complexity factor upon input of a new statement.
Dependencies are inferred from the claim text.