By Topic

IEEE Transactions on Software Engineering

Issue 8 • Date Aug 1990

Filter Results

Displaying Results 1 - 11 of 11
  • Some properties of timed token medium access protocols

    Publication Year: 1990, Page(s):858 - 869
    Cited by:  Papers (20)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1004 KB)

    Timed-token protocols are used to handle, on the same local area network, both real-time and non-real-time traffic. The authors analyze this type of protocol, giving worst-case values for the throughput of non-real-time traffic and the average token rotation time. Results are obtained for synchronous traffic generated according to a generic periodic pattern under heavy conditions for non-real-time... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A graph model for software evolution

    Publication Year: 1990, Page(s):917 - 927
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1112 KB)

    A graph model of software evolution is presented. The author seeks to formalize the objects and activities involved in software evolution in sufficient detail to enable automatic assistance for maintaining the consistency and integrity of an evolving software system. This includes automated support for propagating the consequences of a change to a software system. The evolution of large and comple... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparative analysis of different models of checkpointing and recovery

    Publication Year: 1990, Page(s):807 - 821
    Cited by:  Papers (20)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    Different checkpointing strategies are combined with recovery models of different refinement levels in the database systems. The complexity of the resulting model increases with its accuracy in representing a realistic system. Three different analytic approaches are used depending on the complexity of the model: analytic, numerical and simulation. A Markovian queuing model is developed, resulting ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A theory of fault-based testing

    Publication Year: 1990, Page(s):844 - 857
    Cited by:  Papers (101)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1384 KB)

    A theory of fault-based program testing is defined and explained. Testing is fault-based when it seeks to demonstrate that prescribed faults are not in a program. It is assumed that a program can only be incorrect in a limited fashion specified by associating alternate expressions with program expressions. Classes of alternate expressions can be infinite. Substituting an alternate expression for a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A noninterference monitoring and replay mechanism for real-time software testing and debugging

    Publication Year: 1990, Page(s):897 - 916
    Cited by:  Papers (67)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1792 KB)

    A noninterference monitoring and replay mechanism using the recorded execution history of a program to control the replay of the program behavior and guarantee the reproduction of its errors is presented. Based on this approach, a noninterference monitoring architecture has been developed to collect the program execution data of a target real-time software system without affecting its execution. A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identifying extended entity-relationship object structures in relational schemas

    Publication Year: 1990, Page(s):777 - 790
    Cited by:  Papers (25)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1380 KB)

    Relational schemas consisting of relation-schemes, key dependencies and key-based inclusion dependencies (referential integrity constraints) are considered. Schemas of this form are said to be entity-relationship (EER)-convertible if they can be associated with an EER schema. A procedure that determines whether a relational schema is EER-convertible is developed. A normal form is proposed for rela... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A disciplined approach to office analysis

    Publication Year: 1990, Page(s):822 - 828
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    To define office requirements, the authors propose a disciplined language in which a good portion of conventionality and known and concrete concepts are associated with a minimum formalism. The language can be used in analyzing an office for the purpose of designing a computer-based office support system. Given the language, the designer can organize information obtained by people working in the o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated software test data generation

    Publication Year: 1990, Page(s):870 - 879
    Cited by:  Papers (320)  |  Patents (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    An alternative approach to test-data generation based on actual execution of the program under test, function-minimization methods and dynamic data-flow analysis is presented. Test data are developed for the program using actual values of input variables. When the program is executed, the program execution flow is monitored. If during program execution an undesirable execution flow is observed the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hybrid distributed centralized system structure for transaction processing

    Publication Year: 1990, Page(s):791 - 806
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1540 KB)

    A hybrid system structure comprised of distributed systems to take advantage of locality of reference and a central system to handle transactions that access non-local data is examined. Several transaction processing applications, such as reservation systems, insurance and banking have such regional locality of reference. A concurrency and coherency control protocol that maintains the integrity of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Starvation and critical race analyzers for Ada

    Publication Year: 1990, Page(s):829 - 843
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1392 KB)

    Starvation and critical race analysis tools for Ada designs are described. These tools are part of a temporal analysis toolset that includes an operational specification language, a language interpreter, and a deadlock analyzer for Ada. The starvation analyzer is based on a set-theoretic model of starvation. It uses a proof tree produced by the deadlock analyzer to define the possible computation ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • State constraints and pathwise decomposition of programs

    Publication Year: 1990, Page(s):880 - 896
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    A state constraint is a programming construct designed to restrict a program's domain of definition. It can be used to decompose a program pathwise, i.e. dividing the program into subprograms along the control flow, as opposed to dividing the program across the control flow when the program is decomposed into functions and procedures. As a result, a program consisting of one or more execution path... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

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