Scheduled System Maintenance
On Tuesday, August 23, IEEE Xplore will undergo scheduled maintenance from 12:00-7:00 PM ET (16:00-23:00 UTC).
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

IEEE Transactions on Software Engineering

Issue 1 • Date Jan. 1983

Filter Results

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

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

    Publication Year: 1983, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (312 KB)
    Freely Available from IEEE
  • An Object-Oriented Command Language

    Publication Year: 1983, Page(s):1 - 8
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3104 KB)

    This paper describes Cola, an object-oriented command language for Hydra; Hydra is a capability-based operating system that runs on C.mmp, a tightly coupled multiprocessor. The two primary aspects of Cola, that it is a command language for Hydra, and that it is based on the object paradigm, are examined. Cola was designed to effect a correspondence between capabilities in Hydra and objects that ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Symbol Table Abstraction to Implement Languages with Explicit Scope Control

    Publication Year: 1983, Page(s):8 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3552 KB)

    We are concerned with languages in which the programmer has explicit control over the referencing environment of a name. Several modern programming languages, including Ada, Euclid, Mesa, and Modula, implement these control capabilities. This paper describes a simple technique which uses the traditional concepts of a hashed symbol table and lexical level to solve many of the symbol table implemen-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulation of Procedure Variables Using Ada Tasks

    Publication Year: 1983, Page(s):13 - 15
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1616 KB)

    We give a technique for partially simulating procedure variables using Ada tasks. The simulation involves using interface tasks, a technique which may be useful for other problems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Language Features for Access Control

    Publication Year: 1983, Page(s):16 - 25
    Cited by:  Papers (2)  |  Patents (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4760 KB)

    The properties of a capability-based protection mechanism to be incorporated in a language for concurrent programming are presented. The protection mechanism is first abstractly characterized in terms of a protection model; the components of the protection mechanism, that is, the objects, subjects, and protection rules which govern the accessing to the objects by the subjects, are defined. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Practical Method for Reducing Weak Precedence Parsers

    Publication Year: 1983, Page(s):25 - 30
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3536 KB)

    This paper presents a practical method for constructing a more compact matrix structure of the precedence information used in a new weak precedence parsing. The parsing algorithm differs from the conventional weak precedence algorithm in that the precedence relation .> signals a sequence of reduce actions, not just one. The method can be used for any weak precedence grammars without degrading t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Programming Language Constructs for Screen Definition

    Publication Year: 1983, Page(s):31 - 39
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2872 KB)

    This paper describes a screen-oriented I/O facility, designed as a part of Rigel, a high-level database programming language. The novel features of the I/O facility, called Screen Rigel, include the use of formatting techniques to lay out text and data on the screen. Applications written in Screen Rigel can directly access the database using the database constructs already in Rigel. In addition, S... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Generalized Query-by-Example Data Manipulation Language Based on Database Logic

    Publication Year: 1983, Page(s):40 - 57
    Cited by:  Papers (3)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3928 KB)

    The purpose of this paper is to introduce a Generalized-Query-By-Example (GQBE) data manipulation language (DML) that can be built on top of most existing databases (ie., relational, hierarchical, and network). The data manipulation language supports retrieval, insertion, deletion, and update operations and has a formal semantics based on database logic. It is also seen that GQBE can by used as a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization Algorithms for Distributed Queries

    Publication Year: 1983, Page(s):57 - 68
    Cited by:  Papers (102)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4488 KB)

    The efficiency of processing strategies for queries in a distributed database is critical for system performance. Methods are studied to minimize the response time and the total time for distributed queries. A new algorithm (Algorithm GENERAL) is presented to derive processing strategies for arbitrarily complex queries. Three versions of the algorithm are given: one for minimizing response time an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Program Restructuring in a Multilevel Virtual Memory

    Publication Year: 1983, Page(s):69 - 79
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4864 KB)

    Program restructuring techniques have proven successful in two-level automatically managed memory hierarchies. The possibility of extending them to multilevel environments is investigated. The performance of strategy-oriented restructuring algorithms in a three-level linear hierarchy managed by sampled working set policies or by a combination of sampled working set and local LRU policies is studie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experiments on the Knee Criterion in a Multiprogrammed Computer System

    Publication Year: 1983, Page(s):79 - 86
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4568 KB)

    Although the effectiveness of the knee criterion [7] as a virtual memory management strategy is widely accepted, it has been impossible to take advantage of it in a practical system, because little information is available about the program behavior of executing jobs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of Secondary Storage Fragmentation

    Publication Year: 1983, Page(s):87 - 93
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2672 KB)

    Fragmentation of storage is a common phenomenon in both main storage and secondary storage. Fragmentation in secondary storage not only jeopardizes the allocation of space but also, since secondary storage access time–unlike that in main storage–is typically nonuniform, a decrease in efficiency arising from additional head movement may also result. A fragmented storage exhibits a check... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measuring the Performance and Behavior of Icon Programs

    Publication Year: 1983, Page(s):93 - 103
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5048 KB)

    The importance of the ability to measure the performance of programs written in high-level languages is well known. Performance measurement enables users to locate and correct program inefficiencies where automatic optimizations fail and provides a tool for understanding program behavior. This paper describes performance measurement facilities for the Icon programming language, and shows not only ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Program Graphs and Execution Behavior

    Publication Year: 1983, Page(s):103 - 108
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1864 KB)

    This paper describes a technique for predicting the execution behavior of a source program or a software design specification. As a by-product of syntactic analysis, a program graph is constructed which can subsequently be treated as the graph of a finite automaton. The expression for execution behavior is the regular expression of the graph. Several simplification techniques for these expressions... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Steady-State Probabilities for a Queue with a General Service Distribution and State-Dependent Arrivals

    Publication Year: 1983, Page(s):109 - 113
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    We consider a queueing system with a general service distribution having a possibility of feedback. The customers belong to the same class, and the queueing discipline is first-in, first-out. There is only one server in the station. The facility is rendered Markovian by means of fictitious stages. The input flow depends on the state of the station. It is shown that the equilibrium probabilities ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to "Specification and Verification of Communication Protocols in AFFIRM Using State Transition Models"

    Publication Year: 1983, Page(s): 113
    Request permission for commercial reuse | PDF file iconPDF (152 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information for authors

    Publication Year: 1983, Page(s): 114
    Request permission for commercial reuse | PDF file iconPDF (224 KB)
    Freely Available from IEEE
  • IEEE copyright form

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

    Publication Year: 1983, Page(s): 115-b
    Request permission for commercial reuse | PDF file iconPDF (216 KB)
    Freely Available from IEEE
  • Call for Papers

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