In this paper we briefly describe the use of the program transformation methodology for the development of correct

and efficient programs. We will consider, in particular,

the case of the transformation and the development of constraint logic programs

Pettorossi, Alberto

Proietti, Maurizio

Senni, Valerio

IMT Institutional Repository

English

A new solution of Dijkstra’s concurrent programming problem.

A transformation system for developing recursive programs.

Anefﬁcientuniﬁcation algorithm.

Constraint logic programming: A survey.

Constraint-based deductive model checking.

Decidable theories.

Derivation of logic programs.

Foundations of Logic Programming.

Logic program specialisation through partial deduction:

Model Checking.

Partial Evaluation and Automatic Program Generation.

Proving properties of constraint logic programs by eliminating existential variables.

Specialization with clause splitting for deriving deterministic constraint logic programs.

Synthesis and transformation of logic programs using unfold/fold proofs.

The automation of proof by mathematical induction.

The MAP transformation system.

The McCarthy’s induction principle: ‘oldy’ but ‘goody’.

Transformation rules for locally stratiﬁed constraint logic programs.

Transformational logic program synthesis.

Transforming normal programs by replacement.

Unfold/fold transformation of logic programs.

Unfold/fold transformation of stratiﬁed programs.

Veriﬁ-cation of parameterized systems using logic program transformations.

Verifying CTL properties of inﬁnite state systems by specializing constraint logic programs.

Program Transformation for Development, Verification, and Synthesis of Software