By Topic

IEEE Transactions on Software Engineering

Issue 4 • Date July 1979

Filter Results

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

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

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

    Publication Year: 1979, Page(s): 293
    Request permission for commercial reuse | PDF file iconPDF (880 KB)
    Freely Available from IEEE
  • Synthesis: Dreams → Programs

    Publication Year: 1979, Page(s):294 - 328
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (7288 KB)

    Deductive techniques are presented for deriving programs systematically from given specifications. The specifications express the purpose of the desired program without giving any hint of the algorithm to be employed. The basic approach is to transform the specifications repeatedly according to certain rules, until a satisfactory program is produced. The rules are guided by a number of strategic c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Decision Model for Closed Queuing Networks

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

    This paper considers a computer configuration design problem. The computer system is modeled by a closed queuing network. The system throughput is the objective function to be maximized and the speed of the devices are the decision variables. A rich class of non-linear cost functions is considered. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multidimensional Binary Search Trees in Database Applications

    Publication Year: 1979, Page(s):333 - 340
    Cited by:  Papers (161)  |  Patents (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2696 KB)

    The multidimensional binary search tree (abbreviated k-d tree) is a data structure for storing multikey records. This structure has been used to solve a number of "geometric" problems in statistics and data analysis. The purposes of this paper are to cast k-d trees in a database framework, to collect the results on k-d trees that have appeared since the structure was introduced, and to show how th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dual Processor Scheduling with Dynamic Reassignment

    Publication Year: 1979, Page(s):341 - 349
    Cited by:  Papers (74)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2592 KB)

    The problem of finding an optimal dynamic assignment of a modular program for a two-processor system is analyzed. Stone's formulation of the static assignment problem is extended to include the cost of dynamically reassigning a module from one processor to the other and the cost of module residence without execution. By relocating modules during the course of program execution, changes in the loca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Database Access Control in the Presence of Context Dependent Protection Requirements

    Publication Year: 1979, Page(s):349 - 358
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3272 KB)

    Data items in a database are semantically related. Thus, the access control mechanism of a database system must be concerned with the possibility that access to one item may violate a denied access to another item. This study concentrates on two basic semantic relations for protection requirements. By utilizing a graph-theoretic approach, some of the fundamental properties of the protection relati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Legality Assertions in Euclid

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

    The design of the programming language Euclid requires that a compiler for the language produce legality assertions to aid in verification of programs written in the language. This paper analyzes the legality assertions that must be produced and discusses the impact that this requirement has on the implementation of the language. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Strategy for Code Generation—the General-Purpose Optimizing Compiler

    Publication Year: 1979, Page(s):367 - 373
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3032 KB)

    This paper presents a systematic approach to the problem of generating good code with a compiler that is easy to construct. A compiler structure is proposed which relies on interprocedural data flow analysis, global optimization, and an intermediate language schema to simplify the task of writing the code generating portions of a compiler without sacrificing code quality. This structure is contras... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Convention for Explicit Declaration of Environments and Top-Down Refinement of Data

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

    Many problems of block structure derive from the remote specification of parts of the local environment. An alternative to block structure is proposed, in which the local environment is described within each program module. Concise environment descriptions are made possible by creating a tree whose terminal nodes are declarations and whose intermediate nodes can represent all of their descendant t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Designer/Verifier's Assistant

    Publication Year: 1979, Page(s):387 - 401
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3872 KB)

    Since developing and maintaining formally verified programs is an incremental activity, one is not only faced with the problem of constructing specifications, programs, and proofs, but also with the complex problem of determining what previous work remains valid following incremental changes. A system that reasons about changes must build a detailed model of each development and be able to apply i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symbolic Evaluation and the Analysis of Programs

    Publication Year: 1979, Page(s):402 - 417
    Cited by:  Papers (38)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4312 KB)

    Symbolic evaluation is a form of static program analysis in which symbolic expressions are used to denote the values of program variables and computations. It does not require the user to specify which path at a conditional branch to follow nor how many cycles of a loop to consider. Instead, a symbolic evaluator uses conditional expressions to represent the uncertainty that arises from branching a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A System for Performance Evaluation of Partial Differential Equations Software

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

    This paper describes a system to systematically compare the performance of various methods (software modules) for the numerical solution of partial differential equations. We discuss the general nature and large size of this performance evaluation problem and the data one obtains. The system meets certain design objectives that ensure a valid experiment: 1) precise definition of a particular measu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aladdin: Assembly Language Assertion Driven Debugging Interpreter

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

    ALADDIN is an interactive facility for debugging and testing of assembly language programs. ALADDIN differs from traditional debuggers by allowing the user to specify breakpoint assertions, rather than breakpoint locations. Assertions are logical relations among various components of the program state. If an assertion becomes false during execution of the object program a breakpoint is executed an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Computer Society Publications

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

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