Inductive assertion method for logic programs
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
A type system for logic program
Journal of Logic Programming
Abstract interpretation and application to logic programs
Journal of Logic Programming
Deriving descriptions of possible values of program variables by means of abstract interpretation
Journal of Logic Programming
The Go¨del programming language
The Go¨del programming language
Fast and precise regular approximations of logic programs
Proceedings of the eleventh international conference on Logic programming
Meta-variables in logic programming, or in praise of ambivalent syntax
Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
Handbook of formal languages, vol. 3
Verifying Correctness of Logic Programs
TAPSOFT '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages
A Framework for Assertion-Based Debugging in Constraint Logic Programming
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
How to Transform an Analyzer into a Verifier
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
| Hi-index | 0.00 |
This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a specification that approximates the semantics of a given program. The semantics of interest is an operational "call-success" semantics. The main intended application is program debugging. We consider a restricted class of specifications, which are regular types of constrained atoms. Our type inference approach is based on bottom-up abstract interpretation, which is used to approximate the declarative semantics (c-semantics). By using "magic transformations" we can describe the call-success semantics of a program by the declarative semantics of another program. We are focused on CLP over finite domains. Our prototype program analyzer works for the programming language CHIP.