By Topic

Software Engineering, IEEE Transactions on

Issue 9 • Date Sep 1991

Filter Results

Displaying Results 1 - 13 of 13
  • Software specialization via symbolic execution

    Publication Year: 1991 , Page(s): 884 - 899
    Cited by:  Papers (12)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1228 KB)  

    A technique and an environment-supporting specialization of generalized software components are described. The technique is based on symbolic execution. It allows one to transform a generalized software component into a more specific and more efficient component. Specialization is proposed as a technique that improves software reuse. The idea is that a library of generalized components exists and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semi-automatic program construction from specifications using library modules

    Publication Year: 1991 , Page(s): 853 - 871
    Cited by:  Papers (4)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1328 KB)  

    A method of semiautomatic specification refinement and program generation using library modules, is described. Users write their specifications and modify and rearrange them so that they can be refined with the aid of the library modules. When a specification is given, a refinement system, called MAPS (module-aided program construction system) searches for library modules applicable to the given s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On rigorous transaction scheduling

    Publication Year: 1991 , Page(s): 954 - 960
    Cited by:  Papers (21)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (676 KB)  

    The class of transaction scheduling mechanisms in which the transaction serialization order can be determined by controlling their commitment order, is defined. This class of transaction management mechanisms is important, because it simplifies transaction management in a multidatabase system environment. The notion of analogous execution and serialization orders of transactions is defined and the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constraint-based automatic test data generation

    Publication Year: 1991 , Page(s): 900 - 910
    Cited by:  Papers (160)  |  Patents (8)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1012 KB)  

    A novel technique for automatically generating test data is presented. The technique is based on mutation analysis and creates test data that approximate relative adequacy. It is a fault-based technique that uses algebraic constraints to describe test cases designed to find particular types of faults. A set of tools (collectively called Godzilla) that automatically generates constraints and solves... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The probability of load balancing success in a homogeneous network

    Publication Year: 1991 , Page(s): 922 - 933
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (856 KB)  

    The problem of load balancing in distributed systems composed of several homogeneous sites connected by a subnet is examined. The author determines a general formula for the probability that any one site in the system is underloaded while some other site in the system is overloaded. This probability can be used to define the likelihood of load balancing success in a distributed operating system. T... View full abstract»

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

    Publication Year: 1991 , Page(s): 911 - 921
    Cited by:  Papers (11)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (968 KB)  

    An adaptive program is one that changes its behavior base on the current state of its environment. This notion of adaptivity is formalized, and a logic for reasoning about adaptive programs is presented. The logic includes several composition operators that can be used to define an adaptive program in terms of given constituent programs; programs resulting from these compositions retain the adapti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A linear algorithm for generating random numbers with a given distribution

    Publication Year: 1991 , Page(s): 972 - 975
    Cited by:  Papers (9)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (236 KB)  

    Let ξ be a random variable over a finite set with an arbitrary probability distribution. Improvements to a fast method of generating sample values for ξ in constant time are suggested. The proposed modification reduces the time required for initialization to O( n). For a simple genetic algorithm, this improvement changes an O(g n 1n n) algorithm i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fragmenting relations horizontally using a knowledge-based approach

    Publication Year: 1991 , Page(s): 872 - 883
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1080 KB)  

    In distributed DBMSs, one major issue in developing a horizontal fragmentation technique is what criteria to use to guide the fragmentation. The authors propose to use, in addition to typical user queries, particular knowledge about the data itself. Use of this knowledge allows revision of typical user queries into more precise forms. The revised query expressions produce better estimations of use... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Managing communication networks by monitoring databases

    Publication Year: 1991 , Page(s): 944 - 953
    Cited by:  Papers (26)  |  Patents (32)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1016 KB)  

    The problem of managing large communication networks using statistical tests, alerts, and correlation among alerts is considered. The authors propose a model of these network management functions as data-manipulation operations. They argue that this approach can improve the flexibility of network management systems by providing a language that is declarative and set-oriented. These are properties ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heap-filter merge join: a new algorithm for joining medium-size inputs

    Publication Year: 1991 , Page(s): 979 - 982
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (336 KB)  

    A novel algorithm for relational equijoin is presented. The algorithm is a modification of merge join, but promises superior performance for medium-size inputs. In many cases it even compares favorably with both merge join and hybrid hash join, which is shown using analytic cost functions View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated module testing in Prolog

    Publication Year: 1991 , Page(s): 934 - 943
    Cited by:  Papers (12)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (804 KB)  

    Tools and techniques for writing scripts in Prolog that automatically test modules implemented in C are presented. Both the input generation and the test oracle problems are addressed, focusing on a balance between the adequacy of the test inputs and the cost of developing the output oracle. The authors investigate automated input generation according to functional testing, random testing, and a n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A management tool for evaluation of software design

    Publication Year: 1991 , Page(s): 961 - 971
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (868 KB)  

    A model for evaluating software designs based on extending the functional model of program verification with concepts from economic decision theory has been proposed. The authors describe the method, and discuss a prototype implementation of a tool, called Selector, which implements this technique. It is suggested that a system like Selector can be used in two ways: as a decision support system fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the complexity of generating optimal test sequences

    Publication Year: 1991 , Page(s): 976 - 978
    Cited by:  Papers (10)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (264 KB)  

    The authors investigate whether maximal overlapping of protocol test subsequences can be achieved in polynomial time. They review the concepts related to FSM (finite state machine)-based test sequence generation and then define the optimal test sequence generation (OTSG) problem. It is proved that the OTSG problem is NP-complete. Therefore an efficient solution to the problem should not be expecte... 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
tseeicdwyer@computer.org