Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

LOPSTR
1994
Springer

favoriteEmaildiscussreport

98views Automated Reasoning» more LOPSTR 1994»

Using Call/Exit Analysis for Logic Program Transformation

13 years 8 months ago

Using Call/Exit Analysis for Logic Program Transformation

Download lirias.kuleuven.be

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 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.

Dmitri Boulanger, Maurice Bruynooghe

Real-time Traffic

Automated Reasoning | Call/exit Patterns | Definite Logic Programs | LOPSTR 1994 | Source Program |

claim paper

Related Content

» Proof Theory Transformations and Logic Programming for Debugging Security Protocols

» Verification of Java Bytecode using Analysis and Transformation of Logic Programs

» Determinacy Analysis for Logic Programs Using Mode and Type Information

» Demand Transformation Analysis for Concurrent Constraint Programs

» Simple relational correctness proofs for static analyses and program transformations

» The Dependency Triple Framework for Termination of Logic Programs

» Logical Interpretation Static Program Analysis Using Theorem Proving

» Incremental execution of transformation specifications

» Behavioral similarity matching using concrete source code templates in logic queries

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1994
Where	LOPSTR
Authors	Dmitri Boulanger, Maurice Bruynooghe

Comments (0)