By Topic

Software Engineering, IEEE Transactions on

Issue 8 • Date Aug 1988

Filter Results

Displaying Results 1 - 16 of 16
  • The Tinkertoy graphical programming environment

    Publication Year: 1988 , Page(s): 1110 - 1115
    Cited by:  Papers (8)  |  Patents (23)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (544 KB)  

    The Tinkertoy graphical interface to Lisp is described, in which programs are `built' rather than written, out of icons and flexible interconnections. It represents a computer/user interface that can easily exceed the interaction speed of the best text-based language editors and command languages. It also provides a consistent framework for interaction across both editing and command execution. Mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A synthesis of software science measures and the cyclomatic number

    Publication Year: 1988 , Page(s): 1116 - 1121
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (472 KB)  

    A solution is obtained to the problem of defining a software measure or a family of measures which simultaneously detect those aspects of software complexity that are detected by the software science measures and the cyclomatic number. The authors present a family of measures, called weighted measures that is built on the software science measures by adding weights to certain operators and operand... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An acyclic expansion algorithm for fast protocol validation

    Publication Year: 1988 , Page(s): 1059 - 1070
    Cited by:  Papers (10)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1000 KB)  

    For the development of communications software composed of many modules, protocol validation is considered essential to detect errors in the interactions among the modules. Protocol validation techniques previously proposed have required validation time that is too long for many actual protocols. The authors propose a novel fast protocol validation technique to overcome this drawback. The proposed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards complexity metrics for Ada tasking

    Publication Year: 1988 , Page(s): 1122 - 1127
    Cited by:  Papers (12)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (516 KB)  

    Using Ada as a representative distributed programming language, the author discusses some ideas on complexity metrics that focus on Ada tasking and rendezvous. Concurrently active rendezvous are claimed to be an important aspect of communication complexity. A Petri net graph model of Ada rendezvous is used to introduce a rendezvous graph, an abstraction that can be useful in viewing and computing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple mechanism for type security across compilation units

    Publication Year: 1988 , Page(s): 1238 - 1239
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (200 KB)  

    A simple technique is described that detects structural-type clashes across compilation units with an arbitrarily high degree of confidence. The type of each external object is described in canonical form. A hash function compresses the description into a short code. If the code is embedded in a symbol-table name, then consistency can be checked by an ordinary linker. For distributed programs, run... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantic feedback in the Higgens UIMS

    Publication Year: 1988 , Page(s): 1188 - 1206
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1784 KB)  

    Almost all applications using interactive graphics contain important structures and concepts which are deeper than the geometres used to display them to the user. One of the major tasks of the system implementer is to cause the user interface to reflect this deeper structure accurately so that it may be directly manipulated by the user. The authors describe a tool, the Higgens user interface manag... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning dominance relations in combined search problems

    Publication Year: 1988 , Page(s): 1155 - 1175
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1952 KB)  

    Dominance relations are used to prune unnecessary nodes in search graphs, but they are problem-dependent and cannot be derived by a general procedure. The authors identify machine learning of dominance relations and the applicable learning mechanisms. A study of learning dominance relations using learning by experimentation is described. This system has been able to learn dominance relations for t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Program translation via abstraction and reimplementation

    Publication Year: 1988 , Page(s): 1207 - 1228
    Cited by:  Papers (25)  |  Patents (7)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2080 KB)  

    An abstraction-and-reimplementation paradigm is presented in which the source program is first analyzed in order to obtain a programming-language-independent abstract understanding of the computation performed by the program as a whole. The program is then reimplemented in the target language based on this understanding. The key to this approach is the abstract understanding obtained. It allows th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Support for reusability in Genesis

    Publication Year: 1988 , Page(s): 1145 - 1154
    Cited by:  Papers (11)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (880 KB)  

    Genesis is a software-engineering-based programming environment geared to support big software projects. The authors first discuss a reusability-driven development methodology that advocates software development based on reusability considerations. Then, they discuss the tools and techniques provided in Genesis to support this methodology. Techniques are suggested for improving the retrievability,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A system for generating language-oriented editors

    Publication Year: 1988 , Page(s): 1098 - 1109
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (960 KB)  

    The authors seek to establish a simple and flexible framework for internal representation of language-dependent information, and the behavior of language-oriented tools for user's operations. They present a system for generating language-oriented editors based on object-oriented concepts. Features of the target language are represented as classes and their relations. A program is represented as an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Delay-independent design for distributed systems

    Publication Year: 1988 , Page(s): 1229 - 1237
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (832 KB)  

    Methods of limiting the impact of communication delays on the logical behavior of distributed systems are considered. It is assumed that a distributed system is described in terms of a number of interconnected modules, and each module is described in terms of its possible states and the possible state transitions. Transitions may be initiated spontaneously by a module and may give rise to output m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analysis of some problems in managing virtual memory systems with fast secondary storage devices

    Publication Year: 1988 , Page(s): 1176 - 1187
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1016 KB)  

    Some of the problems that are expected to be encountered in managing virtual memory systems using the newer-technology secondary storage devices are address. The difficulties that two proposed policies have in choosing the most economical program localities of reference to assign to primary memory are analyzed. K. Koh's (1981) criterion for examining the cyclic locality interval (CLI) hierarchy of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An integrated life-cycle model for software maintenance

    Publication Year: 1988 , Page(s): 1128 - 1144
    Cited by:  Papers (15)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1488 KB)  

    An integrated life-cycle model is presented for use in a software maintenance environment. The model represents information about the development and maintenance of software systems, emphasizing relationships between different phases of the software life cycle. It provides the basis for automated tools to assist maintenance personnel in making changes to existing software systems. The model is ind... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed specification model and its prototyping

    Publication Year: 1988 , Page(s): 1090 - 1097
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (672 KB)  

    A specification model is described that is based on the finite-state machine but is distributed. The model allows the user to decompose a large system into separate views. Each view is a complete system in itself, and reveals how the whole system would behave as seen from a certain angle. Put together, the combined views present a complete picture of the whole system. The complexity of a large cen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Single-site and distributed optimistic protocols for concurrency control

    Publication Year: 1988 , Page(s): 1071 - 1080
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (896 KB)  

    The authors consider that, in spite of their advantage in removing the overhead of lock maintenance and deadlock handling, optimistic concurrency control methods have been applied less in practice than locking schemes. Two complementary approaches are introduced that may help render the optimistic approach practically viable. For the high-level approach, integration schemes can be utilized so that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluating database update schemes: a methodology and its applications to distributive systems

    Publication Year: 1988 , Page(s): 1081 - 1089
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (656 KB)  

    A methodology is presented for evaluating the performance of database update schemes in a distributive environment. The methodology makes use of the history of how data are used in the database. Parameters such as update-to-retrieval ratio and average file size can be set based on the actual characterization of a system. The analysis is specifically directed toward the support of derived data with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

The IEEE Transactions on Software Engineering is interested in well-defined theoretical results and empirical studies that have potential impact on the construction, analysis, or management of software. The scope of this Transactions ranges from the mechanisms through the development of principles to the application of those principles to specific environments. Specific topic areas include: a) development and maintenance methods and models, e.g., techniques and principles for the specification, design, and implementation of software systems, including notations and process models; b) assessment methods, e.g., software tests and validation, reliability models, test and diagnosis procedures, software redundancy and design for error control, and the measurements and evaluation of various aspects of the process and product; c) software project management, e.g., productivity factors, cost models, schedule and organizational issues, standards; d) tools and environments, e.g., specific tools, integrated tool environments including the associated architectures, databases, and parallel and distributed processing issues; e) system issues, e.g., hardware-software trade-off; and f) state-of-the-art surveys that provide a synthesis and comprehensive review of the historical development of one particular area of interest.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Matthew B. Dwyer
Dept. Computer Science and Engineering
256 Avery Hall
University of Nebraska-Lincoln
Lincoln, NE 68588-0115 USA
tseeicdwyer@computer.org