By Topic

Software Engineering, IEEE Transactions on

Issue 4 • Date July 1977

Filter Results

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

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

    Publication Year: 1977 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (282 KB)  
    Freely Available from IEEE
  • Editor's Notice

    Publication Year: 1977 , Page(s): 265
    Save to Project icon | Request Permissions | PDF file iconPDF (976 KB)  
    Freely Available from IEEE
  • Symbolic Testing and the DISSECT Symbolic Evaluation System

    Publication Year: 1977 , Page(s): 266 - 278
    Cited by:  Papers (41)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4328 KB)  

    Symbolic testing and a symbolic evaluation system called DISSECT are described. The principle features of DISSECT are outlined. The results of two classes of experiments in the use of symbolic evaluadon are summarized. Several classes of program errors are defined and the reliability of symbolic testing in finding bugs is related to the classes of errors. The relationship of symbolic evaluation systems like DISSECT to classes of program errors and to other kinds of program testing and program analysis tools is also discussed. Desirable improvements in DISSECT, whose importance was revealed by the experiments, are mentioned. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing Programs with the Aid of a Compiler

    Publication Year: 1977 , Page(s): 279 - 290
    Cited by:  Papers (71)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4160 KB)  

    if finite input-output specifications are added to the syntax of programs, these specifications can be verified at compile time. Programs which carry adequate tests with them in this way should be resistant to maintenance errors. If the specifications are independent of program details they are easy to give, and unlikely to contain errors in common with the program. Furthermore, certain finite specifications are maximal in that they exercise the control and expression structure of a program as well as any tests can. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Selecting Capacities in Computer Communication Systems

    Publication Year: 1977 , Page(s): 290 - 295
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3592 KB)  

    This paper considers the selection of capacities, in two classes of open queueing network models of computer communication systems: 1) local-balanced queueing networks with multiple classes of customers and 2) the Reiser-Kobayashi diffusion approximation model. The problem of selecting optimal bandwidths for communication lines and switches and computing machinery is difficult due to 1) the economy of scale exhibited by components (i.e., the bandwidth per dollar increases with the total cost of the component) and 2) the discrete nature of computer/communication components (for instance it is possible to lease communication lines with 2400-Bd or 4800-Bd band-widths but not one with a 2401.3-Bd bandwidth). This paper develops aun algorithm to select servers taking both of these characteristics of server costs into account. The contribution of this paper is to discuss 1) the optimization of more general network models with 2) the consideration of more realistic tariffs and 3) more constraints on network behavior than were previously analyzed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Program Perspectives: A Relational Representation of Measurement Data

    Publication Year: 1977 , Page(s): 296 - 300
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2152 KB)  

    This paper concems the representation and processing of data resulting from the measurement of programs written in high-level programming languages. The value of various "perspectives" of measurement results, especially in languages having many levels of activity, is illustrated. A representation of measurement data based on ideas from relational data bases is presented, in which perspectives can be represented as hierarchically-organized permuted projections of measurement data. Applications described include measurement of Snobol4 and Fortran programs. View full abstract»

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

    Publication Year: 1977 , Page(s): 301 - 306
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2216 KB)  

    This paper deals with obtaining a data base for test and evaluation of large software systems, when at most, only a few typical pattern instances are available. Data structure variation is proposed and demonstrated for some simple images. Relationships to fundamental concepts in computer science methodology are discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Context of Problem-Solving Systems

    Publication Year: 1977 , Page(s): 306 - 309
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1904 KB)  

    Considerable effort has been expanded in attempts to combine the power found in algorithmic languages with the power found in program libraries. However, most of these attempts to construct problem-solving systems for a particular class of users have failed to achieve their objective of providing the user with the potential benefits inherent in such systems. This paper attempts to define and place problem-solving systems in a general context, and thereby shows when the potential for failure or success is high. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of the Average Access Time for a Digital Cassette Memory System

    Publication Year: 1977 , Page(s): 310 - 324
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3384 KB)  

    Access time is a variable quantity in serial access memory systems such as magnetic tape units. It is difficult to quote a value for it since a random search could cover most different tape lengths. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software Hut: A Computer Program Engineering Project in the Form of a Game

    Publication Year: 1977 , Page(s): 325 - 330
    Cited by:  Papers (12)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2640 KB)  

    The Software Hut (a small software house) is a course project designed for a graduate-level course in computer program engineering. This paper describes the Software Hut project and discusses the authors' experience using it in graduate courses at the University of Toronto. Suggestions for improvements in the project are given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • if your computer engineering library doesn't subscribe to all 3 it's not complete.

    Publication Year: 1977 , Page(s): 330
    Save to Project icon | Request Permissions | PDF file iconPDF (1258 KB)  
    Freely Available from IEEE
  • Announcing the IEEE Computer Society's Standing Subscription Plan [advertisement]

    Publication Year: 1977 , Page(s): 330
    Save to Project icon | Request Permissions | PDF file iconPDF (191 KB)  
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1977 , Page(s): 330-c
    Save to Project icon | Request Permissions | PDF file iconPDF (192 KB)  
    Freely Available from IEEE
  • Call for Papers

    Publication Year: 1977 , Page(s): 330
    Save to Project icon | Request Permissions | PDF file iconPDF (402 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