Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Software Engineering, IEEE Transactions on

Issue 2 • Date March 1977

Filter Results

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

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

    Publication Year: 1977 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (208 KB)  
    Freely Available from IEEE
  • Production Systems: A Notation for Defining Syntax and Translation

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

    This paper presents the formalism of Production Systems and investigates its applcation to defe the Syntax and trlation of programming languages. Several properties appear well-suited to this task: 1) the formalism can be used to specify exactly the syntax of a computer language, including context-sensitive requirements; 2) the specification of the context-sensitive requirements on syntax can be isolated from the context-free requirements; 3) the same formalism can be used to specify more general structural properties, including the translation of one language into another. The notation has been developed with readabifity as a prime designissue. The following examples are given:1) aspecificationofthesyntaxofasmallbutdifflcultsubset of PL/I;2) a specification of the rules for translating lambda-culus expressions into, normal form. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proving the Correctness of Multiprocess Programs

    Publication Year: 1977 , Page(s): 125 - 143
    Cited by:  Papers (71)  |  Patents (8)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (5520 KB)  

    The inductive assertion method is generalized to permit formal, machine-verifiable proofs of correctness for multiprocess programs. Individual processes are represented by ordinary flowcharts, and no special synchronization mechanisms are assumed, so the method can be applied to a large class of multiprocess programs. A correctness proof can be designed together with the program by a hierarchical process of stepwise refinement, making the method practical for larger programs. The resulting proofs tend to be natural formalizations of the informal proofs that are now used. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A General, Verifiable Iterative Control Structure

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

    A general iterative control structure with multiple exits and multiple retums to the beginning of the loop is described. The conditions causing these exits or returns must be declared and defined in a prologue to the loop in a manner which is similar to the declaration of variables at the beginning of a block. Also, actions prior to an exit or a return may be specified in an epilogue of the loop. The semantics of the structure are described informally and then formally by means of a Hoare type verification rule. Attributes of the structure and examples of its usage are given in the latter part of the paper. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Analysis of Swapping Policies in Virtual Storage Systems

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

    An important resource allocation mechanism in virtual storage operating systems is the maintainence of the multiprogramming level in main storage, especially when some form of working-set storage management strategy is employed. Swapping of programs in and out of main memory occurs when sufficient storage becomes available and when total storage demand exceeds capacity. In this paper, we propose a class of swapping algorithms that couples storage management parameters with swapping decisions. An analytic model is developed and numerical results are presented to compare the performance of these algorithms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experience with Modular Concurrent Programming

    Publication Year: 1977 , Page(s): 156 - 159
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3152 KB)  

    This paper summarizes the initial experience with the programming language Concurrent Pascal in the design of three model operating systems. A Concurrent Pascal program consists of modules called processes, monitors, and classes. The compiler checks that the data structures of each module are accessed only by the operations defined in the module. The author emphasizes that the creative aspect of program construction is the initial selection of modules and the connection of them into hierarchical structures. By comparison the detailed implementation of each module is straightforward. The most important result is that it is possible to build a concurrent program of one thousand lines out of one-page modules that can be comprehended at a glance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Guest Editorial Data Structures and Pattern Recognition

    Publication Year: 1977 , Page(s): 160 - 161
    Save to Project icon | Request Permissions | PDF file iconPDF (1576 KB)  
    Freely Available from IEEE
  • Interactive Pattern Recognition: A System and Data Structure

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

    In this paper a general-purpose interactive pattern recognition system is built using limited resources. The system utilizes Ribak's [5] relationship matrix (R-matrix) as a data structure and a PDP-9 minicomputer as hardware. The software developed for the interactive system along with the implemented idea of "vague" relations gives the human operator flexibility and aid in interactive file creation. Files created to describe complex patterns can be formed by merging simpler subfiles of different portions of that pattem. In addition to merging files (union operation), common elements between files can be detected using an intersection operation. User-defined routines are readily interfaced to the interactive system, thus increasing the system flexibility and giving the human operator a tailor-made effect. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ESP3: A Language for Pattern Description and a System for Pattern Recognition

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

    Extended Snobol picture pattern processor (ESP3) is a programming language and pattern recognition system which was designed for generating, recognizing, and manipulating two-dimensional line drawings. An ESP3 picture pattern describes a class of line drawings just as a Snobol pattern describes a class of strings. During pattern matching, a subject picture is searched for the occurrence of a sub-picture which matches a given picture pattern. The search of the subject picture is ordered left-to-right and top-to-bottom, and the search program uses scanner guidance information found in the picture pattern to limit the area of the subject picture to be searched. An experimental implementation of ESP3 has been developed to test the feasibility of the system. This paper describes the ESP3 picture patterns, the pattern matching operation, and the experimental implementation of ESP3. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information Retrieval Based on Touch-Tone® Encoded Alphanumeric Keys

    Publication Year: 1977 , Page(s): 184 - 189
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2408 KB)  

    Usage of the Touch-Tone telephone as a computer input device has increased dramatically during the past five years. The recent decrease in cost and increase in intelligibility of synthetic voice systems has made it possible to couple voice response systems with Touch-Tone telephones to create a low-cost, highly flexible computer terminal. However, usage is primarily restricted to applications that can be accomplished with a limited character set, do not need an extensive user protocol, consist of relatively short interactive sessions, and do not require immediate hard copy feedback. This paper discusses the first of these limitations: the unambiguous representation of 26 letters, 10 digits, and several special characters by the 12 keys of a Touch-Tone keyboard. Existing input schemes often require multiple keying to represent a single alphanumeric character or table look-up of numeric codes to represent a message. An alternative scheme would permit as-is encoding of alphabetic information. Using a specific application, as-is encoding is examined in detail, and the theory for recognition of encoded English phrases is generalized by two algorithms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image Access Protocol for Image Processing Software

    Publication Year: 1977 , Page(s): 190 - 192
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (880 KB)  

    During the past decade a number of multiimage picture processing software packages have been put together. However, only a few of the references to picture processing systems discuss image data structure or input/output routines. This correspondence is a first step in a direction toward getting a communication process started by suggesting some specifications for a multiimage data format and standard input/output interface routines to access the image data. 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: 1977 , Page(s): 192-a
    Save to Project icon | Request Permissions | PDF file iconPDF (144 KB)  
    Freely Available from IEEE
  • Call for Papers

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