Domain testing based on character string predicate [software testing

Zhao, Xiujian; Lyu,; Min, Yi

doi:10.1109/ats.2003.1250790

Cited by 4 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To the best of our knowledge, only some work done by Zhao et al in [17,18,19] are related to strings. But they used the dynamic methods.…”

Section: Character Stringsmentioning

confidence: 99%

“…Different from the work in [17,18,19], we use static method. We extend our previous work [13,15,16], in which the character string variables were not supported.…”

Section: Test Generation For Character Stringmentioning

confidence: 99%

“…Different from the method used in [17,18], which is based on function minimization and needs to execute the tested program, our method is based on static analysis as well as symbolic execution and constraint solving techniques. We model the string function by logic formulae with assignment statements, and expand the model as a set of subconstraints, then use the sub-constraints to replace the function call in the program path.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Test Data Generation for C Programs with String-Handling Functions

Ruan

Zhang

Yan

2008

2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering

View full text Add to dashboard Cite

There are many test generation methods, but few of them consider the character strings. This paper proposes a method to generate test data for C programs with character strings and character string function calls, which is based on path oriented testing. Each character variable is viewed as an integer variable with the restriction that the value should be between 0 and 255. A character string is viewed as an array of characters with a predefined fixed length. Many commonly used character library functions are modeled by formulae in predicate logic with assignment statements. The model is then used to replace the function call in the program path, which will be solved by a path analysis tool to generate the test data. A prototype tool called StrGen is developed to illustrate the feasibility of this method. The results of some examples also show that this method is feasible and very efficient.

show abstract

“…To the best of our knowledge, only some work done by Zhao et al in [17,18,19] are related to strings. But they used the dynamic methods.…”

Section: Character Stringsmentioning

confidence: 99%

“…Different from the work in [17,18,19], we use static method. We extend our previous work [13,15,16], in which the character string variables were not supported.…”

Section: Test Generation For Character Stringmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Test Data Generation for C Programs with String-Handling Functions

Ruan

Zhang

Yan

2008

2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering

View full text Add to dashboard Cite

show abstract

“…Jeng and Weyuker [5] proposed a simplified domain testing strategy which was not limited to linear pis any longer. In addition, Zhao [11] presented a method to generate domain boundary for character strings.…”

Section: Preliminary Experimentsmentioning

confidence: 99%

Predicate Interpretation Analysis Based on Soot

Fang

Shi

Feng

et al. 2017

International Conferences on Software Engineering and Knowledge Engineering

View full text Add to dashboard Cite

Abstract-Symbolic execution maintains a path condition pc for every possible path of a program. It is challenging to construct a pc if some complex issues are involved in the path. A predicate interpretation pi is a subexpression of a pc and a pc of a path is a conjunction of all pis in the path. Predicate interpretation has been widely used in theoretical analysis on domain testing and related fields. It recently emerges new impact on software testing by using partial path constraints to generate test data. In this paper, we propose an approach to produce pis in a program. A tool for predicate interpretation analysis for Java programs is implemented based on the data-flow framework of Soot. Most of Java features can be handled in our tool. Moreover, a formal rule of predicate interpretation analysis is presented for more applications in the future. The experimental results show that our tool can produce pis of a program effectively and efficiently.

show abstract

“…[5] applied formal methods to software testing, in which domain testing is integrated in a test template framework to generate tests from Z specifications. [15] [16] and [17] describe domain testing using Boolean specifications and character string predicates, respectively. However, these studies are mostly concerned with unit testing, but not with integration testing, which is necessary for large-scale systems development in industry.…”

Section: Related Workmentioning

confidence: 99%