@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}}}
}

{"_id":"vqNdva54esPEKk5Pb","bibbaseid":"sutter-codecomplexityparti","authorIDs":[],"author_short":["Sutter, H."],"bibdata":{"bibtype":"incollection","type":"incollection","title":"Code Complexity - Part I","author":[{"propositions":[],"lastnames":["Sutter"],"firstnames":["Herb"],"suffixes":[]}],"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","bibtex":"@incollection{sutterCodeComplexityPart1997a,\n title = {Code {{Complexity}} - {{Part I}}},\n author = {Sutter, Herb},\n date = {1997-09},\n url = {http://mfkp.org/INRMM/article/13411653},\n 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.},\n keywords = {*imported-from-citeulike-INRMM,~INRMM-MiD:c-13411653,bifurcation-analysis,codelet,complexity,computational-science,software-uncertainty},\n number = {GotW \\#20},\n series = {Guru of the {{Week}}}\n}\n\n","author_short":["Sutter, H."],"key":"sutterCodeComplexityPart1997a","id":"sutterCodeComplexityPart1997a","bibbaseid":"sutter-codecomplexityparti","role":"author","urls":{"Paper":"http://mfkp.org/INRMM/article/13411653"},"keyword":["*imported-from-citeulike-INRMM","~INRMM-MiD:c-13411653","bifurcation-analysis","codelet","complexity","computational-science","software-uncertainty"],"downloads":0},"bibtype":"incollection","biburl":"https://tmpfiles.org/dl/58794/INRMM.bib","creationDate":"2020-07-02T22:41:30.300Z","downloads":0,"keywords":["*imported-from-citeulike-inrmm","~inrmm-mid:c-13411653","bifurcation-analysis","codelet","complexity","computational-science","software-uncertainty"],"search_terms":["code","complexity","part","sutter"],"title":"Code Complexity - Part I","year":null,"dataSources":["DXuKbcZTirdigFKPF"]}