R. Paige and S. Koenig. Finite di erencing of computable expressions. ACM Trans. on Programming Languages and Systems, 4(3):401-454, 1982. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Language Theoretic Approach to Algorithm and Software Development - Goyal (1999) (Correct)
....a statically typed superset of Low SETL augmented with many abstract operations such as set comprehension, quanti cation, and a variety of operations on binary relations. High SETL is implemented in terms of Low 1 SETL either by direct transformation, or by using nite di erencing transformations [10] in which repetitive computation of costly High SETL expressions is replaced by their more inexpensive incremental counterparts. Finally, SQ2 is a statically typed functional subset of High SETL augmented with least and greatest xed points, which are transformed into High SETL using the ....
....why it works. This problem of computing a xed point of a system of equations can be expressed in SQ2 , our highest level abstract speci cation language. We show how a simple program transformational methodology, along with well established program transformational tools like nite di erencing [10], and dominated convergence [8] can be used to transform this SQ2 speci cation into a simple and elegant linear time algorithm. Moreover, the transformational process provides valuable insight into the workings of the algorithm proposed by Arnold and Crubille, which turns out to be based on the ....
R. Paige and S. Koenig. Finite di erencing of computable expressions. ACM Trans. on Programming Languages and Systems, 4(3):401-454, 1982.
An Improved Intra-procedural May-alias Analysis Algorithm - Goyal (1999) (2 citations) (Correct)
....based algorithm is O(N 5 ) time. 3.3 Going Beyond the Worklist Strategy The goal of using worklists is to eliminate needless re computation of Out(k) whenever In(k) does not change for an SEG node k. The same idea can be extended to further improve the algorithm by using nite di erencing ([13]) to compute Out(k) incrementally for small changes to In(k) The bene t of this strategy stems from the fact that although the computation of Out(k) f k (In(k) from scratch may be quite expensive, the incremental computation of Out(k) for a small incremental change in the value of In(k) may ....
R. Paige and S. Koenig. Finite di erencing of computable expressions. ACM Trans. on Programming Languages and Systems, 4(3):401-454, 1982.
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