Code Complexity - Part I. Sutter, H. In of Guru of the Week.
Code Complexity - Part I [link]Paper  abstract   bibtex   
This problem presents an interesting challenge: How many execution paths can there be in a simple three-line function? The answer will almost certainly surprise you. [Excerpt] One purpose of this GotW was to demonstrate just how many invisible execution paths can exist in simple code in a language that allows exceptions. Does this invisible complexity affect the function's reliability and testability? See the following GotW problem for the answer.
@incollection{sutterCodeComplexityPart1997a,
  title = {Code {{Complexity}} - {{Part I}}},
  author = {Sutter, Herb},
  date = {1997-09},
  url = {http://mfkp.org/INRMM/article/13411653},
  abstract = {This problem presents an interesting challenge: How many execution paths can there be in a simple three-line function? The answer will almost certainly surprise you. [Excerpt] One purpose of this GotW was to demonstrate just how many invisible execution paths can exist in simple code in a language that allows exceptions. Does this invisible complexity affect the function's reliability and testability? See the following GotW problem for the answer.},
  keywords = {*imported-from-citeulike-INRMM,~INRMM-MiD:c-13411653,bifurcation-analysis,codelet,complexity,computational-science,software-uncertainty},
  number = {GotW \#20},
  series = {Guru of the {{Week}}}
}

Downloads: 0