A Framework for Assertion-Based Debugging in Constraint Logic Programming

Abstract. We propose a general framework for assertion-based debugging of constraint logic programs. Assertions are linguistic constructions which allow expressing properties of programs. We de ne assertion schemas which allow writing partial speci cations for constraint logic programs using quite general properties, including user-de ned programs. The framework is aimed at detecting deviations of the program behavior symptoms with respect to the given assertions, either at compiletime or run-time. We provide techniques for using information from global analysis both to detect at compile-time assertions which do not hold in at least one of the possible executions i.e., static symptoms and assertions which hold for all possible executions i.e., statically proved assertions. We also provide program transformations which introduce tests in the program for checking at run-time those assertions whose status cannot be determined at compile-time. Both the static and the dynamic checking are p...

• Type: Conference
• Year: 1998
• Where: CP
• Authors: Germán Puebla, Francisco Bueno, Manuel V. Hermenegildo
• Keywords: Artificial Intelligence, Compile-time Assertions, Constraint Logic Programs, CP 1998, Possible Executions