S. L. Peyton Jones and C. Clack, Finding Fixed Points in Abstract Interpretation, in S. Abramsky and C. L. Hankin (eds), Abstract Interpretation of Declarative Languages, Ellis Horwood, 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....inclusion of the most advanced techniques in compilers. The most significant contributions for improving the efficiency of abstract interpretation include widening techniques [9, 14] chaotic iteration sequences [8, 34] and the related minimal function graphs [25] and frontiers based algorithms [33, 21]. The latter has unacceptable performance for some commonly occurring higher order programs. The first two are general approaches for accelerating convergence in fixed point computations. In contrast to abstract interpretation, type inference systems are routinely implemented as part of ....

S. L. Peyton Jones and C. Clack, Finding Fixed Points in Abstract Interpretation, in S. Abramsky and C. L. Hankin (eds), Abstract Interpretation of Declarative Languages, Ellis Horwood, 1987.

....The extension to n ary functions with basic type results is relatively straightforward. The extension to functions with more complex result types is possible, but rather complex (see [13] for the encodings required) In this algorithm, the set Sigma is used to store the current trial 0 frontier [17]. Initially, it is empty and initabs selects the only candidate point. At the end of each iteration, either the last type corresponds to a frontier type (the result is f) and the set is unchanged, or it doesn t and the next lowest elements (preds) are added to the set. The process terminates ....

S. L. Peyton Jones and C. Clack, Finding Fixed Points in Abstract Interpretation, in S. Abramsky and C. L. Hankin (eds), Abstract Interpretation of Declarative Languages, Ellis Horwood, 1987.

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