By Topic

IEEE Transactions on Software Engineering

Issue 1 • Jan 1988

Filter Results

Displaying Results 1 - 11 of 11
  • A group-select operation for relational algebra and implications for database machine design

    Publication Year: 1988, Page(s):126 - 129
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    A group-select operation has been defined for relational algebra. This operation is found to be useful for efficiently reducing expressions of nonprocedural relational languages that permit natural quantifiers. Conceptually, the operation first partitions a relation into blocks of tuples that have the same value for an attribute or attribute concatenation. It then extracts each block for which a s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clarification of two phase locking in concurrent transaction processing

    Publication Year: 1988, Page(s):122 - 125
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    The authors propose a formal definition of the two-phase locking class derived from the semantic description of the two-phase locking protocol, and prove that this definition is equivalent to that given by C.H. Papadimitriou (1979). They present: (1) a precise definition of the two phase locking; (2) a clarification of the occurrence and the order of all events such as lock points, unlock points, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Function point analysis: difficulties and improvements

    Publication Year: 1988, Page(s):2 - 11
    Cited by:  Papers (149)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (860 KB)

    The method of function point analysis was developed by A. J. Albrecht (1979) to help measure the size of a computerized business information system. Such sizes are needed as a component of the measurement of productivity in system development and maintenance activities, and as a component of estimating the effort needed for such activities. Close examination of the method shows certain weaknesses,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rajdoot: a remote procedure call mechanism supporting orphan detection and killing

    Publication Year: 1988, Page(s):30 - 37
    Cited by:  Papers (20)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    Rajdoot is a remote procedure call (RPC) mechanism with a number of fault tolerance capabilities. A discussion is presented of the reliability-related issues and how these issues have been dealt with in the RPC design. Rajdoot supports exactly-once semantics with call nesting capability, and incorporates effective measures for orphan detection and killing. Performance figures show that the reliabi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simulation study of two distributed task allocation procedures

    Publication Year: 1988, Page(s):54 - 61
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    The authors concentrate on the simulation study of two distributed task allocation procedures: the load balancing and the LOCO procedure. The first is widely used in general-purpose processing. The second was recently introduced and analyzed in the processing environment corresponding to the complex multitask jobs typical of some supercomputing and artificial-intelligence-oriented systems. Both pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mathemtical model of composite objects and its application for organizing engineering databases

    Publication Year: 1988, Page(s):71 - 84
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1300 KB)

    The authors introduce a clustering concept called component aggregation which considers assemblies having the same types of parts as equivalent objects. The notion of equivalent objects is used to develop a mathematical model of composite objects. It is shown that the set of equivalence classes of objects form a Boolean algebra whose minterms represent the objects that are not considered composite... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Executable logic specifications for protocol service interfaces

    Publication Year: 1988, Page(s):98 - 112
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1492 KB)

    A general, formal modeling technique for protocol service interfaces is discussed. An executable description of the model using a logic-programming-based language, Prolog, is presented. The specification of protocol layers consists of two parts, the specification of the protocol interfaces and the specification of entities within the protocol layer. The specification of protocol interfaces forms t... View full abstract»

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

    Publication Year: 1988, Page(s):12 - 29
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1324 KB)

    A constructive method of program development is presented. It is based on a simple strategy for problem decomposition that is claimed to be more supportive of goal-oriented programming than the Wirth-Dijkstra top-down refinement method. With the proposed method, a program is developed by making a sequence of refinements, each of which can establish the postcondition for a corresponding sequence of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • User-process communication performance in networks of computers

    Publication Year: 1988, Page(s):38 - 53
    Cited by:  Papers (43)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1460 KB)

    The authors present a study of the performance achieved by user processes when using the IPC mechanisms as implemented in Berkeley Unix 4.2BSD in Ethernet based environments. The authors assess not only the impact that different processors, network hardware interfaces, and Ethernets have on the communication across machines, but also the effect of the loading of the hosts and communication media t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the exact and approximate throughput analysis of closed queuing networks with blocking

    Publication Year: 1988, Page(s):62 - 70
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    A type of blocking is investigated in which, on completion of its service, a job attempts to enter a new station. If, at that moment, the destination station is full, the job is forced to reside in the server of the source station until a place becomes available in the destination station. The server of the source station remains blocked during this period of time. This model is known as a queuing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fragtypes: a basis for programming environments

    Publication Year: 1988, Page(s):85 - 97
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1092 KB)

    The author introduces a novel basis for programming environments that encourages development of software in fragments of various types, called fragtypes. Fragtypes range from a simple expression type to a complete subsystem type. As a result, they are suited to the development of software in an enlarged scope that includes both programming in the small and programming in the large. The author show... 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
tse-eic@computer.org