David Sands  @ NUS Home/Search
Context Related
| diku.dk/diku/semantics/pa...D221.ps.gz Cached: PS.gz PS PDF Image Update Help From: diku.dk/researchgroups/to...1995 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The goal of program transformation is to improve efficiency while preserving meaning. One of the best known transformation techniques is Burstall and Darlington's unfold-fold method. Unfortunately the unfold-fold method itself guarantees neither improvement in efficiency nor total-correctness. The correctness problem for unfold-fold is an instance of a strictly more general problem: transformation by locally equivalence-preserving steps does not necessarily preserve (global) equivalence. This... (Update)
Context of citations to this paper: More
.... but their use must be closely controlled in order to ensure the operational equivalence of the transformed program [San95b, San95c] Folding can alter the recursive structure of a program. Applying the folding step carelessly may result in a loss of termination in the...
.... programs defined by denotational semantics [1, 6, 15, 20, 31, 35, 42, 51, 45, 46, 47] and structural operational semantics [13, 24, 56, 57, 58, 59, 66]. Model checking is another important applications area [8, 17, 18, 63, 64] In this paper, we survey abstract interpretation...
Cited by: More
A Constraint-based Partial Evaluator for Functional - Logic Programs And (Correct)
An efficient APSP algorithm - Lavallee, Bui, Quoc (2004) (Correct)
Transformation And Analysis Of (constraint) Logic Programs - Etalle (1995) (Correct)
Similar documents (at the sentence level):
30.2%: Total Correctness by Local Improvement in the Transformation of.. - Sands (1996) (Correct)
9.1%: Proving the Correctness of Recursion-Based Automatic Program.. - Sands (1995) (Correct)
Active bibliography (related documents): More All
1.9: Higher-Order Expression Procedures - Sands (1995) (Correct)
0.7: Transformation of Logic Programs - Pettorossi, Proietti (1998) (Correct)
0.6: Sharing of Computations - Amtoft (1993) (Correct)
Similar documents based on text: More All
0.2: Automatic, Self-adaptive Control of Unfold-Fold Transformations - James Boyle (Correct)
0.2: Unfold/Fold Transformation - Secher (2001) (Correct)
0.2: Unfold/Fold Transformations of Concurrent Processes - De Francesco, Santone (Correct)
Related documents from co-citation: More All
19: Deforestation: transforming programs to eliminate trees - Wadler - 1990
13: A transformation system for developing recursive programs - Burstall, Darlington - 1977
12: Proving the correctness of recursion-based automatic program transformation - Sands - 1995
BibTeX entry: (Update)
D. Sands. Total correctness by local improvement in program transformation. In Conference Record of the Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 221--232. ACM Press, 1995. http://citeseer.comp.nus.edu.sg/118569.html More
@article{ sands95total,
author = "D. Sands",
title = "Total correctness by local improvement in program transformation",
pages = "221--232",
publisher = "ACM Press",
year = "1995",
booktitle = "Conference Record of the Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages",
url = "citeseer.comp.nus.edu.sg/118569.html" }
Citations (may not include all citations):1933 Communication and Concurrency (context) - Milner - 1989
638 Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
385 A transformation system for developing recursive programs - Burstall, Darlington - 1977
324 Deforestation: transforming programs to eliminate trees - Wadler - 1990
283 Theoretical Computer Science (context) - Plotkin, Call-by-value et al. - 1975
179 The lazy lambda calculus - Abramsky - 1990
139 fold transformation of logic programs (context) - Tamaki, Sato - 1984
129 Transformation of logic programs: Foundations and techniques (context) - Pettorossi, Proietti - 1993
94 Equality in lazy computation systems - Howe - 1989
75 A syntactic theory of sequential control (context) - Felleisen, Friedman et al. - 1987
57 The concept of a supercompiler (context) - Turchin - 1986
53 Using circular programs to eliminate multiple traversals of .. (context) - Bird - 1984
49 Specifying the correctness of binding time analysis (context) - Wand - 1993
31 A self-applicable partial evaluator for the lambda calculus:.. (context) - Gomard - 1992
31 Correctness of binding time analysis - Palsberg - 1993
27 Equivalences and transformations of regular systems---applic.. (context) - Courcelle - 1986
24 fold transformations of logic programs (context) - Gardner, Shepherdson - 1991
23 Semantics preserving transformation rules for Prolog (context) - Proietti, Pettorossi - 1991
21 fold transformation of general logic programs for the well-f.. (context) - Seki - 1993
20 An equivalence preserving first order unfold/fold transforma.. (context) - Sato - 1990
19 A naive time analysis and its theory of cost equivalence (context) - Sands - 1993
16 Transforming normal programs by replacement (context) - Bossi, Cocco et al. - 1992
13 Operational theories of improvement in functional languages - Sands - 1991
13 About transformation system: A theoretical study (context) - Kott - 1978
10 Total correctness and improvement in the transformation of f.. (context) - Sands - 1994
10 Fully abstract models of the typed - calculus (context) - Milner - 1977
9 fold transformation of logic programs with counters (context) - Kanamori, Fujita - 1986
9 Rewriting techniques for program synthesis (context) - Reddy - 1989
7 On safe folding (context) - Bossi, Cocco et al. - 1992
7 Transformation in a non-strict language: An approach to inst.. - Runciman, Firth et al. - 1989
7 Expression Procedures and Program Derivation (context) - Scherlis - 1980
7 fold transformations preserving termination properties (context) - Amtoft - 1992
4 fold transformations (context) - Kott - 1985
4 Recursion induction principle revisited (context) - Boudol, Kott - 1983
3 line and off-line partial evaluation: Semantic specification.. (context) - Consel, Khoo - 1993
2 Program improvement by internal specialisation (context) - Scherlis - 1981
2 Transactions on Programming Languages and Systems (context) - Manna, Waldinger et al. - 1979
2 A system for proving equivalences of recursive programs (context) - Kott - 1980
1 Infinite trees in normal form and recursive equations having.. (context) - Courcell - 1979
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.diku.dk/research-groups/topps/bibliography/1995.html): More
Combinatory Reduction Systems with Explicit Substitution - Rose (1996) (Correct)
What is a "Pointer Machine"? - Ben-Amram (1995) (Correct)
Higher-Order Expression Procedures - Sands (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.