Search Constraints

Start Over
Filtering by: Creator Cook, J. R. Remove constraint Creator: Cook, J. R. Resource Type Technical Report Remove constraint Resource Type: Technical Report

Search Results

  • Graph theoretic program complexity measures

    Creator:
    Cook, Curtis R.
    Abstract:
    Recently several simply computed graph theoretic measures of computer program complexity, testing and unstructuredness have been proposed. Most of them are based on a static analysis of the program graph. One of the best known and most widely accepted is the cyclomatic number. Another is the number of knots, or...
    Resource Type:
    Technical Report
    Full Text:
    Curtis R. Cook Department of Computer Science Oregon State University Corvallis, Oregon 97331 l

  • Information theory metric for assembly language

    Creator:
    Cook, Curtis R.
    Abstract:
    This paper presents a study of the distribution of assembly language instructions in two avionics software applications and the development of an information theoretic software complexity metric based on the study. The instructions were grouped into classes , e.g. load and store, arithmetic, jump, compare, etc. As expected the distribution...
    Resource Type:
    Technical Report
    Full Text:
    METRIC FOR ASSEMBLY LANGUAGE Curtis R. Cook Computer Science Department Oregon State University

  • Context-free grammars with graph control

    Creator:
    Cook, Curtis R.
    Abstract:
    Context-free grammars with graph control provide a general framework for the various types of context-free grammars with regulated rewriting. The vertices or edges of the directed graph are labeled with the productions of the grammar. The only strings in the language generated by the grammar are those whose derivations correspond...
    Resource Type:
    Technical Report
    Full Text:
    ., \ ~ . . ~ ' ..... . " .. ' . \ . ' . I . l .' 78-20-2 Context-Free Grammars with Graph Control CURTIS R. COOK Department of

  • Are deeply nested conditionals less readable?

    Creator:
    Harrison, Warren and Cook, Curtis R.
    Abstract:
    There is some debate over the effect of using deeply nested control structures upon programmer comprehension. In order to test the effect of deeply nested IF-THEN-ELSE statements, we split 148 computer science students of varing backgrounds into two groups. One group received a listing of a program that made excessive...
    Resource Type:
    Technical Report
    Full Text:
    , , U , , , y , ] ; ey: =[ I e I , I y I J; mnt:=['m','n', 't'J; rtlc:=['r', 't', 'l ', 'c']; lstc

  • Insights on improving the maintenance process through software measurement

    Creator:
    Harrison, Warren and Cook, Curtis R.
    Abstract:
    This paper develops a new model of software maintenance based upon an objective decision rule which determines whether a given software module can be effectively modified, or if it should instead be rewritten. Completely rewriting a module can be expensive, but it can be even more expensive if the module's...
    Resource Type:
    Technical Report
    Full Text:
    Portland State University Portland, Oregon 97207-0751 . Curtis Cook Department of Computer Science

  • A software complexity metric for C++

    Creator:
    Lake, Al and Cook, Curtis R.
    Resource Type:
    Technical Report
    Full Text:
    . 317-324. I n n n f I I r l J I j J J a l n n n n n f I l l j j J

  • Program comprehension differences in debugging

    Creator:
    Nanja, Murthi and Cook, Curtis R.
    Abstract:
    Many studies have shown that expert programmers are more effective at debugging programs than novice programmers. These studies have suggested that the major reason for this difference is due to the experts' superior comprehension of the program. This paper reports two experiments which investigated expert and novice student programmers program...
    Resource Type:
    Technical Report
    Full Text:
    differences in debugging Murthi tlanja Curtis Cook Computer Science Department Oregon State University

  • A survey of graph theoretic computer program complexity measures

    Creator:
    Cook, Curtis R. and Harrison, Warren
    Abstract:
    A computer program complexity measure is a measure of how easy the program is to understand, test, modify, maintain, etc. Many of these measures are derived from the control or flow graph of the program. We describe these measures graph theoretically, indicate what aspect or aspects of the program they...
    Resource Type:
    Technical Report
    Full Text:
    COMPUTER PROGRAM COMPLEXITY MEASURES Curtis R. Cook Warren Harrison Department of Computer Science

  • STYLE : an automated program style analyzer for Pascal

    Creator:
    Lake, Al and Cook, Curtis R.
    Resource Type:
    Technical Report
    Full Text:
    .... '>tqh~,pos D B I fl U) h .... S 1 ~J l (~, p r 11. L .. S 1 ~J l e

  • A preliminary investigation of the effects of FORTRAN data declaration and type conversion features on program comprehension

    Creator:
    Nanja, Murthy and Cook, Curtis R.
    Abstract:
    FORTRAN permits both explicit and implicit options for both data declaration and type conversion features. This study investigated the effects of explicit and implicit data declaration and type conversion features on a program comprehension task performed by FORTRAN pro­grammers in an introductory programming course. The results indicated that both factors...
    Resource Type:
    Technical Report
    Full Text:
    fl .. • O~l' f.fff~~i. '...- tr:"'.' r.0~r~, ITCR SCIENCE OREGO;J r:· .. ;;\ i-r:: \i;/ 1