Andrei Sabelfeld  Home/Search
Context Related
| cs.chalmers.se/~andrei/./andrei.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.chalmers.se/~andrei/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper describes a system of transformations that preserves the semantics of logic programs with respect to a fixed goal. We formalise some standard transformations and introduce two new transformation rules: Copying/Merge of Copies and Contextual Replacement by Equal Term. Correctness of all schemes of the transformation rules is proved. The applicability conditions of the schemes of rules are effectively decidable, that makes it useful for application in practice. Since some... (Update)
Context of citations to this paper: More
.... schema guided program construction [8] and program transformation [15] e.g. approaches for re nement [13] or aiming at optimization [18]. To preserve semantics is the central demand in this context. We emphasize our goal to support design in a more abstract sense compared to...
Cited by: More
Composition based on Meta-Programming - Lämmel (1997) (Correct)
Active bibliography (related documents): More All
0.5: Equivalent Transformations of Recursive Programs with.. - Sabelfeld, Sabelfeld (1997) (Correct)
0.4: Advanced Techniques for Logic Program Specialisation - Leuschel (1997) (Correct)
0.3: Automatic Derivation of Logic Programs by Transformation - Pettorossi, Proietti (2000) (Correct)
Similar documents based on text: More All
0.4: A Note on the Exhaustiveness of SLDNF-Resolution for Normal.. - De Giacomo (Correct)
0.3: The Impact of Synchronisation on Secure Information Flow in.. - Sabelfeld (2001) (Correct)
0.3: A Model for Delimited Information Release - Sabelfeld, Myers (2004) (Correct)
BibTeX entry: (Update)
A. Sabelfeld. Correct Transformation of Logic Programs. In Haveraaen and Owe [10]. http://citeseer.ist.psu.edu/257609.html More
@misc{ sabelfeld-correct,
author = "A. Sabelfeld",
title = "Correct Transformation of Logic Programs",
text = "A. Sabelfeld. Correct Transformation of Logic Programs. In Haveraaen and
Owe [10].",
url = "citeseer.ist.psu.edu/257609.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
139 fold transformation of logic programs (context) - Tamaki, Sato - 1984
32 ACM Transactions on Programming Languages and Systems (context) - Bossi, Etalle et al. - 1994
22 Preserving universal termination through unfold/fold (context) - Bossi, Cocco - 1994
3 Correctness of Logic Program Transformations Based on Existe.. - Lau, Ornaghi et al. - 1995
2 Theory of program schemes (context) - Kotov, Sabelfeld - 1991
Documents on the same site (http://www.cs.chalmers.se/~andrei/): More
Probabilistic Noninterference for Multi-threaded Programs - Sands (1999) (Correct)
A PER Model of Secure Information Flow in Sequential Programs - Sabelfeld, Sands (1999) (Correct)
Forwards and Backwards Analysis for Functional Programs - Andrei Sabelfeld (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC