2007•Unpublished venueRequires access

A Novel Framework for Test Domain Reduction using Extended Finite State Machine

Nutchakorn Ngamsaowaros, Peraphon Sophatsathit

Open publisher page 2 citations

Abstract

Test case generation is an expensive, tedious, and error- prone process in software testing. In this paper, test case generation is accomplished using an Extended Finite State Machine (EFSM). The proper domain representative along the specified path is selected based on fundamental calculus approximation. The pre/post-conditions of class behavior is derived from a continuous or piece-wise continuous function whose values are chosen from partitioned subdomains. Subsequent test data for the designated class can be generated from the selected test frames. In so doing, the domain is partitioned wherein reduced test cases are generated, yet insuring complete test coverage of the designated test plan. The proposed modeling technique will be conducive toward a new realm of test domain analysis. Its validity can also be procedurally proved by straightforward mathematical principles.

About this research paper

What this paper is about

Test case generation is an expensive, tedious, and error- prone process in software testing. In this paper, test case generation is accomplished using an Extended Finite State Machine (EFSM). The proper domain representative along the specified path is selected based on fundamental calculus approximation. The pre/post-conditions of class behavior is derived from a continuous or piece-wise continuous function whose values are chosen from partitioned subdomains. Subsequent test data for the designated class can be generated from the selected test frames. In so doing, the domain is partitioned wherein reduced test cases are generated, yet insuring complete test coverage of the designated test plan. The proposed modeling technique will be conducive toward a new realm of test domain analysis. Its validity can also be procedurally proved by straightforward mathematical principles.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Test case generation is an expensive, tedious, and error- prone process in software testing. In this paper, test case generation is accomplished using an Extended Finite State Machine (EFSM). The proper domain representative along the specified path is selected based on fundamental calculus approximation. The pre/post-conditions of class behavior is derived from a continuous or piece-wise continuous function whose values are chosen from partitioned subdomains. Subsequent test data for the designated class can be generated from the selected test frames. In so doing, the domain is partitioned wherein reduced test cases are generated, yet insuring complete test coverage of the designated test plan. The proposed modeling technique will be conducive toward a new realm of test domain analysis. Its validity can also be procedurally proved by straightforward mathematical principles.

Key concepts: Extended finite-state machine, Computer science, Finite-state machine, Domain (mathematical analysis), Test plan, Test case, Code coverage, Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
A Novel Framework for Test Domain Reduction using Extended Finite State Machine — Research Paper | ScholarLens