Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1870))

Abstract

This chapter describes the use of partial correctness assertions for CLP debugging. These assertions are formed by a set of preconditions and a set of postconditions associated with each predicate used in the program. We present a system with a rich set of primitives (based on constraints and metaproperties) to express the program properties. These primitives are such that they can often be proven 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ferrand, G., Tessier, A.: Positive and Negative Diagnosis for Constraint Logic Programs in terms of proof skeletons. In: AADEBUG 1997 (1997)

    Google Scholar 

  2. Boye, J., Małuszyǹski, J.: Two aspects of Directional Types. In: Proc. Twelfth Int. Conf. on Logic Programming, pp. 747–763. The MIT Press, Cambridge (1995)

    Google Scholar 

  3. Bronsart, F., Lakshman, T.K., Reddy, U.: A framework of directionality for proving termination of logic programs. In: Proc. of JICSLP 1992, pp. 321–335. The MIT Press, Cambridge (1992)

    Google Scholar 

  4. Codognet, P., Filé, G.: Computations, Abstractions and Constraints in Logic Programs. In: International Conference on Computer Language, Oakland (1992)

    Google Scholar 

  5. Deransart, P., Małuszyǹski, J.: A grammatical view of logic programming. The MIT Press, Cambridge (1993)

    MATH  Google Scholar 

  6. Drabent, W., Małuszyǹski, J.: Induction assertion method for logic programs. Theorical Computer Science 59, 133–155 (1998)

    Article  Google Scholar 

  7. Ferrand, G.: Error Diagnosis in Logic Programming. Journal of Logic Programming 4, 177–198 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  8. Le Berre, F., Tessier, A.: Declarative Incorrectness Diagnosis of Constraint Logic Programs. Rapport de Recherche LIFO 95-08 Université d’Orléans (1995)

    Google Scholar 

  9. Vétillard, E.: Utilisation de déclarations en Programmation Logique avec Contraintes, PhD thesis, U. of Aix-Marseilles II (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Laï, C. (2000). Assertions with Constraints for CLP Debugging. In: Deransart, P., Hermenegildo, M.V., Małuszynski, J. (eds) Analysis and Visualization Tools for Constraint Programming. Lecture Notes in Computer Science, vol 1870. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722311_4

Download citation

  • DOI: https://doi.org/10.1007/10722311_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41137-6

  • Online ISBN: 978-3-540-40016-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics