eprintid: 1381
rev_number: 10
eprint_status: archive
userid: 40
dir: disk0/00/00/13/81
datestamp: 2012-09-26 12:54:23
lastmod: 2013-03-07 12:56:25
status_changed: 2012-09-26 12:54:23
type: book_section
metadata_visibility: show
creators_name: Pettorossi, Alberto
creators_name: Proietti, Maurizio
creators_name: Senni, Valerio
creators_id: 
creators_id: 
creators_id: valerio.senni@imtlucca.it
title: Proofs of Program Properties via Unfold/Fold Transformations of Constraint Logic Programs
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
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.
date: 2006
date_type: published
volume: 05161
publisher: Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany
place_of_pub: Dagstuhl, Germany
event_title: Transformation Techniques in Software Engineering
refereed: TRUE
book_title: Dagstuhl Seminar Proceedings
official_url: http://drops.dagstuhl.de/opus/volltexte/2006/422/
citation:   Pettorossi, Alberto and Proietti, Maurizio and Senni, Valerio  Proofs of Program Properties via Unfold/Fold Transformations of Constraint Logic Programs.   In:  Dagstuhl Seminar Proceedings.   Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, Dagstuhl, Germany.       (2006)