© Springer-Verlag Berlin Heidelberg 1994. A technique for transformation of definite logic programs is presented. A first phase performs an analysis of the extended call/exit patterns of the source program. It is shown that a particular form of correct abstract call/exit patterns can be used as a guide to control the transformation itself and can help to generate the target program having desired properties. The technique provides a framework which, combined with problem specific information concerning the source program, can lead to nontrivial transformations.status: publishe
This paper describes an algorithm performing an analysis and transformation of logic programs. The t...
Termination is an important and well-studied property for logic programs. However, almost all approa...
Our goal is to study the feasibility of porting termination analysis techniques developed for one pr...
Abstract. A technique for transformation f definite logic programs is presented. A first phase perfo...
Program transformation systems are applied both in program synthesis and in program optimization. Fo...
This paper describes an algorithm performing an analysis and transformation of logic programs. The t...
Program transformation systems are applied both in program synthesis and in program optimization. Fo...
We present an overview of the program transformation techniques which have been proposed over the pa...
We present an overview of the program transformation techniques which have been proposed over the pa...
this paper, from formal specifications one may obtain executable, efficient programs by using techni...
There are two kinds of approaches for termination analysis of logic programs: "transformational" and...
Our goal is to study the feasibility of porting termination analysis techniques developed for one pr...
This paper describes an algorithm performing an analysis and transformation of logic programs. The t...
Termination is an important and well-studied property for logic programs. However, almost all approa...
Our goal is to study the feasibility of porting termination analysis techniques developed for one pr...
Abstract. A technique for transformation f definite logic programs is presented. A first phase perfo...
Program transformation systems are applied both in program synthesis and in program optimization. Fo...
This paper describes an algorithm performing an analysis and transformation of logic programs. The t...
Program transformation systems are applied both in program synthesis and in program optimization. Fo...
We present an overview of the program transformation techniques which have been proposed over the pa...
We present an overview of the program transformation techniques which have been proposed over the pa...
this paper, from formal specifications one may obtain executable, efficient programs by using techni...
There are two kinds of approaches for termination analysis of logic programs: "transformational" and...
Our goal is to study the feasibility of porting termination analysis techniques developed for one pr...
This paper describes an algorithm performing an analysis and transformation of logic programs. The t...
Termination is an important and well-studied property for logic programs. However, almost all approa...
Our goal is to study the feasibility of porting termination analysis techniques developed for one pr...