T.-R. Chuang and B. Goldberg, A syntactic approach to fixed point computation on finite domains, in Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, ACM Press, 1992.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....yet identified worst case examples for our approach. 9 Conclusions The problem of designing efficient algorithms for strictness analysis has received much attention recently and one current trend seems to revert from the usual extensional approach to more intensional or syntactic techniques [26, 28, 23, 7, 12, 32]. The key observation underlying these works is that the choice of representing abstract functions by functions can be disastrous in terms of efficiency and is not always justified in terms of accuracy. Some of these proposals trade a cheaper implementation against a loss of accuracy [26, 28] In ....

T.-R. Chuang and B. Goldberg, A syntactic approach to fixed point computation on finite domains, in Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, ACM Press, 1992.

....of [SCA93, SC94] As reported previously, this is a very effective optimization. It was also the first interprocedural update analysis to run in polynomial time. As originally presented, this algorithm s efficiency depended upon a special technique for symbolic computation of a least fixed point [CG92]. In the reformulated algorithm, the generated set constraints are easily seen to be data flow inequalities, which can be solved in polynomial time using standard techniques [AKVW93] 1.2 Proof architecture We use a small step operational semantics. We assume that for each program E, there are ....

T. Chuang and B. Goldberg. A syntactic approach to fixed point computation on finite domains. In Proc. 1992 ACM Symposium on Lisp and Functional Programming, pages 109--118, 1992.

....frontiers optimisation can be described as a particular restriction on types. The main technical contribution of the paper is the notion of lazy types and the corresponding type system and algorithm. This addresses an issue that has taxed the abstract interpretation community greatly. The papers [4, 5, 7, 8, 9, 13, 16, 18] all tackle the same issue. The basic problem is that the choice to abstract functions by functions is a disastrous one for the efficiency of the analysis. We can classify the various proposals to circumvent the problem into two categories: 1) some of them [4, 8, 13, 16] strive for a better ....

....The papers [4, 5, 7, 8, 9, 13, 16, 18] all tackle the same issue. The basic problem is that the choice to abstract functions by functions is a disastrous one for the efficiency of the analysis. We can classify the various proposals to circumvent the problem into two categories: 1) some of them [4, 8, 13, 16] strive for a better representation of abstract functions to improve their computation without losing completeness (with respect to the system of Section 2) while (2) others [6, 7, 9, 18] trade a cheaper implementation of the fixed point against a loss of accuracy. Our algorithm falls into the ....

T.-R. Chuang and B. Goldberg, A syntactic approach to fixed point computation on finite domains, in Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, ACM Press, 1992.

....paper we use set constraints to reformulate an algorithm for interprocedural array update optimization in a call by value functional language. As originally presented in [SCA93, SC94] this algorithm s efficiency depended upon a special technique for symbolic computation of a least fixed point [CG92]. The set constraints generated by the reformulated algorithm are easily seen to be data flow inequalities, which can be solved in polynomial time using standard techniques [AKVW93] We also state theorems that assert the correctness of this optimization. In an advance over previous work, we have ....

T. Chuang and B. Goldberg. A syntactic approach to fixed point computation on finite domains. In Proc. 1992 ACM Symposium on Lisp and Functional Programming, pages 109--118, 1992.

....order functions using program transformation techniques as described in [6] for example. We are currently investigating various possible extensions aimed at dealing explicitly with data structures and higher order functions. Some progress has been made in this direction by Chuang and Goldberg [7]. They describe a syntactic approach to fixpoint computation also based on symbolic evaluation. Although their approach deals with higher order programs, the language is very restricted. It is not clear how their work could be extended to a full functional language with data structures. Finally, ....

T-R. Chuang and B. Goldberg. A syntactic approach to fixed point computation on finite domains. In ACM Conference on Lisp and Functional Programming, pages 109--118, 1992.

.... of the proof is very similar to the previous one) 7 Conclusions The problem of designing efficient algorithms for strictness analysis has received much attention recently and one current trend seems to revert from the usual extensional approach to more intensional or syntactic techniques [20, 21, 18, 6, 10, 24]. The key observation underlying these works is that the choice of representing abstract functions by functions can be disastrous in terms of efficiency and is not always justified in terms of accuracy. Some of these proposals trade a cheaper implementation against a loss of accuracy [20, 21] The ....

T.-R. Chuang and B. Goldberg, A syntactic approach to fixed point computation on finite domains, in Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, ACM Press, 1992.

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