Program Analysis and Specialization for the C Programming Language
By L. O. Andersen, Peter Lee. 2005
1,179 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/b7efe971a34a0f2482e0b2520ffb31062dcdde62
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Li Li
- P. Akritidis
- Tégawendé F. Bissyandé
- Mike Papadakis
- Donald Nguyen
- Manuel Costa
- Siegfried Rasthofer
- Alexandre Bartel
Citations in the corpus
- Apposcopy: semantics-based detection of Android malware through static analysis (2014, methodology): “Since the precision of the underlying pointer analysis is critical for detecting malware with few false alarms, we use a field-and context-sensitive Andersen-style pointer analysis [7].”
- The New C Standard (Excerpted material) An Economic and Cultural Commentary (2008, unknown): “A number of algorithms for deducing the set of objects that a pointer could be pointing to, at any point in a program, have been proposed.[ 2 , 12, 13] Unfortunately, for all but the smallest programs, they require large amounts of memory and processor time.”
- SVF: interprocedural static value-flow analysis in LLVM (2016, methodology): “, Wave [31] and applying transitive closure rules [1] on an inclusion-based constraint graph.”
- Securing software by enforcing data-flow integrity (2006, methodology): “We implemented Andersen’s pointsto analysis [9] to compute the set of objects that each pointer can point to, and we use these points-to sets to compute reaching definitions.”
- Inference and Evolution of TypeScript Declaration Files (2017, background): “This is perhaps counterintuitive for readers familiar with Andersen-style [1] (subset-based) and Steengaard-style [20] (unificationbased) pointer analysis for e.g.”
- Software model checking (2009, unknown): “the precision-scalability spectrum [Andersen 1994; Steensgard 1996; Hind 2001; Whaley and Lam 2004; Hardekopf and Lin 2007].”
- Locating Features in Source Code (2003, background): “There is a large body of work on pointer analysis for procedural languages [10], [11], [12], [13], [14], [15], [16], [16] and object-oriented languages [18], [19] that resolves general pointers, function pointers, and dynamic binding.”
- Static analysis of android apps: A systematic literature review (2017, methodology): “For Java programs, a number of popular algorithms have been proposed, including CHA [15], RTA [16], VTA [17], Andersen [18], Steensguard [19], etc.”
- Interprocedural compatibility analysis for static object preallocation (2003, background): “Using a full-fledged, flow-sensitive pointer analysis would substantially increase the time and space requirements of our analysis; a flow-insensitive pointer analysis [18, 5] would not provide sufficient precision since liveness is essentially a flow-sensitive property.”
- Information Flow Analysis of Android Applications in DroidSafe (2015, methodology): “Our PTA algorithm is based on a whole-program, flowinsensitive, subset-based foundation [25] for Java on which we have added context sensitivity.”
- A survey of mobile cloud computing: architecture, applications, and approaches (2013, methodology): “The program abstraction is generated at a runtime based on pointer analysis techniques [72], [73].”
- A Survey of Automated Techniques for Formal Software Verification (2008, background): “If certain mathematical constraints between the abstract and concrete domains are met, fixed points computed in an abstract domain are guaranteed to be sound approximations of concrete fixed points [47].”
- Preventing Memory Error Exploits with WIT (2008, methodology): “We use an inter-proceduralpoints-to analysis due to Andersen [ 8 ] that is flow and context insensitive but scales to large programs.”
- The tao of parallelism in algorithms (2011, methodology): “Andersen-style inclusion-based points-to analysis: This compiler algorithm [3] is an example of a refinement morph on general graphs.”
- Refinement-based context-sensitive points-to analysis for Java (2006, unknown): “The numbers include the reachable portions of the Java library, determining using a call graph constructed on the fly with Andersen’s analysis [3] by Spark [20].”