Using call/exit analysis for logic program transformation | Zendy

Dmitri Boulanger | Zendy; Maurice Bruynooghe | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Using call/exit analysis for logic program transformation

Author(s) -

Dmitri Boulanger,

Maurice Bruynooghe

Publication year - 1994

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-58792-6

DOI - 10.1007/3-540-58792-6_3

Subject(s) - computer science , transformation (genetics) , logic program , program transformation , program analysis , algorithm , theoretical computer science , programming language , logic programming , biochemistry , chemistry , gene

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research