By Topic

IEEE Transactions on Software Engineering

Issue 6 • Nov. 1979

Filter Results

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

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

    Publication Year: 1979, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (303 KB)
    Freely Available from IEEE
  • Editor's Note

    Publication Year: 1979, Page(s): 541
    Request permission for commercial reuse | PDF file iconPDF (160 KB)
    Freely Available from IEEE
  • Communication and Synchronization in Distributed Systems

    Publication Year: 1979, Page(s):542 - 546
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1960 KB)

    Recent advances in technology have made the construction of general-purpose systems out of many small independent microprocessors feasible. One of the issue's concerning distributed systems is the question of appropriate language constructs for the handling of communication and synchronization. In his paper, "Communicating sequential processes," Hoare has suggested the use of the input and output ... View full abstract»

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

    Publication Year: 1979, Page(s):546 - 558
    Cited by:  Papers (61)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4576 KB)

    For programs to be reliable and fault tolerant, each program module must be defined to behave reasonably under a wide variety of circumstances. An exception handling mechanism supports the construction of such modules. This paper descnbes an exception handling mechanism developed as part of the CLU programming language. The CLU mechanism is based on a simple model of exception handling that leads ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proving Total Correctness of Parallel Programs

    Publication Year: 1979, Page(s):558 - 574
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4920 KB)

    An approach to proving paralel programs correct is presented. The steps are 1) model the paralel program, 2) prove partial correctness (proper synchronization), and 3) prove the absence of deadlock, livelock, and infinite loops. The parallel program model is based on KeUler's model. The main contributions of the paper are techniques for proving the absence of deadlock and livelock. A connection is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Review and Revocation of Access Privileges Distributed Through Capabilities

    Publication Year: 1979, Page(s):575 - 586
    Cited by:  Papers (18)  |  Patents (1)
    Request permission for commercial reuse | PDF file iconPDF (3720 KB)
    Freely Available from IEEE
  • Program Derivation Using Data Types: A Case Study

    Publication Year: 1979, Page(s):586 - 592
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3120 KB)

    The present paper discusses some issues in program synthesis by relating the idea of systematic program derivation with the concepts of data type and correctness of data representation. The notion of an incomplete definition of a data type at a high level of abstraction is introduced. The ideas are illustrated through an example previously discussed in the literature by D. Gries. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Case Study in Program Transformation: Translation into Polish

    Publication Year: 1979, Page(s):593 - 606
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1376 KB)

    Program transformation is used to show the correspondence between two known algorithms for translating parenthesized expressions into their polish counterparts. The first algorithm is a syntax-directed translator which produces output upon the recognition of predefined syntactic rules. The second one, suggested by Dijkstra, is of empirical nature: it performs the translation by simulating the oper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object Migration and Authentication

    Publication Year: 1979, Page(s):607 - 611
    Cited by:  Papers (6)  |  Patents (66)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2032 KB)

    When typed objects migrate in virtual memory, onto off-ine storage, or among the nodes of a network, the type managers must relinguish control over the object representation and state. In this paper we present a mechanism which allows a type manager to authenticate and reinstantiate migrated objects. This mechanism also solves some problems stemming from the hierarchical structure of the system it... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compile-Time Analysis of Data List-Format List Correspondences

    Publication Year: 1979, Page(s):612 - 617
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2080 KB)

    Formatted input-output is available in a number of programming languages. In the most general case, the correspondence between data items and format items cannot be determined during compilation, and so it is determined dynamically during execution. However, in most pairs of data and format lists that occur in practice, determination of the correspondence is in fact possible during compilation. Al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Methods for the Measurement of Memory Utilization and the Improvement of Program Locality

    Publication Year: 1979, Page(s):618 - 631
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3024 KB)

    It is known that the locality of reference of a program can be improved by restructuring it. One approach for program restructuring is to rearrange the order of relocatable program sectors and to repackage those sectors of a program, that are needed within a relatively short time of one another, into the same virtual page. This approach needs no reprogramming of the source program. However, micros... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Throughput Capacity of a Sequence of Queues with Blocking Due to Finite Waiting Room

    Publication Year: 1979, Page(s):631 - 642
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3480 KB)

    A tandem queueing system with blocking due to finite waiting room is considered. Maximum throughput is studied by an approximation for several cases. The service time can depend on the number of customers; intermediate arrivals can also be allowed. Some special models with two stations in sequence and blocking are examined. These models are used for the performance evaluation of computer systems. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structuring Programs for Efficient Operation in Virtual Memory Systems

    Publication Year: 1979, Page(s):643 - 652
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2888 KB)

    Procedures are presented for reducing page faults by program restructuring and utilization of bin packing techniques. A Markov model is presented and used as a basis for the methods presented. Parameter estimation of appropriate software statistics for the model is given. The techniques described are applicable to completed programs as weli as those under development. Experimental results are incl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of Closed Queuing Networks with Periodic Servers

    Publication Year: 1979, Page(s):653 - 659
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1952 KB)

    A periodic network is a queuing network whose steady-state behavior is not constant in time, but repeats itself in a cycle. This behavior may be caused by the introduction of periodic servers, e.g., paging drums. The model presented is a generalization of some other models of queuing networks, and provides a more general definition of steady-state behavior. A theoretical solution is presented. Exa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 1979 Index IEEE Transactions on Software Engineering Vol. SE-5

    Publication Year: 1979, Page(s): 659
    Request permission for commercial reuse | PDF file iconPDF (1289 KB)
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1979, Page(s): 659-f
    Request permission for commercial reuse | PDF file iconPDF (216 KB)
    Freely Available from IEEE
  • Call for Papers

    Publication Year: 1979, Page(s): 659
    Request permission for commercial reuse | PDF file iconPDF (1246 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