A Novel Test Case Generation Method for Prolog Programs Based on Call Patterns Semantics

Zhao, Liang; Gu, Tianlong; Qian, Junyan; Cai, Guoyong

doi:10.1007/978-3-540-76637-7_8

Cited by 2 publications

(7 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The same technique is also used in Zhao et al (2007c). We assume that testers are interested in the lists ½e 1 ; .…”

Section: Test Frame Updating Based On An Approximation Cp Semanticsmentioning

confidence: 97%

“…We note that the simplification of the original cp semantics has nothing to do with the applicability of our method, and is only for the convenience of presentation. A modified version of this semantics is also used in Zhao et al (2007c), which studies the test case generation for a Prolog program based on an implicit representation of the control flow graph of the program. We choose Spoto's cp semantics because of it has two properties that are desired in our method.…”

Section: A Constraint-based Cp Semantics For Prologmentioning

confidence: 99%

“…The definition of predicate insert is from Zhao et al (2007c). The derivation tree below illustrates the resolution from the atom goal sort([3,2,1,4], L): …”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Test frame updating in CPM testing of Prolog programs

Zhao

Qian

et al. 2007

Software Qual J

Self Cite

View full text Add to dashboard Cite

Category Partition Method (CPM) is a general approach to specification-based program testing, where test frame reduction and refinement are two important issues. Test frame reduction is necessary since too many test frames may be produced, and test frame refinement is important since during CPM testing new information about test frame generation may be achieved and considered incrementally. Besides the information provided by testers or users, implementation related knowledge offers alternative information for reducing and refining CPM test frames. This paper explores the idea by proposing a call patterns semantics based test frame updating method for Prolog programs, in which a call patterns analysis is used to collect information about the way in which procedures are used in a program. The updated test frames will be represented as constraints. The effect of our test frame updating is two-fold. On one hand, it removes ''uncared'' data from the original set of test frames; on the other hand, it refines the test frames to which we should pay more attention. The first effect makes the input domain on which a procedure must be tested a subset of the procedure's input domain, and the latter makes testers stand more chance to find out the faults that are more likely to show their presence in the use of the program under consideration. Our test frame updating method preserves the effectiveness of CPM testing with respect to the detection of faults we care. The test case generation from the updated set of test frames is also discussed. In order to show the applicability of our method an approximation call patterns semantics is proposed, and the test frame updating on the semantics is illustrated by an example.

show abstract

“…The same technique is also used in Zhao et al (2007c). We assume that testers are interested in the lists ½e 1 ; .…”

Section: Test Frame Updating Based On An Approximation Cp Semanticsmentioning

confidence: 97%

Section: A Constraint-based Cp Semantics For Prologmentioning

confidence: 99%

See 1 more Smart Citation

Test frame updating in CPM testing of Prolog programs

Zhao

Qian

et al. 2007

Software Qual J

Self Cite

View full text Add to dashboard Cite

show abstract

“…/ / GFED @ABC ?>=< 89:; T2 programming language. In the literature, CFGs for Prolog (and Mercury) have been used for the aim of TDG in [16,21] ( [5] for Mercury). In particular, CFGs determine the computation paths for which test-cases will be produced.…”

Section: The Control Flow Of Prologmentioning

confidence: 99%

“…An exception is [7] where a glass-box testing approach is proposed to generate test-cases for Curry. In the case of CLP, test-cases are obtained for Prolog in [16,3,21]; and very recently for Mercury in [5]. Basically the test-cases are obtained by first computing constraints on the input arguments that correspond to execution paths of logic programs and then solving these constraints to obtain test inputs for such paths.…”

Section: Introductionmentioning

confidence: 99%

On the Generation of Test Data for Prolog by Partial Evaluation

Gomez-Zamalloa,

Albert,

Puebla

2009

Preprint

View full text Add to dashboard Cite

In recent work, we have proposed an approach to Test Data Generation (TDG) of imperative bytecode by partial evaluation (PE) of CLP which consists in two phases: (1) the bytecode program is first transformed into an equivalent CLP program by means of interpretive compilation by PE, (2) a second PE is performed in order to supervise the generation of test-cases by execution of the CLP decompiled program. The main advantages of TDG by PE include flexibility to handle new coverage criteria, the possibility to obtain test-case generators and its simplicity to be implemented. The approach in principle can be directly applied for TDG of any imperative language. However, when one tries to apply it to a declarative language like Prolog, we have found as a main difficulty the generation of test-cases which cover the more complex control flow of Prolog. Essentially, the problem is that an intrinsic feature of PE is that it only computes non-failing derivations while in TDG for Prolog it is essential to generate test-cases associated to failing computations. Basically, we propose to transform the original Prolog program into an equivalent Prolog program with explicit failure by partially evaluating a Prolog interpreter which captures failing derivations w.r.t. the input program. Another issue that we discuss in the paper is that, while in the case of bytecode the underlying constraint domain only manipulates integers, in Prolog it should properly handle the symbolic data manipulated by the program. The resulting scheme is of interest for bringing the advantages which are inherent in TDG by PE to the field of logic programming.

show abstract

A Novel Test Case Generation Method for Prolog Programs Based on Call Patterns Semantics

Cited by 2 publications

References 13 publications

Test frame updating in CPM testing of Prolog programs

Test frame updating in CPM testing of Prolog programs

On the Generation of Test Data for Prolog by Partial Evaluation

Contact Info

Product

Resources

About