By Topic

IEEE Transactions on Software Engineering

Issue 6 • Date June 1987

Filter Results

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

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

    Publication Year: 1987, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (200 KB)
    Freely Available from IEEE
  • Automatic Compiler Production: The Front End

    Publication Year: 1987, Page(s):609 - 627
    Cited by:  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4440 KB)

    This paper describes a system for automatically producing complete compiler front ends from simple, nonprocedural specifications of the source language. This system is based on a detailed model of a compiler front end that is presented first. The system itself is then described using a Pascal subset as an example. This work was part of a larger project aimed at producing complete compilers in a si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimiizing Static Scope Lisp by Repetitive Interpretation of Recursive Function Calls

    Publication Year: 1987, Page(s):628 - 635
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2456 KB)

    This paper presents some recent results in interpreter optimization. The techniques of shallow binding and repetitive interpretation of tail recursive functions are adapted to Lisp with static scoping as the binding method for-all identifiers. Then a new technique of interpreting" covered tail recursive" functions is proposed. The purpose of the paper is to show that the extra expense for static s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Space-Efficient Optimization of Call-by-Need

    Publication Year: 1987, Page(s):636 - 642
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2544 KB)

    Call-by-need is widely regarded as an optimal (to within a constant factor) parameter passing mechanism for functional programming languages. Except for certain special cases involving higher order functions, call-by-need is optimal with respect to time. However, call-by-need is far from optimal with respect to space. We examine some of the space problems which can arise with call-by-need and othe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reflexive Incidence Matrx (RIM) Representation of Petri Nets

    Publication Year: 1987, Page(s):643 - 653
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3952 KB)

    Although incidence matrix representation has been used to analyze the Petri net based models of a system, it has the limitation that it does not preserve reflexive properties (i.e., the presence of self-loops) of Petri nets. But in many practical applications self-loops play very important roles. This paper proposes a new representation scheme for general Petri nets. This scheme defines a matrix c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Message-Based Approach to Discrete-Event Simulation

    Publication Year: 1987, Page(s):654 - 665
    Cited by:  Papers (31)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3552 KB)

    This paper develops a message-based approach to discrete-event simulation. Although message-based simulators have the same expressive power as traditional discrete-event simulation lanuages, they provide a more natural environment for simulating distributed systems. In message-based simulations, a physical system is modeled by a set of message-communicating processes. The events in the system are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Approach and Mechanism for Auditable and Testable Advanced Transaction Processing Systems

    Publication Year: 1987, Page(s):666 - 676
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3184 KB)

    An architectural approach and a software mechanism is presented to enhance the auditability and testability of advanced transaction processing EDP systems. A high degree of auditability can be achieved through integrated support of auditability mechanisms as opposed to the traditional after-the-fact, ad hoc, add-on audit and test approaches. A programmable audit evidence gathering mechanism called... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some Theory Concerning Certification of Mathematical Subroutines by Black Box Testing

    Publication Year: 1987, Page(s):677 - 682
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2016 KB)

    Several inequalities are derived for use in certifying function subroutines by means of black box testing. It is assumed that a function is approximated by means of a polynomial of limited degree on a closed interval. These inequalities give upper bounds on the error of the approximation over the entire interval based on the error measured over a finite sample and known properties of the function. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated Protocol Validation in Argos: Assertion Proving and Scatter Searching

    Publication Year: 1987, Page(s):683 - 696
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3568 KB)

    Argos is a validation language for data communication protocols. To validate a protocol, a model in Argos is constructed consisting of a control flow specification and a formal description of the correctness requirements. This model can be compiled into a minimized lower level description that is based on a formal model of communicating finite state machines. An automated protocol validator trace ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Empirical Study of Software Metrics

    Publication Year: 1987, Page(s):697 - 708
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3032 KB)

    Software metrics are computed for the purpose of evaluating certain characteristics of the software developed. A Fortran static source code analyzer, FORTRANAL, was developed to study 31 metrics, including a new hybrid metric introduced in this paper, and applied to a database of 255 programs, all of which were student assignments. Comparisons among these metrics are performed. Their cross-correla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of Database System Architectures Using Benchmarks

    Publication Year: 1987, Page(s):709 - 725
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5440 KB)

    Database machine architectures have been proposed as a promising alternative to improve database system performance, control, and flexibility. While many claims have been made for the database machine concept, few studies have been made to test the performance advantages and disadvantages of a database machine in an application environment. A comprehensive benchmark study comparing the performance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Scheme to Enforce Data Dependence on Large Multiprocessor Systems

    Publication Year: 1987, Page(s):726 - 739
    Cited by:  Papers (44)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3128 KB)

    Enforcement of data dependence in parallel algorithms requires certain synchronization primitives. For simple data dependence, synchronization primitives like Full/Empty bit in HEP machine [5] can be very effective. However, if data dependence cannot be determined at compile time, or if very complicated, more efficient synchronization schemes and algorithms are needed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reasoning About Probabilistic Behavior in Concurrent Systems

    Publication Year: 1987, Page(s):740 - 745
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1112 KB)

    Certain aspects of the behavior of concurrent systems are intrinsically probabilistic in nature, e.g., the behavior of imperfect communication media used in network protocols. We address the problem of expressing such behavior in an algebraic calculus for communicating systems. The introduction of probabilistic information in the calculus alleviates the problem of proving liveness, as proving live... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving the Performance of an Optimistic Concurrency Control Algorithm Through Timestamps and Versions

    Publication Year: 1987, Page(s):746 - 751
    Cited by:  Papers (5)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1272 KB)

    This correspondence describes and analyzes two schemes for improving the performance of serial validation, an optimistic concurrency control algorithm proposed by Kutng and Robinson. It is shown that timestamp-based techniques can be used to implement serial validation, yielding an equivalent algorithm with a much lower validation cost. A multiple version variant of serial validation is then prese... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nontraversible Paths in a Program

    Publication Year: 1987, Page(s):751 - 756
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    A finite-state machine representation of a program graph is shown to have the property of exposing nontraversible paths in a program. A minimal covering set of paths for such a program may fail to yield realizable test cases, as the nontraversible paths have inconsistent path predicates. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interinput and Interoutput Time Distribution in Classical Product-Form Networks

    Publication Year: 1987, Page(s):756 - 759
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    It is shown that, in a general Jackson network of queues, the distribution of interinput and interoutput times are not equal. Equality holds in reversible classical product-form networks with or without blocking. A sufficient condition for reversibility is given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Detection of Mutual Inconsistency in Distributed Systems"

    Publication Year: 1987, Page(s):759 - 760
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    In the above paper,1authors have given a technique for the detection of mutual inconsistency among the copies of a file, in presence of network partitioning. This technique involves maintaining a "version vector" with each file in a partition. Here, we show that it is impossible to maintain the version vectors when arbitrary reconfigurations can occur after a network partitioning. 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: 1987, Page(s): 760-a
    Request permission for commercial reuse | PDF file iconPDF (240 KB)
    Freely Available from IEEE
  • Information for authors

    Publication Year: 1987, Page(s): 760
    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