DagSemProc.05161.7.pdf
- Filesize: 100 kB
- 2 pages
Document
Proofs of Program Properties via Unfold/Fold Transformations of Constraint Logic Programs
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 5161
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2006-03-07
Cite AsGet BibTex
Alberto Pettorossi, Maurizio Proietti, and Valerio Senni. Proofs of Program Properties via Unfold/Fold Transformations of Constraint Logic Programs. In Transformation Techniques in Software Engineering. Dagstuhl Seminar Proceedings, Volume 5161, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
https://doi.org/10.4230/DagSemProc.05161.7
https://doi.org/10.4230/DagSemProc.05161.7
Abstract
In the literature there are various papers which illustrate the relationship between the unfold/fold program transformation techniques and the proofs of program properties both in the case of logic programs and in the case of functional programs.In this paper we illustrate that relationship in the case of constraint logic programs. We build up on results already presented, i.e.,where we have considered logic programs with locally stratified negation.
The constraint logic programming paradigm significantly extends the logic-programming paradigm by allowing some of the atoms to denote constraints in a suitably chosen constraint domain. By using those constraints it is often possible to get simple and direct formulations of problem solutions.
Keywords
- Program properties
- unfold/fold transformation
- constraint logic programming
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads