By Topic

Software Engineering, IEEE Transactions on

Issue 3 • Date Sept. 1975

Filter Results

Displaying Results 1 - 12 of 12
  • Table of contents

    Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (770 KB)  
    Freely Available from IEEE
  • [Inside front cover]

    Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (73 KB)  
    Freely Available from IEEE
  • Editor's notice

    Page(s): 261
    Save to Project icon | Request Permissions | PDF file iconPDF (85 KB)  
    Freely Available from IEEE
  • A methodology for software engineering

    Page(s): 262 - 270
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (767 KB)  

    The paper presents a methodology for software engineering. This methodology recognizes the existence of two separate and distinctive phases (architecture and implementation) of a software engineering task. These two phases are interfaced by a formalized but descriptive design specification described by a language called ADL (architectural design language). This ADL description would serve a similar purpose as that served by the blueprint. Implementation can then be accomplished from the `software blueprint' in any of three possibilities: software, hardware, or microwave. Design of a lexical scanner is chosen as an example to illustrate this methodology. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Property extraction in well-founded property sets

    Page(s): 270 - 285
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1507 KB)  

    To carry out significant program optimization, it is necessary to know what properties hold at each program unit. Frequently the properties of interest form a partially ordered set with a minimum condition (i.e., well-founded). When this occurs, it is possible to directly compute the properties that can be attached to program units and, optionally, to expand the program text to obtain a strong assignment of properties. Techniques are presented for property computation in iterative and recursive programs. Application to a variety of property sets is discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Program graphs, an algebra, and their implication for programming

    Page(s): 286 - 291
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (520 KB)  

    Program graphs have been used as a vehicle to focus attention on the structure of a program. A systematic methodology for partitioning a program graph (digraph) to highlight the relationships between program elements is introduced along with an attendant notation. This notation is described in purely mathematical terms in the first section, and then the programming-related implications of this approach are addressed in the second section. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random insertion into a priority queue structure

    Page(s): 292 - 298
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (874 KB)  

    The average number of levels that a new element moves up when inserted into a heap is investigated. Two probabilistic models under which such an average might be computed are proposed. A `Lemma of Conservation of Ignorance' is formulated and used in the derivation of an exact formula for the average in one of these models. It is shown that this average is bounded by a constant and its asymptotic behaviour is discussed. Numerical data for the second model are also provided and analyzed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A computer network monitoring system

    Page(s): 299 - 311
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1001 KB)  

    In order to help satisfy an apparent need for tools for monitoring the activities of a computer network, a system of special hardware and software, called a Computer Network Monitoring System (CNMS) is being implemented in the University of Waterloo Computer Communications Networks Group (CCNG). The paper discusses the motivation and derivation of the CNMS, then provides functional descriptions of most of the major hardware and software components, illustrates use of the CNMS, and lists experiments and applications. The CNMS consists of: 1) a set of hybrid monitors, each of which is controlled by a locally or remotely located computer; 2) monitor control and data analysis software; 3) a network traffic generator; 4) measurement software in each computer monitored. Each computer to be monitored is attached to a monitor. Telephone lines, possibly different from those of the network, connect the monitors to the controlling computer. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A theory of software reliability and its application

    Page(s): 312 - 327
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (11028 KB)  

    The theory permits the estimation, in advance of a project, of the amount of testing in terms of execution time required to achieve a specified reliability goal [stated as a mean time to failure (MTTF)]. Execution time can then be related to calendar time, permitting a schedule to be developed. Estimates of execution time and calendar time remaining until the reliability goal is attained can be continually remade as testing proceeds, based only on the length of the execution time intervals between failures. The current MTTF and the number of errors remaining can also be estimated. Maximum likelihood estimation is employed, and confidence intervals are also established. The foregoing information is obviously very valuable in scheduling and monitoring the progress of program testing. A program has been implemented to compute the foregoing quantities. The reliability model that has been developed can be used in making system tradeoffs involving software or software and hardware components. It also provides a soundly based unit of measure for the comparative evaluation of various programming techniques that are expected to enhance reliability. The model has been applied to four medium-sized software development projects, all of which have completed their life cycles. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Introducing iteration into the Pure Lisp theorem prover

    Page(s): 328 - 338
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (943 KB)  

    It is shown how the Lisp iterative primitives PROG, SETQ, GO, and RETURN may be introduced into the Boyer-Moore method for automatically verifying Pure Lisp programs. This is done by extending some of the previously described heuristics for dealing with recursive functions. The resulting verification procedure uses structural induction to handle both recursion and iteration. The procedure does not actually distinguish between the two and they may be mixed arbitrarily. For example, since properties are stated in terms of user-defined functions, the theorem prover will prove recursively specified properties of iterative functions. Like its predecessor, the procedure does not require user-supplied inductive assertions for the iterative programs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strong verification of programs

    Page(s): 339 - 346
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (639 KB)  

    The authors investigate the strong verification of programs using the concept of predicate transformer introduced by Dijkstra (1974). They show that every do-while program has a loop invariant that is both necessary and sufficient proving strong verification. This loop invariant is shown to be the least fixpoint of a recursive function mapping predicates to predicates that is defined by the program and the postcondition. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • [Back matter]

    Page(s): 1 - 4
    Save to Project icon | Request Permissions | PDF file iconPDF (480 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