By Topic

IEEE Transactions on Software Engineering

Issue 4 • Date July 1982

Filter Results

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

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

    Publication Year: 1982, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (288 KB)
    Freely Available from IEEE
  • Editorial

    Publication Year: 1982, Page(s): 297
    Request permission for commercial reuse | PDF file iconPDF (1080 KB)
    Freely Available from IEEE
  • An Extension of Norton's Theorem for Queueing Networks

    Publication Year: 1982, Page(s):298 - 305
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2104 KB)

    Given a closed BCMP queueing network, the problem is considered of studying the behavior of any subsystem a without solving for the entire system. This paper proves that this is possible for a consisting of any number of queues, arbitrarily interfacing the rest of the system, thus generalizing the classic CHW theorem, also known as Norton's theorem. A general flow-equivalent solution procedure is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Good System Structure Features: Their Complexity and Execution Time Cost

    Publication Year: 1982, Page(s):306 - 318
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4240 KB)

    This paper describes a multistep technique that can be applied to improve system structure and to improve performance when necessary. The technique begins with the analysis of system structure via the structured design guidelines of coupling and cohesion. Next, manual system structure improvement transformations are applied. The effect of the transformations on execution time is then determined. F... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Measures for Evaluating Algorithms for SIMD Machines

    Publication Year: 1982, Page(s):319 - 331
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5248 KB)

    This paper examines measures for evaluating the performance of algorithms for single instruction stream–multiple data stream (SIMD) machines. The SIMD mode of parallelism involves using a large number of processors synchronized together. All processors execute the same instruction at the same time; however, each processor operates on a different data item. The complexity of parallel algorith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Adjustment of an APL Interpreter

    Publication Year: 1982, Page(s):331 - 343
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4352 KB)

    An APL interpreter is analyzed to examine how microprogramming can improve its performance. Also examined is how the modularization method or program structure affects performance improvement. Two basic modularization methods, function and data modularizations, are investigated. We rind that the performance gain may reach 100-time speed-up and that a proper selection of modules is very important t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Automatic Generator for Compiler Testing

    Publication Year: 1982, Page(s):343 - 353
    Cited by:  Papers (37)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4512 KB)

    A new method for testing compilers is presented. The compiler is exercized by compilable programs, automatically generated by a test generator. The generator is driven by a tabular description of the source language. This description is in a formalism which nicely extends context-free grammars in a context-dependent direction, but still retains the structure and readability of BNF. The generator p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software Reliability—Status and Perspectives

    Publication Year: 1982, Page(s):354 - 371
    Cited by:  Papers (98)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4808 KB)

    It is essential to assess the reliability of digital computer systems used for critical real-time control applications (e.g., nuclear power plant safety control systems). This involves the assessment of the design correctness of the combined hardware/software system as well as the reliability of the hardware. In this paper we survey methods of determining the design correctness of systems as appli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weak Mutation Testing and Completeness of Test Sets

    Publication Year: 1982, Page(s):371 - 379
    Cited by:  Papers (174)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4696 KB)

    Different approaches to the generation of test data are described. Error-based approaches depend on the definition of classes of commonly occurring program errors. They generate tests which are specifically designed to determine if particular classes of errors occur in a program. An error-based method called weak mutation testing is described. In this method, tests are constructed which are guaran... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Close Look at Domain Testing

    Publication Year: 1982, Page(s):380 - 390
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (10632 KB)

    White and Cohen have proposed the domain testing method, which attempts to uncover errors in a path domain by selecting test data on and near the boundary of the path domain. The goal of domain testing is to demonstrate that the boundary is correct within an acceptable error bound. Domain testing is intuitively appealing in that it provides a method for satisfying the often suggested guideline tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Echo Algorithms: Depth Parallel Operations on General Graphs

    Publication Year: 1982, Page(s):391 - 401
    Cited by:  Papers (101)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3816 KB)

    This paper describes a method for the detection of properties of general graphs in an environment in which each node can be considered an autonomous processor, interacting with its neighbors by passing messages. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load Balancing in Distributed Systems

    Publication Year: 1982, Page(s):401 - 412
    Cited by:  Papers (100)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4312 KB)

    In a distributed computing system made up of different types of processors each processor in the system may have different performance and reliability characteristics. In order to take advantage of this diversity of processing power, a modular distributed program should have its modules assigned in such a way that the applicable system performance index, such as execution time or cost, is optimize... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computer Program Schemata and the Processes They Generate

    Publication Year: 1982, Page(s):412 - 419
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3592 KB)

    This paper develops definitions for a program schema, the execution of such a program schema, and a process generated by a program schema. Results due to Hartfiel are used to characterize the cone of stochastic eigenvectors of the class of homogeneous Markov processes generated by a program schema. The stochastic behavior vector of a process generated by the same schema is shown to lie in this con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of Synchronized Iterative Processes in Multiprocessor Systems

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

    A general methodology for studying the degree of matching between an architecture and an algorithm is introduced and applied to the case of synchronized iterative algorithms in MIMD machines. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Combined Problem of Compaction and Sorting

    Publication Year: 1982, Page(s):432 - 435
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    Under certain assumptions, a garbage collection algorithm which compacts the dynamic storage area also involves sorting a set of pointers, whose order usually has only been partially disturbed since the last garbage coliection. Using this structure and combining the sorting and compaction, we can achieve a rather important reduction of the time to perform a garbage collection. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Interpretation of Meta Grammars Describing Syntax-Directed Interpreters Using an Attribute Grammar Interpreter

    Publication Year: 1982, Page(s):435 - 436
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    A syntax-directed interpreter of attribute grammars is applied to interpret meta grammars describing translators. A specific example is used which concerns the formal description of the same syntax-directed interpreter of attribute grammars for illustration of our approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Number of Faults per Line of Code

    Publication Year: 1982, Page(s):437 - 439
    Cited by:  Papers (58)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    In this note, the number of faults or "bugs" per line of code is estimated based upon Halstead's software science relationships. This number is shown to be an increasing function of the number of lines of code in a program, a result in agreement with intuition and some current theories of complexity. The form of this function is investigated and an easy-to-use approximation is developed. An applic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proving Consistency of Database Transactions Written in Extended Pascal

    Publication Year: 1982, Page(s):440 - 446
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1360 KB)

    The purpose of this correspondence is to present an approach for verifying that explicitly stated integrity constraints are not violated by certain transactions. We utilize a relational model wherein constraints are given in a language based on the first-order predicate calculus. Transactions are written in terms of a Pascal-like host language with embedded first-order predicate calculus capabilit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to "Information Flow Certification Using an Intermediate Code Program Representation"

    Publication Year: 1982, Page(s): 446
    Request permission for commercial reuse | PDF file iconPDF (94 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 6th International Conference on Software Engineering

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

    Publication Year: 1982, Page(s): 446-c
    Request permission for commercial reuse | PDF file iconPDF (208 KB)
    Freely Available from IEEE
  • The Second Software Engineering Standards Applications Workshop Call for Papers

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