Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

IEEE Transactions on Software Engineering

Issue 1 • Jan. 1982

Filter Results

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

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

    Publication Year: 1982, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (472 KB)
    Freely Available from IEEE
  • The Programmer's Apprentice: Knowledge Based Program Editing

    Publication Year: 1982, Page(s):1 - 12
    Cited by:  Papers (42)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3784 KB)

    An initial implementation of an interactive programming assistant system called the programmer's apprentice (PA) is described. The PA is designed to be midway between an improved programming methodology and an automatic programming system. The intention is that the programmer will do the hard parts of design and implementation while the PA will assist him wherever possible. One of the major underp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Direct Implementation of Algebraic Specification of Abstract Data Types

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

    Algebraic specification is now an established way of formally defining abstract data types. For its practical use, however, a segment of program which conforms with the specification has to be generated. Such program segments can be manually produced and must then be verified. Code generation can also be automated, as achieved by the "direct implementation" in [8] where any data type is treated as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Annotations to Make Recursion Equations Behave

    Publication Year: 1982, Page(s):21 - 33
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3696 KB)

    The use of annotated recursion equations as a programming technique is investigated by considering the "telegram problem." The annotations are used to select alternative strategies for evaluating the applicative expressions contained in the recursion equations, while the equations serve as an abstract specification of the desired results. This method has the advantage that the annotations explicit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Insertion of Software Probes in Well-Delimited Programs

    Publication Year: 1982, Page(s):34 - 42
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2792 KB)

    A standard technique for monitoring software testing activities is to instrument the module under test with counters or probes before testing begins; then, during testing, data generated by these probes can be used to identify portions of as yet unexercised code. In this paper the effect of the disciplined use of language features for explicitly delimiting control flow constructs is investigated w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal Program Verification Using Symbolic Execution

    Publication Year: 1982, Page(s):43 - 52
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2856 KB)

    Symbolic execution provides a mechanism for formally proving programs correct. A notation is introduced which allows a concise presentation of rules of inference based on symbolic execution. Using this notation, rules of inference are developed to handle a number of language features, including loops and procedures with multiple exits. An attribute grammar is used to formally describe symbolic exp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of a Hybrid Access Scheme for Buffered Users-Probabilistic Time Division

    Publication Year: 1982, Page(s):52 - 61
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4872 KB)

    A new multiple access scheme is proposed and evaluated. The proposed scheme combines desirable features of the ordinary time-division (TDMA) and the random access (RA) schemes. It is shown that by adjusting the value of a single parameter a, the proposed access method can vary continuously from one extreme (TDMA) to the other (RA). The average delay per packet and the throughput can be improved fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Analysis of Alternative Database Machine Architectures

    Publication Year: 1982, Page(s):61 - 75
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5512 KB)

    The rapid advances in the development of low-cost computer hardware have led to many proposals for the use of this hardware to improve the performance of database management systems. Usually the design proposals are quite vague about the performance of the system with respect to a given data management application. In this paper we predict the performance of several of the proposed database manage... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Routing Using a Virtual Waiting Time Technique

    Publication Year: 1982, Page(s):76 - 81
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2256 KB)

    The virtual waiting time technique is introduced as a solution to the problem of a controller distributing work to servers of different speeds. The servers are considered to be part of a distributed system without feedback. The virtual waiting time technique is shown to minimize the average completion time for a job distributed by the controller. The virtual waiting time technique does not depend ... View full abstract»

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

    Publication Year: 1982, Page(s): 82
    Request permission for commercial reuse | PDF file iconPDF (226 KB)
    Freely Available from IEEE
  • IEEE copyright form

    Publication Year: 1982, Page(s): 83
    Request permission for commercial reuse | PDF file iconPDF (263 KB)
    Freely Available from IEEE
  • Students in Computer Science and Engineering!

    Publication Year: 1982, Page(s): 83
    Request permission for commercial reuse | PDF file iconPDF (490 KB)
    Freely Available from IEEE
  • Call for Papers

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

    Publication Year: 1982, Page(s): 83-f
    Request permission for commercial reuse | PDF file iconPDF (240 KB)
    Freely Available from IEEE
  • Advance Announcement... Tutorial Week East 82

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