Maintenance plays an important role in the life cycle of a software product. It is estimated that there are more than 100 billion lines of code in production in the world. As much as 80% of it is unstructured, patched and not well documented. Maintenance can alleviate these problems. The purpose of this paper is to explore the use of the Capability Maturity Model (CMM) to improve the quality of...

Various measures and methods have been developed to measure the sizes of different software entities produced throughout the life cycle. Understanding the nature of the relationship between the sizes of these products has become significant due to various reasons. One major reason is the ability to predict the size of the later phase products by using the sizes of early life cycle products. For...

Creative text generation projects of different sizes (in terms of lines of code and length of development time) are described. “Extra-small,” “small,” “medium,” and “large” projects are discussed as participating in the practice of creative computing differently. Different ways in which these projects have circulated and are being used in the community of practice are identified. While large-sc...

Previous empirical observations on the development of software systems indicate that the effort required for developing software is primarily driven by the size of the software which is measured by either the source line of code (SLOC) or function based metrics, such as Function Points. However, since most large scale systems today are more software intensive, where with the growing complexity ...

As software systems evolve over a series of releases, it becomes important to know which components show repeated need for maintenance. Deterioration of a single component manifests itself in repeated and increasing problems that are local to the component. A second type of deterioration is related to interactions between components, that is, components are repeatedly change-prone in their rela...

–Conflict-Driven Clause Learning: – are believed to be well-known: ∗ They embed dynamic heuristics [6, 3], learning [7], restarts [4, 1] and lazy data structures [6]. ∗ (efficient) SAT Solvers can be written from scratch in less than a thousand lines of code. – are not so well-known: ∗Who really understand the underlying mechanisms? ∗No real experimental studies: Progresses have been made with ...

This article explores the ways in which the political tactics that governmental insitutions and their critics can be seen to engage in on the Worldwide Web, may provide a basis for reconsidering a type of politics called issue-politics. From the vantage point of an ethnography of public controversies on the Web, informed by actor-network theory, the debate on the merits and defects of issue-pol...

As SAT becomes more popular due to its ability to handle large real-world problems, progress in efficiency appears to have slowed down over the past few years. On the other hand, we now have access to many sophisticated implementations of SAT solvers, sometimes boasting large amounts of code. Although low-level optimizations can help, we argue that the SAT algorithm itself offers opportunities ...

The analysis described in this article detects about two real and uncorrected deadlock situations per thousand C source files or million lines of code in the Linux kernel source, and three accesses to freed memory, at a few seconds per file. In distinction to model-checking techniques, the analysis applies a configurable “3-phase” Hoare-style logic to an abstract interpretation of C code to obt...

We present a simple framework for theta-subsumption testing in Prolog. In its simplest instantiation, it yields an algorithm that takes only a few dozen lines of code. Despite its simplicity, the framework has turned out to work very well on data where a state-of-the-art subsumption engine suffered from excessive run times. The framework can easily be instantiated in different ways, precisely b...