21934141
Micro pattern evolution
When analyzing the evolution history of a software project, we wish to develop results that generalize across projects. One approach is to analyze design patterns, permitting characteristics of the evolution to be associated with patterns, instead of source code. Traditional design patterns are generally not amenable to reliable automatic extraction from source code, yet automation is crucial for scalable evolution analysis. Instead, we analyze "micro pattern" evolution; patterns whose abstraction level is closer to source code, and designed to be automatically extractable from Java source code or bytecode. We perform micro-pattern evolution analysis on three open source projects, ArgoUML, Columba, and jEdit to identify micro pattern frequencies, common kinds of pattern evolution, and bug-prone patterns. In all analyzed projects, we found that the micro patterns of Java classes do not change often. Common bug-prone pattern evolution kinds are 'Pool → Pool', 'Implementor → NONE', and 'Sampler → Sampler'. Among all pattern evolution kinds, 'Box', 'CompoundBox', 'Pool', 'CommonState', and 'Outline' micro patterns have high bug rates, but they have low frequencies and a small number of changes. The pattern evolution kinds that are bug-prone are somewhat similar across projects. The bug-prone pattern evolution kinds of two different periods of the same project are almost identical.
11670082
Managerial Issues for the Consideration and Use of Formal Methods
The introduction of formal methods into the commercial community has been slow. This might, in part, be due to lack of guidance for program managers responsible for execution of a program, who must justify added expense or time to delivery. This paper first provides managers with guidance in deciding if a particular project is a good candidate for the use of formal methods. After the go/no go conditions are considered, the paper describes some of the management and reporting issues that may arise if the decision is made to use formal methods on a program.
6273632
Uniform comparison of data models using containment modeling
Containment data models are a subset of entity relationship models in which the allowed relationships are either a type of containment, storage, or inheritance. This paper describes containment relationships, and containment data models, applying them to model a broad range of monolithic, link server, and hyperbase systems, as well as the Dexter reference model, and the WWW with WebDAV extensions. A key quality of containment data models is their ability to model systems uniformly, allowing a broad range of systems to be compared consistently.
5221782
WebDAV: A network protocol for remote collaborative authoring on the Web
Collaborative authoring tools generate network effects, where each tool's value depends not just on the tool itself, but on the number of other people who also have compatible tools. We hypothesize that the best way to generate network effects and to add collaborative authoring capability to existing tools is to focus on the network protocol. This paper explores a protocol-centric approach to collaborative authoring by examining the requirements and functionality of the WebDAV protocol. Key features of the protocol are non-connection-oriented concurrency control, providing an upward migration path for existing non-collaborative applications, support for remote manipulation of the namespace of documents, and simultaneous satisfaction of a wide range of functional requirements.
45780832
Collaborative Work: Distributed Authoring and Versioning
8320820
Identification of software instabilities
As software evolves, maintenance practices require aprocess of accommodating changing requirements whileminimizing the cost of implementing those changes. Overtime, incompatibilities between design assumptions andthe operational environment become more pronounced,requiring some regions of the implementation to requirerepeated modification. These regions are considered tobe "unstable", and may benefit from targetedrestructuring efforts as a means of realigning theseassumptions and the environment.An analysis of these regions that identifies andclassifies these instabilities can be used to prioritize anddirect structural maintenance efforts. To this end, wepresent an identification approach that augments staticdependence graphs with data retrieved fromconfiguration management (CM) systems. This approachavoids the assumption that artifacts changing within thesame CM transaction are related, without requiringsophisticated change management data. We alsodescribe our work-to-date in validating the underlyingassumptions and identifying instabilities.
911709
Homeomorphs and amallamorphs of the Petersen graph
Let P be the Petersen graph. The main results of this paper are the discovery of infinite families of chromatically equivalent pairs of P homeomorphs and the discovery of infinite families of flow equivalent pairs of P amallamorphs. In particular, three families of P homeomorphs with 8 parameters, five families with 7 parameters and many families with fewer parameters are obtained. Also one family of P amallamorphs with 9 parameters, three families with 7 parameters, seven families with 6 parameters and many families with fewer parameters are obtained.
20403548
The chromatic uniqueness of W10
Abstract Xu and Li proved the chromatic uniqueness of wheels on an odd number of vertices. It is known that the wheels on six vertices and eight vertices are not chromatically unique. Read found that the wheel on ten vertices is chromatically unique by computer computations. Here, we sketch a mathematical proof of the chromatic uniqueness of the wheel on ten vertices.
9513339
Chromatic polynomials of homeomorphism classes of graphs
Abstract We study a multilinear polynomial which subsumes the chromatic polynomials of all the graphs in a given homeomorphism class. We show that this polynomial can be extended to include further families of homeomorphic graphs, and derive some properties of its coefficients. We also prove similar results for the dual concept of graphs with multiple edges.
205877725
Chromaticity of a family of K4 homeomorphs
Abstract A K 4 homeomorph can be described as a graph on n vertices having 4 vertices of degree 3 and n − 4 vertices of degree 2; each pair of degree 3 vertices is joined by a path. We study the chromatic uniqueness and chromatic equivalence of one family of K 4 homeomorphs. This family has exactly 3 paths of length one. The results of this study leads us to solve 3 of the problems posed by Koh and Teo in their 1990 survey paper which appeared in Graphs and Combinatorics.
31951842
The chromaticity of certain graphs with five triangles
Abstract Let W(n, k) denote the graph of order n obtained from the wheel Wn by deleting all but k consecutive spokes. In this note, we study the chromaticity of graphs which share certain properties of W(n, 6) which can be obtained from the coefficients of the chromatic polynomial of W(n, 6). In particular, we prove that W(n, 6) is chromatically unique for all integers n⩾8. We also obtain two additional families of chromatically unique graphs.