By Topic

IEEE Transactions on Software Engineering

Issue 5 • Date Sept. 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 (416 KB)
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1979, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (297 KB)
    Freely Available from IEEE
  • Development and Structure of an X.25 Implementation

    Publication Year: 1979, Page(s):429 - 439
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2685 KB)

    This paper describes experience with an implementation of the X25 communication protocols for accessing public data networks. Ihe implementation effort is characterized by: 1) the development of a formalized protocol specification on which all further implementation work is based, and 2) the use of Concurrent Pascal as the implementation language. The main features of the formalized protocol speci... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Simulation: A Case Study in Design and Verification of Distributed Programs

    Publication Year: 1979, Page(s):440 - 452
    Cited by:  Papers (277)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3896 KB)

    The problem of system simulation is typically solved in a sequential manner due to the wide and intensive sharing of variables by all parts of the system. We propose a distributed solution where processes communicate only through messages with their neighbors; there are no shared variables and there is no central process for message routing or process scheduling. Deadlock is avoided in this system... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Exercise in Automatic Program Verification

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

    This paper describes in some detail the computer-aided proof of a permutation program obtained using the Stanford Pascal verifier. We emphasize the systematic way in which a proof can be developed from an intuitive understanding of the program. The paper fillustrates the current state of the art in automatic program verification. View full abstract»

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

    Publication Year: 1979, Page(s):458 - 464
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3288 KB)

    Protection in capability-based operating systems is comsidered. The concept of a conditional capability, which is a generalization of a conventional capability, is proposed. The conditional capability can only be exercised when certain conditions relating to the context of its use are satisfied. It is shown that such capabilities form a basis upon which features such as domains of protection, revo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deadlock Detection and Avoidance for Shared Logical Resources

    Publication Year: 1979, Page(s):465 - 471
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2552 KB)

    Logical resources are defined as shared passive entities that can be concurrently accessed by multiple processes. Concurrency restrictions depend upon the mode or manner in which a process may manipulate a resource. Models incorporating these single unit resources can be used to analyze information locking for consistency and integrity purposes. Mode compatibility is defined and used to derive dea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluating and Improving Recursive Descent Parsers

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

    Time formulas are symbolic formulas which express the execution time of a program as a function of its input data and of variables representing the time to execute individual operations (e.g., push, pop, transfer, etc.). It is shown that in many cases the time formulas for recursive descent parsers may be generated automatically by a simple inspection of the parser code. These time formulas are in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CSDL: A Conceptual Schema Definition Language for the Design of Data Base Applications

    Publication Year: 1979, Page(s):481 - 496
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3408 KB)

    A language to support the incremental design of the conceptual schemata of data bases is presented. Abstractions are expressed in terms of high-evel constructs and operations on these abstractions allow the definition of other abstractions. Both abstractions and operations on them are totally independent from the underlying internal representation of the schema, which is created consistently by ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Software Science with Applications

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

    Two disciplines have been developed during the past few years for the study of computer software. Software physics has as its purpose the analysis of execution characteristics of programs. Basic measures of software work, time, and shortage occupancy are used to derive measures such as power, capacity usage, and storage work, with applications to the choice of processor and device speeds. Software... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantitative Estimates of Debugging Requirements

    Publication Year: 1979, Page(s):504 - 514
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3768 KB)

    A major portion of the problems associated with software development might be blamed on the lack of appropriate tools to aid in the planning and testing phases of software projects. As one step towards solving this problem, this paper presents a model to estimate the number of bugs remaining in a system at the beginning of the testing and integration phases of development. The model, based on soft... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tidy Drawings of Trees

    Publication Year: 1979, Page(s):514 - 520
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3064 KB)

    Trees are extremely common data structures, both as internal objects and as models for program output. But it is unusual to see a program actually draw trees for visual inspection. Although part of the difficulty lies in programming graphics devices, most of the problem arises because naive algorithms to draw trees use too much drawing space and sophisticated algorithms are not obvious. We survey ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Path Cover Problems in Digraphs and Applications to Program Testing

    Publication Year: 1979, Page(s):520 - 529
    Cited by:  Papers (21)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3984 KB)

    In this paper various path cover problems, arising in program testing, are discussed. Dilworth's theorem for acyclic digraphs is generalized. Two methods for fmding a minimum set of paths (minimum path cover) that covers the vertices (or the edges) of a digraph are given. To model interactions among code segments, the notions of required pairs and required paths are introduced. It is shown that rm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Approximate Analytical Method for General Queueing Networks

    Publication Year: 1979, Page(s):530 - 538
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1768 KB)

    In this paper, we present an approximate solution for the asymptotic behavior of relatively general queueing networks. In the particular case of networks with general service time distributions (i.e., fixed routing matrix, one or many servers per station, FIFO discipline), the application of the method gives relatively accurate results in a very short time. The approximate stationary state probabi... View full abstract»

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

    Publication Year: 1979, Page(s): 538
    Request permission for commercial reuse | PDF file iconPDF (712 KB)
    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): 538
    Request permission for commercial reuse | PDF file iconPDF (263 KB)
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1979, Page(s): 538-c
    Request permission for commercial reuse | PDF file iconPDF (224 KB)
    Freely Available from IEEE
  • Announcing... The IEEE Computer Society's Tutorial Week79

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