By Topic

Software Engineering, IEEE Transactions on

Issue 3 • Date May 1979

Filter Results

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

    Publication Year: 1979 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (401 KB)  
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1979 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (341 KB)  
    Freely Available from IEEE
  • Query Processing in Distributed Database System

    Publication Year: 1979 , Page(s): 177 - 187
    Cited by:  Papers (50)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3192 KB)  

    Query processing in a distributed system requires the transmission f data between computers in a network. The arrangement of data transmissions and local data processing is known as a distribution strategy for a query. Two cost measures, response time and total time are used to judge the quality of a distribution strategy. Simple algorithms are presented that derive distribution strategies which have minimal response time and minimal total time, for a special class of queries. These optimal algorithms are used as a basis to develop a general query processing algorithm. Distributed query examples are presented and the complexity of the general algorithm is analyzed. The integration of a query processing subsystem into a distributed database management system is discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrency Control and Consistency of Multiple Copies of Data in Distributed Ingres

    Publication Year: 1979 , Page(s): 188 - 194
    Cited by:  Papers (94)  |  Patents (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2784 KB)  

    This paper contains algorithms for ensuring the consistency of a distributed relational data base subject to multiple, concurrent updates. Also included are mechanisms to correctly update multiple copies of objects and to continue operation when less than all machines in the network are operational. Together with [4] and [12], this paper constitutes the significant portions of the design for a distributed data base version of INGRES. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Locking and Deadlock Detection in Distributed Data Bases

    Publication Year: 1979 , Page(s): 195 - 202
    Cited by:  Papers (50)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1760 KB)  

    This paper descrbes two protocols for the detection of deadlocks in distributed data bases–a hierarchically organized one and a distributed one. A graph model which depicts the state of execution of all transactions in the system is used by both protocols. A cycle in this graph is a necessary and sufficient condition for a deadlock to exist. Nevertheless, neither protocol requires that the global graph be built and maintained in order for deadlocks to be detected. In the case of the hierarchical protocol, the communications cost can be optimized if the topology of the hierarachy is appropriately chosen. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal Aspects of Serializability in Database Concurrency Control

    Publication Year: 1979 , Page(s): 203 - 216
    Cited by:  Papers (21)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3864 KB)  

    An arbitrary interleaved execution of transactions in a database system can lead to an inconsistent database state. A number of synchronization mechanisms have been proposed to prevent such spurious behavior. To gain insight into these mechanisms, we analyze them in a simple centralized system that permits one read operation and one write operation per transaction. We show why locking mechanisms lead to correct operation, we show that two proposed mechanisms for distributed environments are special cases of locking, and we present a new version of lockdng that alows more concurrency than past methods. We also examine conflict graph analysis, the method used in the SDD-1 distributed database system, we prove its correctness, and we show that it can be used to substantially improve the performance of almost any synchronization mechanisn. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing the Call Graph of a Program

    Publication Year: 1979 , Page(s): 216 - 226
    Cited by:  Papers (25)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4240 KB)  

    The proliferation of large software systems written in high level programming languages insures the utility of analysis programs which examine interprocedural communications. Often these analysis programs need to reduce the dynamic relations between procedures to a static data representation. This paper presents one such representation, a directed, acyclic graph named the call graph of a program. We delineate the programs representable by an acyclic call graph and present an algorithm for constructing it using the property that its nodes may be linearly ordered. We prove the correctness of the algorithm and discuss the results obtained from an implementation of the algorithm in the PFORT Verifier [1]. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection of Data Flow Anomaly Through Program Instrumentation

    Publication Year: 1979 , Page(s): 226 - 236
    Cited by:  Papers (21)  |  Patents (15)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4120 KB)  

    A data flow anomaly in a program iB an indication that a programming error might have been committed. This paper descibes a method for detecting such an anomiay by means of program instrumentation. The method is conceptually simple, easy to use, easy toimplement on a computer, and can be applied in conjunction with a conventional program test to achieve increased error-detection capability. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Method for Analyzing Loop Programs

    Publication Year: 1979 , Page(s): 237 - 247
    Cited by:  Papers (24)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3536 KB)  

    This paper presents a method for automatically analyzing loops, and discusses why it is a useful way to look at loops. The method is based on the idea that there are four basic ways in which the logical structure of a loop is built up. An experiment is presented which shows that this accounts for the structure of a large class of loops. The paper discusses how the method can be used to automatically analyze the structure of a loop, and how the resulting analysis can be used to guide a proof of correctness for the loop. An automatic system is described which performs this type of analysis. The paper discusses the relationship between the structure building methods presented and programming language constructs. A system is described which is designed to assist a person who is writing a program. The intent is that the system will cooperate with a programmer throughout aUl phases of work on a program and be able to communicate with the programmer about it. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Design of a Language for Programming Real-Time Concurrent Processes

    Publication Year: 1979 , Page(s): 248 - 255
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2992 KB)  

    ILIAD is a high-evel language for programming real-time applications which involve concurrent processing. It was designed to help scientists and engineers write reliable programs that can be read and maintained. An ILIAD program consists of a group of concurrent tasks. The tasks are autonomous and must cooperate in using the shared memory and devices in the execution environment. The language has facilities for providing secure access to these resources and for creating and synchronizing parallel instruction streams. In providing an overview of the language, the factors motivating the major design choices are discussed. A programming example illustrates how ILIAD might be applied. An assessment of the language includes a discussion of potential problem areas, both technical and nontechnical. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clusters and Dialogues for Set Implementations

    Publication Year: 1979 , Page(s): 256 - 275
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3976 KB)  

    The extensible set language (ESL) uses clusters for extending the set oriented language and for mapping the sets and their operators into base language data structure and operators. The main difficulty in this mapping is the dependency among clusters, i.e., the use of one data structure requires the modification or the constraint of another. The dialogue is a compile time procedure which is part of a cluster. It manipulates data structures and enables each cluster to appear independent; it also enables the user to choose one of a family of data implementations defmed by the cluster. Thus the dialogue makes it possible for a data structure to appear as a building block which can be used simply and flexibly. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Experiment in Software Error Data Collection and Analysis

    Publication Year: 1979 , Page(s): 276 - 286
    Cited by:  Papers (30)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2592 KB)  

    The propensity to make programming errors and the rates of error detection and correction are dependent on program complexity. Knowledge of these relationships can be used to avoid errorprone structures in software design and to devise a testing strategy which is based on anticipated difficulty of error detection and correction. An experiment in software error data collection and analysis was conducted in order to study these relationships under conditions where the error data could be carefully defined and collected. Several complexity measures which can be defined in terms of the directed graph representation of a program, such as cyclomatic number, were analyzed with respect to the following error characteristics: errors found, time between error detections, and error correction time. Signifiant relationships were found between complexity measures and error charateristics. The meaning of directed grph structural properties in terms of the complexity of the programming and testing tasks was examined. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Queuing Networks with Random Selection for Service

    Publication Year: 1979 , Page(s): 287 - 289
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (632 KB)  

    To the class of queuing networks analyzable by the method of Baskett, Chandy, Muntz, and Palacios, we add service centers whose scheduling is random. That is, upon completion of a service interval, the server chooses next to serve one of the waiting customers selected at random. As in the case of first-come first-served (FCFS) scheduling, all tasks must have the same exponentially distributed service time at such a center. We show that for purposes of this analysis, the results are identical to FCFS queuing. Example applications for random selection scheduling in computer system modeling are provided. View full abstract»

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

    Publication Year: 1979 , Page(s): 289
    Save to Project icon | Request Permissions | PDF file iconPDF (1222 KB)  
    Freely Available from IEEE
  • if your computer engineering library doesn't subscribe to all 4 it's not complete.

    Publication Year: 1979 , Page(s): 289
    Save to Project icon | Request Permissions | PDF file iconPDF (1169 KB)  
    Freely Available from IEEE
  • Information about the Society

    Publication Year: 1979 , Page(s): 289-c
    Save to Project icon | Request Permissions | PDF file iconPDF (128 KB)  
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1979 , Page(s): 289-d
    Save to Project icon | Request Permissions | PDF file iconPDF (176 KB)  
    Freely Available from IEEE
  • Announcing... The IEEE Computer Society's Tutorial Week79

    Publication Year: 1979 , Page(s): 289-e
    Save to Project icon | Request Permissions | PDF file iconPDF (1792 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
tseeicdwyer@computer.org