On the new application of call patterns to CPM testing of prolog programs

Authors:
Lingzhong Zhao;Tianlong Gu;Junyan Qian;Guoyong Cai
Affiliations:
Department of Computer Science, Guilin University of Electronic Technology, Guilin, China;Department of Computer Science, Guilin University of Electronic Technology, Guilin, China;Department of Computer Science, Guilin University of Electronic Technology, Guilin, China;Department of Computer Science, Guilin University of Electronic Technology, Guilin, China
Venue:
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Year:
2006

Citing 5
Cited 1

The category-partition method for specifying and generating fuctional tests

Communications of the ACM
Goal independency and call patterns in the analysis of logic programs

SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
A first-order language for expressing sharing and type properties of logic programs

Science of Computer Programming - Special issue n static program analysis (SAS'98)
Abstract Interpretation of Prolog Programs

AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Efficient groundness analysis in Prolog

Theory and Practice of Logic Programming

Test frame updating in CPM testing of Prolog programs

Software Quality Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.