David McAllester. On the Complexity Analysis of Static Analysis. In The 6th Static Analysis Symposium (SAS). LNCS 1694, Springer Verlag, 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Data Structures in the Succinct Solver (VI.0) - Sun, Nielson, Nielson (2002) (Correct)
....Least Fixed Point Logic (ALFP) in clausal form as the constraint specification language. This specification logic is more expressive than that either in BANE or in Datalog as pointed in [2] Formulas in ALFP naturally arise in the specification of static analyses of pro grams (c.f. 3] and [4]) On the other hand, the algorithm in the solver allows to be formulated in a succinct manner due to the use of continuation and memoi sation. Thus the behaviour of the solver can be characterized precisely and the complexity analysis can be developed formally and automatically as shown in [3] ....
....predicate INIT. 2The true clause One is added in the last line to ease the construction of clauses in the implementation. It is removed later on as shown in Fig. 11. o: L1 h xl 2: zl 3: yl 9: labQ reITab: 0:INIT 1 h FVAR 1 2:FLOW 2 3:RDKILL]3 4:RDGEN 3 5:RDIN 3 6:RDOUT 3 all: [0,1,2,3,4,5,6,7,8,9] n: 7 Fig. 9: Extracted static information 4.3 Solve.solve The function Solve.solve does mainly three tasks. It first initializes the two data structures result and infi. It secondly calls the function HornEnvPool.addPools to add pools for the memoisation of the disjunctions and existential ....
[Article contains additional citation context not shown here]
David McAllester. On the Complexity Analysis of Static Analysis. In The 6th Static Analysis Symposium (SAS). LNCS 1694, Springer Verlag, 1999.
Analysis of Large Code Bases: The Compile-Link-Analyze Model - Heintze (1999) (3 citations) (Correct)
.... backwards flows of information due to the use of equalities. Previous presentations of Andersen s algorithm have used some form of non standard type system. Our presentation uses a simple deductive reachability system. This style of analyses presentation was developed in 1996 by McAllester [14]. It was used for control flow analysis by Heintze and McAllester [12] To simplify our presentation, we consider a tiny language consisting of just the operations and . Expressions e have the form: e : x j x j x We shall assume that nested uses of and are removed by a preprocessing ....
D. McAllester, "On the Complexity Analysis of Static Analysis", Proc. Static Analysis Symposium, 1999.
Ultra-fast Aliasing Analysis using CLA: A Million Lines of C .. - Heintze, Tardieu (2001) (41 citations) (Correct)
....understand backwards flows of information due to the use of equalities. Previous presentations of Andersen s algorithm have used some form of non standard type system. Our presentation uses a simple deductive reachability system. This style of analyses presentation was developed by McAllester [20]. It has also been used to describe control flow analysis [18] To simplify our presentation, we consider a tiny language consisting of just the operations and . Expressions e have x Gamma y y Gamma e (if x = e in P ) star 1) x Gamma y e Gamma y (if e = x in P ) star 2) e1 ....
D. McAllester, "On the Complexity Analysis of Static Analysis", SAS, 1999.
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