A constraint-based approach to the representation of software usage models

    Authors

    J. Poore; G. H. Walton;J. A. Whittaker

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Abbreviated Journal Title

    Inf. Softw. Technol.

    Keywords

    software usage models; Markov chains; convex constraints; Computer Science, Information Systems; Computer Science, Software; Engineering

    Abstract

    Software usage models are the basis for statistical testing. They derive their structure from specifications and their probabilities from evolving knowledge about the intended use of the software product. The evolving knowledge comes from developers, customers and testers of the software system in the form of relationships that should hold among the parameters of a model. When software usage models are encoded as Markov chains, their structure can be represented by a system of linear constraints, and many of the evolving relationships among model parameters can be represented by convex constraints. Given a Markov chain usage model as a system of convex constraints, mathematical programming can be used to generate the Markov chain transition probabilities that represent a specific software usage model. (C) 2000 Elsevier Science B.V. All rights reserved.

    Journal Title

    Information and Software Technology

    Volume

    42

    Issue/Number

    12

    Publication Date

    1-1-2000

    Document Type

    Article

    Language

    English

    First Page

    825

    Last Page

    833

    WOS Identifier

    WOS:000089543000005

    ISSN

    0950-5849

    Share

    COinS