Showing papers in "Journal of Systems and Software in 1988"

TL;DR: Based on a study of only eight medium-scale scientific projects, the data strongly support the value of the proposed complexity measure in this context and graphic representations of the software designs demonstrate structural differences corresponding to the results of the numerical complexity analysis.

TL;DR: The Eiffel programming environment, using C as an intermediate language, supports separate compilation of classes and achieves a good run-time performance in both space and time, taking care of automatically recompiling classes as needed after a change.

TL;DR: The model is used to investigate the viability of two project strategies for “curing” the 90% syndrome problem and results obtained from an analysis of a NASA software project indicate that the problem arises because of the interaction of two factors.

TL;DR: Over 120 of the many publications on software metrics that have appeared since 1980 are classified and presented in five tables that comprise the use of classic metrics, a description of new metrics, software metrics through the life cycle, code metrics and popular programming languages, and various metric-based estimation models.

TL;DR: A framework for automated static analysis of distributed programs written in Ada aimed at discovery of a program's potential tasking behavior, that is, behavior in terms of tasking-related issues.

TL;DR: A taxonomy of the early stages of the software development life cycle is presented to enable prospective tool and technique users to understand what they are buying and to enable future toolsmiths and technique developers to uniquely categorize and characterize their product in comparison with others.

TL;DR: A methodology employing integer programming by which the amount of testing required to provide the maximum possible test coverage of the test requirements (for the given test set) is assured while at the same time minimizing the total number of tests to be included in a test suite is described.

TL;DR: Direction in meeting challenges in data collection, analysis and sharing is given by means of an illustrative multiple-case study of application software maintenance, which combines quantitative with qualitative data.

TL;DR: This work proposes a standard representation of imperative language programs that is independent of the syntax of any particular programming language, and that supports the definition of a wide range of tools and measures.

TL;DR: It is shown that the results of N-version programming where an equivalent assumption of independent failures of the component versions may not be valid are not equivalent although both approaches can improve system reliability.

TL;DR: Results indicate that the waterfall model is not very reelistic in prectice, and that as technology introduces further perturbations to this model with wncepts like executable specifications, rapid prototyping, and wide-spectrum languages, the model of this process needs to modify.

TL;DR: This paper describes a new tool for interactive software reliability analysis using the computer that allows the user to perform a complete reliabilityAnalysis using any of eight well-known models appearing in the literature.

TL;DR: Results seem to suggest that practice, more than instruction, is important in teaching students to find and correct programming errors.

TL;DR: In this paper, the authors describe a technique to translate source code into a meta-language which will maintain the proprietary nature of the original source code by hiding the algorithms and data structures employed in the source code.

TL;DR: A metric analysis environment for the COBOL programming language is presented that, through the use of a commercial data base management system, accesses a set of files produced by a static analysis tool, providing an amazingly flexible source of data for software metric analysis.

TL;DR: The guarded expression, with a novel semantics, is shown to be a convenient language construct that is developed and incorporated into an algorithm that uses the sign and the truth value of a guard to detect a discontinuity (including instantaneous discontinuities).

TL;DR: The semantics of a dynamic binding feature for a block-structured, strongly typed language and the incorporation of the feature into a Pascal implementation are described.

TL;DR: The results indicate that graphic methods should be strongly considered when teaching relatively complex algorithms and that there may be two types of learners: a type that prefers flowcharts (a graphical method) or for a verbal method (pseudocode) when learning short, relativelycomplex algorithms.

TL;DR: This paper derives cost expressions for query processing for these index placement strategies, and presents the results of simulation to compare the total cost of performing join operations with that of the semijoin technique.

TL;DR: The EQUATE testing strategy offers strong support for data and functional abstraction and chooses a set of expressions derived from the abstract syntax tree of the module being tested.

TL;DR: A comparison of a graphical and a textual design language is presented in an effort to support research findings that the human brain works more effectively in images than in text.

TL;DR: Cepage (pronounced say-paJi) is intended to make the full power of computer-aided design available to software developers in practical environments and frees its users from many of the chores traditionally associated with software design.

TL;DR: A practical approach to performance modeling of multiple processor systems involving dependence of workload as well as system configuration, which consists of classes of processes, and includes priorities of requests is presented.

TL;DR: One possible interface for a clean, simple interface between the run-time environment that supports execution of Ada programs and the code generated by an Ada compiler is presented, based on lessons learned on the FSU/AFATL Ada compiler project and more recent studies of the trade-offs encountered in implementing Ada for small real-time multiprocessor systems.

TL;DR: A new technique is presented that requires only one access to secondary storage to retrieve a method, which is designed for real-memory implementations of object-oriented programming languages.

TL;DR: The SMDC system provides a number of statistical functions and plotting routines that can be used for detailed analysis of existing data and is available for use by non-Purdue researchers with some limitations.

TL;DR: The reliability evaluation of every interconnection is presented, taking into account the configuration size, and a comparison of models and configurations is emphasized to help in ranking them for MIMD operational conditions.

TL;DR: The environment is called declarative because it diagnoses what may be wrong prior to execution rather than explaining how a buggy case came up during the execution, and improves the quality of code without mandating any restrictive programming methodology.