The search functionality is under construction.

The search functionality is under construction.

We try to use a computer algebra system Mathematica as a test case generation system. In test case generation, we generally need to solve equations and inequalities. The main reason why we take Mathematica is because it has a built-in function to solve equations and inequalities. In this paper, we deal with both black-box testing and white-box testing. First, we show two black-box test case generation procedures described in Mathematica. The first one is based on equivalence partitioning. Mathematica explicitly shows a case that test cases do no exist. This is an advantage in using Mathematica. The second procedure is a modification of the first one adopting boundary value analysis. For implementation of boundary value analysis, we give a formalization for it. Next, we show a white-box test case generation procedure. For this purpose, we also give a model for source programs. It is like a control flow graph model. The proposed procedure analyzes a model description of a program.

- Publication
- IEICE TRANSACTIONS on Information Vol.E93-D No.5 pp.1006-1017

- Publication Date
- 2010/05/01

- Publicized

- Online ISSN
- 1745-1361

- DOI
- 10.1587/transinf.E93.D.1006

- Type of Manuscript
- Special Section PAPER (Special Section on Formal Approach)

- Category
- Software Testing

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Satoshi HATTORI, "Computer Algebra System as Test Generation System" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 5, pp. 1006-1017, May 2010, doi: 10.1587/transinf.E93.D.1006.

Abstract: We try to use a computer algebra system Mathematica as a test case generation system. In test case generation, we generally need to solve equations and inequalities. The main reason why we take Mathematica is because it has a built-in function to solve equations and inequalities. In this paper, we deal with both black-box testing and white-box testing. First, we show two black-box test case generation procedures described in Mathematica. The first one is based on equivalence partitioning. Mathematica explicitly shows a case that test cases do no exist. This is an advantage in using Mathematica. The second procedure is a modification of the first one adopting boundary value analysis. For implementation of boundary value analysis, we give a formalization for it. Next, we show a white-box test case generation procedure. For this purpose, we also give a model for source programs. It is like a control flow graph model. The proposed procedure analyzes a model description of a program.

URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.1006/_p

Copy

@ARTICLE{e93-d_5_1006,

author={Satoshi HATTORI, },

journal={IEICE TRANSACTIONS on Information},

title={Computer Algebra System as Test Generation System},

year={2010},

volume={E93-D},

number={5},

pages={1006-1017},

abstract={We try to use a computer algebra system Mathematica as a test case generation system. In test case generation, we generally need to solve equations and inequalities. The main reason why we take Mathematica is because it has a built-in function to solve equations and inequalities. In this paper, we deal with both black-box testing and white-box testing. First, we show two black-box test case generation procedures described in Mathematica. The first one is based on equivalence partitioning. Mathematica explicitly shows a case that test cases do no exist. This is an advantage in using Mathematica. The second procedure is a modification of the first one adopting boundary value analysis. For implementation of boundary value analysis, we give a formalization for it. Next, we show a white-box test case generation procedure. For this purpose, we also give a model for source programs. It is like a control flow graph model. The proposed procedure analyzes a model description of a program.},

keywords={},

doi={10.1587/transinf.E93.D.1006},

ISSN={1745-1361},

month={May},}

Copy

TY - JOUR

TI - Computer Algebra System as Test Generation System

T2 - IEICE TRANSACTIONS on Information

SP - 1006

EP - 1017

AU - Satoshi HATTORI

PY - 2010

DO - 10.1587/transinf.E93.D.1006

JO - IEICE TRANSACTIONS on Information

SN - 1745-1361

VL - E93-D

IS - 5

JA - IEICE TRANSACTIONS on Information

Y1 - May 2010

AB - We try to use a computer algebra system Mathematica as a test case generation system. In test case generation, we generally need to solve equations and inequalities. The main reason why we take Mathematica is because it has a built-in function to solve equations and inequalities. In this paper, we deal with both black-box testing and white-box testing. First, we show two black-box test case generation procedures described in Mathematica. The first one is based on equivalence partitioning. Mathematica explicitly shows a case that test cases do no exist. This is an advantage in using Mathematica. The second procedure is a modification of the first one adopting boundary value analysis. For implementation of boundary value analysis, we give a formalization for it. Next, we show a white-box test case generation procedure. For this purpose, we also give a model for source programs. It is like a control flow graph model. The proposed procedure analyzes a model description of a program.

ER -