Advertisement

Using Constraints in Local Proofs for CLP Debugging

  • Claude Laï
Conference paper
  • 297 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1551)

Abstract

This paper describes the addition of assertions for CLP debugging. These assertions are formed by a set of preconditions and a set of postconditions for the program predicates. We present a system with a rich set of primitives (based on constraints and meta-properties) to express the program properties. These primitives are such that they can often be proved efficiently with a local analysis at compile-time. In case of failure of the proof procedure, the program is completed with run-time checks to insure a correct execution.

Keywords

Logic Program Constraint Program Extended Structure Linear Solver Abstract Domain 
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.
    Bergere, M., Ferrand, G., Le Berre, F., Malfon, B., Tessier, A.: La Programmation Logique avec Contraintes revisitée en Termes d’ Arbre de Preuve et de Squelettes. Rapport de Recherche LIFO 96–06, Feb 1995.Google Scholar
  2. 2.
    Boye J., Maluszynski J.: Two aspects of Directional Types In Proc. Twelfth Int. Conf. on Logic Programming, pp. 747–763, The MIT Press, 1995.Google Scholar
  3. 3.
    Bronsart, F., Lakshman, T.K., Reddy, U.: A framework of directionality for proving termination of logic programs. In Proc. of JICSLP’92, pp. 321–335. The MIT Press, 1992.Google Scholar
  4. 4.
    Codognet, P., Filé, G.: Computations, Abstractions and Constraints in Logic Programs, International Conference on Computer Language, Oakland, 1992.Google Scholar
  5. 5.
    Deransart, P., Maluszynski, J.: A grammatical view of logic programming. The MIT Press, 1993.Google Scholar
  6. 6.
    Drabent, W., Maluszynski, J.: Induction assertion method for logic programs. Theorical Computer Science59, pp. 133–155, 1988.CrossRefMathSciNetzbMATHGoogle Scholar
  7. 7.
    Ferrand, G.: Error Diagnosis in Logic Programming. Journal of Logic Programming4, 177–198, 1987.CrossRefMathSciNetzbMATHGoogle Scholar
  8. 8.
    Le Berre, F., Tessier, A.: Declarative Incorrectness Diagnosis of Constraint Logic Programs. Rapport de Recherche LIFO 95-08 Université d’Orléans, Feb 1995.Google Scholar
  9. 9.
    Vetillard, E.: Utilisation de declarations en Programmation Logique avec Contraintes, PhD thesis, U. of Aix-Marseilles II, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Claude Laï
    • 1
  1. 1.Société PrologIA Case 909Marseille Cedex 9France

Personalised recommendations