Advertisement

On the New Application of Call Patterns to CPM Testing of Prolog Programs

  • Lingzhong Zhao
  • Tianlong Gu
  • Junyan Qian
  • Guoyong Cai
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4304)

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.

Keywords

Logic Program Free Variable Procedure Call General Goal Observability Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Belli, F., Jack, O.: PROTest II Testing Logic Programs, Technical report, 1992/13, ADT (October 1992)Google Scholar
  2. 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
  3. 3.
    Howe, J.M., King, A.: Efficient Groundness Analysis in Prolog. Theory and Practice of Logic Programming 3(1), 95–124 (2003)MATHCrossRefMathSciNetGoogle Scholar
  4. 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
  5. 5.
    Ostrand, T.J., Balker, M.J.: The Category-Partition Method for Specifying and Generating Functional Tests. Communications of ACM 31(6), 676–686 (1988)CrossRefGoogle Scholar
  6. 6.
    Spoto, F., Levi, G.: Abstract Interpretation of Prolog Programs. In: Haeberer, A.M. (ed.) AMAST 1998. LNCS, vol. 1548, pp. 455–470. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  7. 7.
    Volpe, P.: A first-order language for expressing sharing and type properties of logic programs. Science of Computer Programming 39(1), 125–148 (2001)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Lingzhong Zhao
    • 1
    • 2
  • Tianlong Gu
    • 1
  • Junyan Qian
    • 1
  • Guoyong Cai
    • 1
  1. 1.Department of Computer ScienceGuilin University of Electronic TechnologyGuilinChina
  2. 2.Electronic Engineering SchoolXidian UniversityXi’anChina

Personalised recommendations