Scheduled Maintenance on March 25th, 2017:
Single article purchases and IEEE account management will be unavailable from 4:00 AM until 6:30 PM (ET). We apologize for the inconvenience.
By Topic

IEEE Transactions on Software Engineering

Issue 10 • Oct. 1987

Filter Results

Displaying Results 1 - 14 of 14
  • IEEE Transactions on Software Engineering - Table of contents

    Publication Year: 1987, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (360 KB)
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1987, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (272 KB)
    Freely Available from IEEE
  • An Infornation-Theoretic Analysis of Relational Databases—Part I: Data Dependencies and Information Metric

    Publication Year: 1987, Page(s):1049 - 1061
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2952 KB)

    Database design is based on the concept of data dependency, which is the interrelationship between data contained in various sets of attributes. In particular, functional, multivalued and acyclic join, dependencies play an essential role in the design of database schemas. The basic definition of an information metric and how this notion can be used in relational database are discussed in this pape... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Information-Theoretic Analysis of Relational Databases—Part II: Information Structures of Database Schemas

    Publication Year: 1987, Page(s):1062 - 1072
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1952 KB)

    The structural properties of acyclic database schemas, especially the interrelationships between acyclic join dependencies and multivalued dependencies, are examined in this paper. The intersection closure of a database schema is a semilattice, which is usually represented by Hasse diagram in algebra. The Hasse diagram of a schema is analogous to the Bachman diagram of a network model. Based on th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a General Concurrency Control Algorithm for Database Systems

    Publication Year: 1987, Page(s):1073 - 1079
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2704 KB)

    The concurrency control problem in database systems has been examined by many people and several concurrency control algorithms have been proposed. The most popular algorithms are two-phase locking and timestamp ordering. This paper shows that two-phase locking and timestamp ordering are special cases of a more general concurrency control algorithm. This general algorithm is described in detail an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interactive State-Space Analysis of Concurrent Systems

    Publication Year: 1987, Page(s):1080 - 1091
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3536 KB)

    The introduction of concurrency into programs has added to the complexity of the software design process. This is most evident in the design of communications protocols where concurrency is inherent to the behavior of the system. The complexity exhibited by such software systems makes more evident the need for computer-aided tools for automatically analyzing behavior. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Comprehensive Model for the Design of Distributed Computer Systems

    Publication Year: 1987, Page(s):1092 - 1104
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3448 KB)

    The availability of micro-, mini-, and supercomputers has complicated the laws governing the economies of scale in computers. A recent study by Ein-Dor [7] concludes that it is most effective to accomplish any task on the least powerful type of computer capable of performing it. This change in cost/performance, and the promise of increased reliability, modularity, and better response time has resu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance and Reliability Analysis Using Directed Acyclic Graphs

    Publication Year: 1987, Page(s):1105 - 1114
    Cited by:  Papers (66)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3512 KB)

    A graph-based modeling technique has been developed for the stochastic analysis of systems containing concurrency. The basis of the technique is the use of directed acyclic graphs. These graphs represent event-precedence networks where activities may occur serially, probabilistically, or concurrently. When a set of activities occurs concurrently, the condition for the set of activities to complete... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated Analysis of Discrete Communication Behavior

    Publication Year: 1987, Page(s):1115 - 1126
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3520 KB)

    An objective methodology for the specification and analysis of communicating processes is presented. It is based on an algebraic theory that is a formalization of a particular state machine model. The approach recognizes the fact that the complexity of system interactions is such that computer aid is not only appropriate but necessary for any practical design methodology. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Isomorphisms Between Petr Nets and Dataflow Graphs

    Publication Year: 1987, Page(s):1127 - 1134
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2608 KB)

    Dataflow graphs are a generalized model of computation. Uninterpreted dataflow graphs with nondeterminism resolved via probabilities are shown to be isomorphic to a class of Petri nets known as free choice nets. Petri net analysis methods are readily available in the literature and this result makes those methods accessible to dataflow research. Nevertheless, combinatorial explosion can render Pet... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Reliability of the IBM MVS/XA Operating System

    Publication Year: 1987, Page(s):1135 - 1139
    Cited by:  Papers (26)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1088 KB)

    This paper describes an analysis of system-detected errors on the MVS operating system under the eXtended Architecture (XA) for two IBM 3081 systems. The analysis classifies the errors in categories and examines the effectiveness of the recovery system of the MVS/XA. Comparison of the results for the two IBM 3081's confirm the dependence of the error distribution on the type of system utilization.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beyond The Basics: A Software Publication Series for Successful Computer Professionals From the IEEE Computer Society

    Publication Year: 1987, Page(s): 1139-a
    Request permission for commercial reuse | PDF file iconPDF (1272 KB)
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1987, Page(s): 1139-b
    Request permission for commercial reuse | PDF file iconPDF (320 KB)
    Freely Available from IEEE
  • The Computer Society

    Publication Year: 1987, Page(s): 1139-c
    Request permission for commercial reuse | PDF file iconPDF (216 KB)
    Freely Available from IEEE

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