Applicable family of data flow testing criteria

Phyllis Frankl, Elaine J. Weyuker

    Research output: Contribution to journalArticle

    Abstract

    The authors extend the definitions of the previously introduced family of data-flow testing criteria to apply to programs written in a large subset of Pascal. They then define a family of adequacy criteria called feasible data-flow testing criteria, which are derived from the data-flow testing criteria. The feasible data-flow testing criteria circumvent the problem of nonapplicability of the data-flow testing criteria by requiring the test data to exercise only those definition-use associations which are executable. It is shown that there are significant differences between the relationships among the data-flow testing criteria and the relationships among the feasible data-flow testing criteria. The authors discuss a generalized notion of the executability of a path through a program unit. A script of a testing session using their data-flow testing tool, ASSET, is included.

    Original languageEnglish (US)
    Pages (from-to)1483-1498
    Number of pages16
    JournalIEEE Transactions on Software Engineering
    Volume14
    Issue number10
    DOIs
    StatePublished - Oct 1988

    Fingerprint

    Testing

    ASJC Scopus subject areas

    • Computer Graphics and Computer-Aided Design
    • Software
    • Electrical and Electronic Engineering

    Cite this

    Applicable family of data flow testing criteria. / Frankl, Phyllis; Weyuker, Elaine J.

    In: IEEE Transactions on Software Engineering, Vol. 14, No. 10, 10.1988, p. 1483-1498.

    Research output: Contribution to journalArticle

    Frankl, Phyllis ; Weyuker, Elaine J. / Applicable family of data flow testing criteria. In: IEEE Transactions on Software Engineering. 1988 ; Vol. 14, No. 10. pp. 1483-1498.
    @article{e097cb02ffc643509273e36ff5f1acc1,
    title = "Applicable family of data flow testing criteria",
    abstract = "The authors extend the definitions of the previously introduced family of data-flow testing criteria to apply to programs written in a large subset of Pascal. They then define a family of adequacy criteria called feasible data-flow testing criteria, which are derived from the data-flow testing criteria. The feasible data-flow testing criteria circumvent the problem of nonapplicability of the data-flow testing criteria by requiring the test data to exercise only those definition-use associations which are executable. It is shown that there are significant differences between the relationships among the data-flow testing criteria and the relationships among the feasible data-flow testing criteria. The authors discuss a generalized notion of the executability of a path through a program unit. A script of a testing session using their data-flow testing tool, ASSET, is included.",
    author = "Phyllis Frankl and Weyuker, {Elaine J.}",
    year = "1988",
    month = "10",
    doi = "10.1109/32.6194",
    language = "English (US)",
    volume = "14",
    pages = "1483--1498",
    journal = "IEEE Transactions on Software Engineering",
    issn = "0098-5589",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "10",

    }

    TY - JOUR

    T1 - Applicable family of data flow testing criteria

    AU - Frankl, Phyllis

    AU - Weyuker, Elaine J.

    PY - 1988/10

    Y1 - 1988/10

    N2 - The authors extend the definitions of the previously introduced family of data-flow testing criteria to apply to programs written in a large subset of Pascal. They then define a family of adequacy criteria called feasible data-flow testing criteria, which are derived from the data-flow testing criteria. The feasible data-flow testing criteria circumvent the problem of nonapplicability of the data-flow testing criteria by requiring the test data to exercise only those definition-use associations which are executable. It is shown that there are significant differences between the relationships among the data-flow testing criteria and the relationships among the feasible data-flow testing criteria. The authors discuss a generalized notion of the executability of a path through a program unit. A script of a testing session using their data-flow testing tool, ASSET, is included.

    AB - The authors extend the definitions of the previously introduced family of data-flow testing criteria to apply to programs written in a large subset of Pascal. They then define a family of adequacy criteria called feasible data-flow testing criteria, which are derived from the data-flow testing criteria. The feasible data-flow testing criteria circumvent the problem of nonapplicability of the data-flow testing criteria by requiring the test data to exercise only those definition-use associations which are executable. It is shown that there are significant differences between the relationships among the data-flow testing criteria and the relationships among the feasible data-flow testing criteria. The authors discuss a generalized notion of the executability of a path through a program unit. A script of a testing session using their data-flow testing tool, ASSET, is included.

    UR - http://www.scopus.com/inward/record.url?scp=0024091830&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0024091830&partnerID=8YFLogxK

    U2 - 10.1109/32.6194

    DO - 10.1109/32.6194

    M3 - Article

    VL - 14

    SP - 1483

    EP - 1498

    JO - IEEE Transactions on Software Engineering

    JF - IEEE Transactions on Software Engineering

    SN - 0098-5589

    IS - 10

    ER -