M. Das, B. Liblit, M. Fahndrich, and J. Rehof. Estimating the impact of scalable pointer analysis on optimization. In Proc. Static Analysis Symposium, volume 2126 of LNCS, pages 260--278. Springer, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
CSSV: Towards a Realistic Tool for Statically Detecting All.. - Dor, Rodeh, Sagiv (2000) (12 citations) (Correct)
....presented. The algorithms reduce the burden on the programmer. They analyze the input procedure using existing (potentially vacuous) contracts and yield a new, more restrictive, contract for this procedure. We have implemented CSSV using the AST Tooklit [22] CoreC, the Golf pointer analysis [4, 5], and the polyhedra integer analysis of [3] from [14] We have applied the implementation to real life programs. CSSV veri ed an intricate string library from EADS Airbus yielding only 6 false alarms. In the application xwrites, part of web2c, CSSV uncovered 8 errors with 2 false alarms. Finally, ....
....The toy main procedure, shown in Fig. 3, calls SkipLine to insert a newline character, reads input from the stanvoid SkipLine(int NbLine, char PtrEndText) int indice; char PtrEndLoc; 1] indice=0; 2] begin loop: 3] if (indice =NbLine) goto end loop; 4] PtrEndLoc = PtrEndText [5] PtrEndLoc = nn ; 6] PtrEndText = PtrEndLoc 1; 7] indice = indice 1; 8] goto begin loop; 9] end loop: 10] PtrEndLoc = PtrEndText [11] PtrEndLoc = n0 ; g void main( char buf[SIZE] char r, s; 1] r = buf; 2] SkipLine(1, r) 3] fgets(r,SIZE 1,stdin) 4] s = r ....
[Article contains additional citation context not shown here]
M. Das, B. Liblit, M. Fahndrich, and J. Rehof. Estimating the impact of scalable pointer analysis on optimization. In Static Analysis Symp., 2001.
Pointer Analysis: Haven't We Solved This Problem Yet? - Hind (2001) (26 citations) (Correct)
....improves precision. So far the results have been mixed: context sensitivity did not improve precision for a common ow sensitive analysis [80] and a similar result has been shown for subset based ow insensitive analysis [26] and an extension of the equality based owinsensitive analysis [16]. However, context sensitivity has been shown to be bene cial for simpler equality based owinsensitive analysis [26] This latter result seems to validate the recent activity in partially context sensitive equalitybased analysis [55, 24, 72, 16] Other work [56, 58] attempts to recover ....
.... and an extension of the equality based owinsensitive analysis [16] However, context sensitivity has been shown to be bene cial for simpler equality based owinsensitive analysis [26] This latter result seems to validate the recent activity in partially context sensitive equalitybased analysis [55, 24, 72, 16]. Other work [56, 58] attempts to recover additional context in client analyses. The papers above used the direct precision metric, which has the limitations described in Section 3.2. Although these studies are extremely valuable, their generality should be con rmed in di erent environments, ....
[Article contains additional citation context not shown here]
M. Das, B. Liblit, M. Fahndrich, and J. Rehof. Estimating the impact of scalable pointer analysis on optimization. In Seventh International Static Analysis Symposium, July 2001.
Modular Static Program Analysis - Cousot, Cousot (2002) (8 citations) (Correct)
....analysis in object oriented languages [33] 9 Conclusion The wide range of program static analysis techniques that have been developed over the past two decades allows to analyze very large programs (over 1. 4 million lines of code) in a few seconds or minutes but with a very low precision [32] up to precise relational analyses which are able to analyze large programs (over 120 thousands lines of code) in a few hours or days [65] and to very detailed and precise analyzes that do not scale up for programs over a few hundred lines of code. If such static program analyses are to scale up ....
M. Das, B. Liblit, M. Fhndrich, and J. Rehof. Estimating the impact of scalable pointer analysis on optimization. In P. Cousot (ed), Proc. 8 LNCS 2126, 259277. Springer, 2001.
PSE: Explaining Program Failures via Postmortem.. - Manevich, Sridharan, .. (2004) Self-citation (Das) (Correct)
No context found.
Manuvir Das, Ben Liblit, Manuel Fahndrich, and Jakob Rehof. Estimating the Impact of Scalable Pointer Analysis on Optimization. In 8th International Symposium on Static Analysis, 2001.
ESP: Path-Sensitive Program Verification in Polynomial Time - Das, Lerner, Seigle (2002) (46 citations) Self-citation (Das) (Correct)
No context found.
M. Das, B. Liblit, M. Fahndrich, and J. Rehof. Estimating the Impact of Scalable Pointer Analysis on Optimization. In 8th International Symposium on Static Analysis, 2001.
Path-Sensitive Program Verification in Polynomial Time - Das, Lerner, Seigle (2002) (11 citations) Self-citation (Das) (Correct)
....but is linear in practice because of a simple caching technique explained in [Das00] While constructing the call graph, we also produce CFGs for all functions for use by the dataflow engine. b. Value flow computation. We run a scalable context sensitive flow insensitive points to analysis [DLFR01] to pro duce a conservative approximation of the flow of values in the program. Our value flow graph (VFG) maps every expression to a unique node in the graph, and answers value flow queries conservatively: if there is some run of the program in which the value of expression e flows to e , then ....
M. Das, B. Liblit, M. F&hndrich, and J. Rehof. Estimating the Impact of Scalable Pointer Analysis on Optimization. In 8th International Symposium on Static Analysis, 2001.
Speaking in Code: Cognitive Perspectives on the Role of Naming in .. - Liblit (2001) Self-citation (Liblit) (Correct)
....file. The visual metaphor is compelling enough to justify what would otherwise be derided as arbitrary overloading. 6 Conclusions and Future Work Modern software is fantastically complex. The source code to Microsoft Word 97, if typeset and printed like this paper, would run for 80,000 pages. [1] The Linux kernel weighs in at 120,000 pages. 13] Managing this kind of complexity requires that programmers draw deeply upon all their cognitive abilities. We have discussed several ways in which programmers select and use names in cognitively motivated ways. Lexical conventions convey basic ....
M. Das, B. Liblit, M. F'fihndrich, and J. Rehof. Estimating the impact of scalable pointer analysis on optimization. In SAS '01: The 8th International Static Analysis Symposium, 2001.
Efficient Field-Sensitive Pointer Analysis for C - David Pearce Imperial (Correct)
No context found.
M. Das, B. Liblit, M. Fahndrich, and J. Rehof. Estimating the impact of scalable pointer analysis on optimization. In Proc. Static Analysis Symposium, volume 2126 of LNCS, pages 260--278. Springer, 2001.
Compaction Algorithm for Precise Modular.. - Kim, Nystrom, Barnes.. (Correct)
No context found.
Manuvir Das, Ben Liblit, Manuel Fahndrich, and Jakob Rehof. Estimating the impact of scalable pointer analysis on optimization. In Proceedings of the Static Analysis Symposium, 2001.
Scalable, Precise Context-Sensitive Top-Down Process for - Modular Points-To Analysis (Correct)
No context found.
Manuvir Das, Ben Liblit, Manuel Fahndrich, and Jakob Rehof. Estimating the impact of scalable pointer analysis on optimization. In SAS, 2001.
The Set Constraint/CFL Reachability Connection in Practice - Kodumal, Aiken (2004) (1 citation) (Correct)
No context found.
M. Das, B. Liblit, M. Fahndrich, and J. Rehof. Estimating the Impact of Scalable Pointer Analysis on Optimization. In SAS '01: The 8th International Static Analysis Symposium, Lecture Notes in Computer Science, Paris, France, July 16--18 2001. Springer-Verlag.
Data Structure Analysis: A Fast and Scalable Context-Sensitive .. - Lattner, Adve (2003) (1 citation) (Correct)
No context found.
M. Das, B. Liblit, M. Fahndrich, and J. Rehof. Estimating the impact of scalable pointer analysis on optimization. In SAS '01: The 8th International Static Analysis Symposium,, July 2001.
Cloning-Based Context-Sensitive Pointer Alias Analysis Using.. - Whaley, Lam (2004) (7 citations) (Correct)
No context found.
M. Das, B. Liblit, M. F ahndrich, and J. Rehof. Estimating the impact of scalable pointer analysis on optimization. In Proceedings of the 8th International Static Analysis Symposium, pages 260--278, July 2001.
Precise and Efficient Static Array Bound Checking for Large.. - Venet, Brat (2004) (Correct)
No context found.
M. Das, B. Liblit, M. Fahndrich, and J. Rehof. Estimating the impact of scalable pointer analysis on optimization. In Proceedings of 8th International Static Analyses Symposium (SAS'01), pages 260--278, 2001.
Cloning-Based Context-Sensitive Pointer Alias Analysis Using.. - Whaley, Lam (2004) (7 citations) (Correct)
No context found.
M. Das, B. Liblit, M. F ahndrich, and J. Rehof. Estimating the impact of scalable pointer analysis on optimization. In Proceedings of the 8th International Static Analysis Symposium, pages 260--278, July 2001.
Static Program Analysis via 3-Valued Logic - Thomas Reps Mooly (2004) (2 citations) (Correct)
No context found.
M.Das, Liblit, B., Fahndrich, M., Rehof, J.: Estimating the impact of scalable pointer analysis on optimization. In: Static Analysis Symp. (2001) 260--278
Efficient Field-Sensitive Pointer Analysis for C - Pearce, Kelly, Hankin (2004) (Correct)
No context found.
M. Das, B. Liblit, M. Fahndrich, and J. Rehof. Estimating the impact of scalable pointer analysis on optimization. In Proc. Static Analysis Symposium, volume 2126 of LNCS, pages 260--278. Springer, 2001.
Precise and Practical Flow Analysis of Object-Oriented Software - Milanova (2003) (Correct)
No context found.
M. Das, B. Liblit, M. Fahndrich, and J. Rehof. Estimating the impact of scalable pointer analysis on optimization. In Static Analysis Symposium, 2001.
Data Structure Analysis: A Fast and Scalable Context-Sensitive .. - Lattner, Adve (2003) (1 citation) (Correct)
No context found.
M. Das, B. Liblit, M. Fahndrich, and J. Rehof. Estimating the impact of scalable pointer analysis on optimization. In 8th Int'l Static Analysis Symp.,, 2001.
Context Sensitivity for Points-to Analysis - Using Annotated Inclusion (Correct)
No context found.
M. Das, B. Liblit, M. Fahndrich, and J. Rehof. Estimating the impact of scalable pointer analysis on optimization. In SAS, pages 260--278, 2001.
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