An empirical study of iteration in applications software

https://doi.org/10.1016/0164-1212(93)90108-AGet rights and content

Abstract

Several real-world applications programs were studied to determine what patterns of iteration over data structures they contained. It was found that over half of all loops in these programs were iterations over data structures which were implementations of sets or sequences, and were either unconditional iterations over every element in the structure or search loops. Although there was considerable variation, a large fraction of the loops fell into these categories for every application and every programmer studied. Implications for program design methods, programming education, and programming language design are discussed.

References (13)

  • C.A.R. Hoare

    A Note on the FOR Statement

    BIT

    (1972)
  • E. Soloway et al.

    Empirical Studies of Programming Knowledge

    IEEE Trans. Software Eng.

    (1984)
  • W.L. Johnson et al.

    PROUST: Knowledge-based program understanding

  • C.L. Liu

    Elements of Discrete Mathematics

    (1985)
  • B. Liskov et al.

    Abstraction and Specifications in Program Development

    (1986)
  • C. Ghezzi et al.

    Programming Language Concepts

    (1987)
There are more references available in the full text version of this article.

Cited by (3)

View full text