On the New Application of Call Patterns to CPM Testing of Prolog Programs
Information on call patterns is known to be useful for analysis and optimization of Prolog programs. Several call patterns semantics exists for Prolog or for the subset of Prolog. In this paper we propose a method to apply the call patterns semantics to CPM testing of Prolog programs. The method can be viewed as an attempt to improve the testing of Prolog programs by the result of program analysis. By analyzing the way in which procedures are used in a program, we can reduce the number of test frames and therefore the number of test cases generated in CPM testing of a procedure.
KeywordsLogic Program Free Variable Procedure Call General Goal Observability Constraint
Unable to display preview. Download preview PDF.
- 1.Belli, F., Jack, O.: PROTest II Testing Logic Programs, Technical report, 1992/13, ADT (October 1992)Google Scholar
- 2.Gabbrielli, M., Giacobazzi, R.: Goal Independency and Call Patterns in the Analysis of Logic Programs, In: Proceedings of the Ninth ACM Symposium on Applied Computing, pp. 394–399 (1994)Google Scholar
- 4.Kókai, G., Harmath, L., Gyimóthy, T.: IDTS: a Tool for Debugging and Testing of Prolog Programs. In: Proceedings of LIRA 1997, The 8th Conference on Logic and Computer Science, Novi Sad, Yugoslavia, September 1-4, pp. 103–110 (1997)Google Scholar