More Web Proxy on the site http://driver.im/

article

Pointer Analysis

Authors:

Yannis Smaragdakis,

George BalatsourasAuthors Info & Claims

Foundations and Trends in Programming Languages, Volume 2, Issue 1

Pages 1 - 69

https://doi.org/10.1561/2500000014

Published: 01 April 2015 Publication History

Abstract

Pointer analysis is a fundamental static program analysis, with a rich literature and wide applications. The goal of pointer analysis is to compute an approximation of the set of program objects that a pointer variable or expression can refer to. We present an introduction and survey of pointer analysis techniques, with an emphasis on distilling the essence of common analysis algorithms. To this end, we focus on a declarative presentation of a common core of pointer analyses: algorithms are modeled as configurable, yet easy-to-follow, logical specifications. The specifications serve as a starting point for a broader discussion of the literature, as independent threads spun from the declarative model.

References

[1]

Ole Agesen. The cartesian product algorithm: Simple and precise type inference of parametric polymorphism. In Proc. of the 9th European Conf. on Object-Oriented Programming, ECOOP '95, pages 2-26. Springer, 1995. ISBN 3-540-60160-0.

[2]

Alfred V. Aho, Monica S. Lam, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques, and Tools (2nd Edition). Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2006. ISBN 0321486811.

Digital Library

[3]

Lars O. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen, May 1994.

[4]

David F. Bacon and Peter F. Sweeney. Fast static analysis of C++ virtual function calls. In Proc. of the 11th Annual ACM SIGPLAN Conf. on Object Oriented Programming, Systems, Languages, and Applications, OOPSLA '96, pages 324-341, New York, NY, USA, 1996. ACM. ISBN 0-89791-788-X.

[5]

Gogul Balakrishnan and Thomas W. Reps. Recency-abstraction for heap-allocated storage. In Proc. of the 14th International Symp. on Static Analysis, SAS '06, pages 221-239. Springer, 2006.

Digital Library

[6]

Marc Berndl, Ondrej Lhoták, Feng Qian, Laurie J. Hendren, and Navindra Umanee. Points-to analysis using BDDs. In Proc. of the 2003 ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '03, pages 103-114, New York, NY, USA, 2003. ACM. ISBN 1-58113-662-5.

Digital Library

[7]

Martin Bravenboer and Yannis Smaragdakis. Strictly declarative specification of sophisticated points-to analyses. In Proc. of the 24th Annual ACM SIGPLAN Conf. on Object Oriented Programming, Systems, Languages, and Applications, OOPSLA '09, New York, NY, USA, 2009a. ACM. ISBN 978-1-60558-766-0.

Digital Library

[8]

Martin Bravenboer and Yannis Smaragdakis. Exception analysis and points to analysis: Better together. In Proc. of the 18th International Symp. on Software Testing and Analysis, ISSTA '09, pages 1-12, New York, NY, USA, 2009b. ACM. ISBN 978-1-60558-338-9.

Digital Library

[9]

Ramkrishna Chatterjee, Barbara G. Ryder, and William A. Landi. Relevant context inference. In Proc. of the 26th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL '99, pages 133-146. ACM, 1999. ISBN 1-58113-095-3.

Digital Library

[10]

Ben-Chung Cheng and Wen-Mei W. Hwu. Modular interprocedural pointer analysis using access paths: Design, implementation, and evaluation. In Proc. of the 2000 ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '00, pages 57-69, New York, NY, USA, 2000. ACM. ISBN 1-58113-199-2.

[11]

Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, pages 238-252, 1977.

Digital Library

[12]

Patrick Cousot and Radhia Cousot. Systematic design of program analysis frameworks. In POPL '79: Proceedings of the 6th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 269-282, 1979.

Digital Library

[13]

Jeffrey Dean, David Grove, and Craig Chambers. Optimization of object-oriented programs using static class hierarchy analysis. In Proc. of the 9th European Conf. on Object-Oriented Programming, ECOOP '95, pages 77-101. Springer, 1995. ISBN 3-540-60160-0.

[14]

Isil Dillig, Thomas Dillig, and Alex Aiken. Sound, complete and scalable path-sensitive analysis. In Proc. of the 2008 ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '08, pages 270-280, New York, NY, USA, 2008. ACM. ISBN 978-1-59593-860-2.

Digital Library

[15]

Michael Eichberg, Sven Kloppenburg, Karl Klose, and Mira Mezini. Defining and continuous checking of structural program dependencies. In Proc. of the 30th International Conf. on Software Engineering, ICSE '08, pages 391-400, New York, NY, USA, 2008. ACM. ISBN 978-1-60558-079-1.

Digital Library

[16]

Maryam Emami, Rakesh Ghiya, and Laurie J. Hendren. Context-sensitive interprocedural points-to analysis in the presence of function pointers. In Proc. of the 1994 ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '94, pages 242-256, New York, NY, USA, 1994. ACM. ISBN 0-89791-662-X.

[17]

Manuel Fähndrich, Jeffrey S. Foster, Zhendong Su, and Alexander Aiken. Partial online cycle elimination in inclusion constraint graphs. In Proc. of the 1998 ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '98, pages 85-96, New York, NY, USA, 1998. ACM. ISBN 0-89791-987-4.

Digital Library

[18]

Chen Fu and Barbara G. Ryder. Exception-chain analysis: Revealing exception handling architecture in Java server applications. In Proc. of the 29th International Conf. on Software Engineering, ICSE '07, pages 230-239, Washington, DC, USA, 2007. IEEE Computer Society. ISBN 0-7695-2828-7.

[19]

Samuel Z. Guyer and Calvin Lin. Client-driven pointer analysis. In Proc. of the 10th International Symp. on Static Analysis, SAS '03, pages 214-236. Springer, 2003. ISBN 3-540-40325-6.

[20]

Elnar Hajiyev, Mathieu Verbaere, and Oege de Moor. CodeQuest: Scalable source code queries with Datalog. In Proc. of the 20th European Conf. on Object-Oriented Programming, ECOOP '06, pages 2-27. Springer, 2006. ISBN 978-3-540-35726-2.

[21]

Ben Hardekopf and Calvin Lin. The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code. In Proc. of the 2007 ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '07, pages 290-299, New York, NY, USA, 2007a. ACM. ISBN 978-1-59593-633-2.

Digital Library

[22]

Ben Hardekopf and Calvin Lin. Exploiting pointer and location equivalence to optimize pointer analysis. In Proc. of the 14th International Symp. on Static Analysis, SAS '07, pages 265-280. Springer, 2007b. ISBN 978-3-540-74060-5.

[23]

Nevin Heintze and Olivier Tardieu. Ultra-fast aliasing analysis using CLA: A million lines of C code in a second. In Proc. of the 2001 ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '01, pages 254-263, New York, NY, USA, 2001a. ACM. ISBN 1-58113-414-2.

Digital Library

[24]

Nevin Heintze and Olivier Tardieu. Demand-driven pointer analysis. In Proc. of the 2001 ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '01, pages 24-34, New York, NY, USA, 2001b. ACM. ISBN 1-58113-414-2.

Digital Library

[25]

Michael Hind. Pointer analysis: haven't we solved this problem yet? In Proc. of the 3rd ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, PASTE '01, pages 54-61, New York, NY, USA, 2001. ACM. ISBN 1-58113-413-4.

Digital Library

[26]

Susan Horwitz. Precise flow-insensitive may-alias analysis is NP-hard. ACM Trans. Program. Lang. Syst., 19(1):1-6, January 1997. ISSN 0164-0925.

Digital Library

[27]

Neil Immerman. Descriptive Complexity. Graduate texts in computer science. Springer, 1999. ISBN 978-1-4612-6809-3.

[28]

Vini Kanvar and Uday P. Khedker. Heap abstractions for static analysis. CoRR, abs/1403.4910, 2014. URL http://arxiv.org/abs/1403.4910.

[29]

George Kastrinis and Yannis Smaragdakis. Efficient and effective handling of exceptions in Java points-to analysis. In Proc. of the 22nd International Conf. on Compiler Construction, CC '13, pages 41-60. Springer, 2013a. ISBN 978-3-642-37050-2.

Digital Library

[30]

George Kastrinis and Yannis Smaragdakis. Hybrid context-sensitivity for points-to analysis. In Proc. of the 2013 ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '13, New York, NY, USA, 2013b. ACM. ISBN 978-1-4503-2014-6.

Digital Library

[31]

Monica S. Lam, John Whaley, V. Benjamin Livshits, Michael C. Martin, Dzintars Avots, Michael Carbin, and Christopher Unkel. Context-sensitive program analysis as database queries. In Proc. of the 24th Symp. on Principles of Database Systems, PODS '05, pages 1-12, New York, NY, USA, 2005. ACM. ISBN 1-59593-062-0.

Digital Library

[32]

William Landi. Undecidability of static analysis. LOPLAS, 1(4):323-337, 1992.

Digital Library

[33]

William Landi and Barbara G. Ryder. A safe approximate algorithm for interprocedural aliasing. In Proc. of the 1992 ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '92, pages 235-248, New York, NY, USA, 1992. ACM. ISBN 0-89791-475-9.

Digital Library

[34]

Ond¿ej Lhoták. Program Analysis using Binary Decision Diagrams. PhD thesis, McGill University, January 2006.

[35]

Ond¿ Lhoták and Laurie J. Hendren. Evaluating the benefits of context-sensitive points-to analysis using a BDD-based implementation. ACM Trans. Softw. Eng. Methodol., 18(1):1-53, 2008. ISSN 1049-331X.

Digital Library

[36]

Yue Li, Tian Tan, Yulei Sui, and Jingling Xue. Self-inferencing reflection resolution for Java. In Proc. of the 28th European Conf. on Object-Oriented Programming, ECOOP '14, pages 27-53. Springer, 2014. ISBN 978-3-662-44201-2.

Digital Library

[37]

Percy Liang and Mayur Naik. Scaling abstraction refinement via pruning. In Proc. of the 2011 ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '11, pages 590-601, New York, NY, USA, 2011. ACM. ISBN 978-1-4503-0663-8.

Digital Library

[38]

Benjamin Livshits. Improving Software Security with Precise Static and Runtime Analysis. PhD thesis, Stanford University, December 2006.

Digital Library

[39]

Benjamin Livshits, John Whaley, and Monica S. Lam. Reflection analysis for Java. In Proc. of the 3rd Asian Symp. on Programming Languages and Systems, APLAS '05, pages 139-160. Springer, 2005. ISBN 3-540-29735-9.

Digital Library

[40]

Benjamin Livshits, Manu Sridharan, Yannis Smaragdakis, Ond¿ej Lhoták, J. Nelson Amaral, Bor-Yuh Evan Chang, Samuel Z. Guyer, Uday P. Khedker, Anders Møller, and Dimitrios Vardoulakis. In defense of soundiness: A manifesto. Commun. ACM, 58(2):44-46, January 2015. ISSN 0001-0782. URL http://doi.acm.org/10.1145/2644805.

Digital Library

[41]

Magnus Madsen, Benjamin Livshits, and Michael Fanning. Practical static analysis of Java Script applications in the presence of frameworks and libraries. In Proc. of the ACM SIGSOFT International Symp. on the Foundations of Software Engineering, FSE '13, pages 499-509. ACM, 2013. ISBN 978-1-4503-2237-9.

[42]

Matthew Might, Yannis Smaragdakis, and David Van Horn. Resolving and exploiting the k-CFA paradox: Illuminating functional vs. object-oriented program analysis. In Proc. of the 2010 ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '10, pages 305-315, New York, NY, USA, 2010. ACM. ISBN 978-1-4503-0019-3.

Digital Library

[43]

Ana Milanova, Atanas Rountev, and Barbara G. Ryder. Parameterized object sensitivity for points-to and side-effect analyses for Java. In Proc. of the 2002 International Symp. on Software Testing and Analysis, ISSTA '02, pages 1-11, New York, NY, USA, 2002. ACM. ISBN 1-58113-562-9.

Digital Library

[44]

Ana Milanova, Atanas Rountev, and Barbara G. Ryder. Parameterized object sensitivity for points-to analysis for Java. ACM Trans. Softw. Eng. Methodol., 14(1):1-41, 2005. ISSN 1049-331X.

Digital Library

[45]

Mayur Naik, Alex Aiken, and John Whaley. Effective static race detection for Java. In Proc. of the 2006 ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '06, pages 308-319, New York, NY, USA, 2006. ACM. ISBN 1-59593-320-4.

Digital Library

[46]

Mayur Naik, Chang-Seo Park, Koushik Sen, and David Gay. Effective static deadlock detection. In Proc. of the 31st International Conf. on Software Engineering, ICSE '09, pages 386-396, New York, NY, USA, 2009. ACM. ISBN 978-1-4244-3452-7.

Digital Library

[47]

Rupesh Nasre. Exploiting the structure of the constraint graph for efficient points-to analysis. In Proc. of the 2012 International Symp. on Memory Management, ISMM '12, pages 121-132. ACM, 2012. ISBN 978-1-4503-1350-6.

Digital Library

[48]

Peter W. O'Hearn, John C. Reynolds, and Hongseok Yang. Local reasoning about programs that alter data structures. In Proc. of the 15th International Workshop on Computer Science Logic, volume 2142 of CSL '01, pages 1-19. Springer, 2001. ISBN 3-540-42554-3.

[49]

Ganesan Ramalingam. The undecidability of aliasing. ACM Trans. Program. Lang. Syst., 16(5):1467-1471, 1994.

Digital Library

[50]

Thomas W. Reps. Demand interprocedural program analysis using logic databases. In R. Ramakrishnan, editor, Applications of Logic Databases, pages 163-196. Kluwer Academic Publishers, 1994.

[51]

Thomas W. Reps. Program analysis via graph reachability. Information & Software Technology, 40:701-726, 1998.

[52]

Thomas W. Reps. Undecidability of context-sensitive data-independence analysis. ACM Trans. Program. Lang. Syst., 22(1):162-186, 2000.

Digital Library

[53]

Thomas W. Reps, Susan Horwitz, and Shmuel Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Proc. of the 22nd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL '95, pages 49-61, New York, NY, USA, 1995. ACM. ISBN 0-89791-692-1.

[54]

John C. Reynolds. Separation logic: A logic for shared mutable data structures. In Proc. of the 17th IEEE Symp. on Logic in Computer Science, LICS '02, pages 55-74. IEEE Computer Society, 2002. ISBN 0-7695-1483-9.

[55]

Noam Rinetzky, Ganesan Ramalingam, Shmuel Sagiv, and Eran Yahav. On the complexity of partially-flow-sensitive alias analysis. ACM Trans. Program. Lang. Syst., 30(3), 2008.

Digital Library

[56]

Atanas Rountev and Satish Chandra. Off-line variable substitution for scaling points-to analysis. In Proc. of the 2000 ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '00, pages 47-56, New York, NY, USA, 2000. ACM. ISBN 1-58113-199-2.

[57]

Barbara G. Ryder. Dimensions of precision in reference analysis of object-oriented programming languages. In Proc. of the 12th International Conf. on Compiler Construction, CC '03, pages 126-137. Springer, 2003. ISBN 3-540-00904-3.

[58]

Mooly Sagiv, Thomas W. Reps, and Reinhard Wilhelm. Parametric shape analysis via 3-valued logic. ACM Trans. Program. Lang. Syst., 24(3):217-298, May 2002. ISSN 0164-0925.

Digital Library

[59]

Micha Sharir and Amir Pnueli. Two approaches to interprocedural data flow analysis. In Steven S. Muchnick and Neil D. Jones, editors, Program flow analysis: theory and applications, chapter 7, pages 189-233. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1981. ISBN 0137296819.

[60]

Olin Shivers. Control-Flow Analysis of Higher-Order Languages. PhD thesis, Carnegie Mellon University, may 1991.

[61]

Yannis Smaragdakis, Martin Bravenboer, and Ond¿ej Lhoták. Pick your contexts well: Understanding object-sensitivity. In Proc. of the 38th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL '11, pages 17-30, New York, NY, USA, 2011. ACM. ISBN 978-1- 4503-0490-0.

Digital Library

[62]

Yannis Smaragdakis, George Balatsouras, and George Kastrinis. Set-based pre-processing for points-to analysis. In Proc. of the 28th Annual ACM SIGPLAN Conf. on Object Oriented Programming, Systems, Languages, and Applications, OOPSLA '13, pages 253-270, New York, NY, USA, 2013. ACM. ISBN 978-1-4503-2374-1.

Digital Library

[63]

Yannis Smaragdakis, George Kastrinis, and George Balatsouras. Introspective analysis: Context-sensitivity, across the board. In Proc. of the 2014 ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '14, pages 485-495, New York, NY, USA, 2014. ACM. ISBN 978-1-4503-2784-8.

[64]

Manu Sridharan and Rastislav Bodík. Refinement-based context-sensitive points-to analysis for Java. In Proc. of the 2006 ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '06, pages 387-400, New York, NY, USA, 2006. ACM. ISBN 1-59593-320-4.

Digital Library

[65]

Manu Sridharan, Denis Gopan, Lexin Shan, and Rastislav Bodík. Demanddriven points-to analysis for Java. In Proc. of the 20th Annual ACM SIGPLAN Conf. on Object Oriented Programming, Systems, Languages, and Applications, OOPSLA '05, pages 59-76, New York, NY, USA, 2005. ACM. ISBN 1-59593-031-0.

[66]

Manu Sridharan, Satish Chandra, Julian Dolby, Stephen J. Fink, and Eran Yahav. Alias analysis for object-oriented programs. In Dave Clarke, James Noble, and Tobias Wrigstad, editors, Aliasing in Object-Oriented Programming. Types, Analysis and Verification, volume 7850 of Lecture Notes in Computer Science, pages 196-232. Springer Berlin Heidelberg, 2013. ISBN 978-3-642-36945-2.

[67]

Bjarne Steensgaard. Points-to analysis in almost linear time. In Proc. of the 23rd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL '96, pages 32-41, New York, NY, USA, 1996. ACM. ISBN 0-89791-769-3.

[68]

Frank Tip and Jens Palsberg. Scalable propagation-based call graph construction algorithms. In Proc. of the 15th Annual ACM SIGPLAN Conf. on Object Oriented Programming, Systems, Languages, and Applications, OOPSLA '00, pages 281-293, New York, NY, USA, 2000. ACM. ISBN 1-58113-200-X.

Digital Library

[69]

David Van Horn and Harry G. Mairson. Deciding k CFA is complete for EXPTIME. In Proc. of the 13th ACM SIGPLAN International Conference on Functional programming, ICFP '08, pages 275-282. ACM, 2008. ISBN 978-1-59593-919-7.

Digital Library

[70]

John Whaley and Monica S. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In Proc. of the 2004 ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '04, pages 131-144, New York, NY, USA, 2004. ACM. ISBN 1-58113-807-5.

Digital Library

[71]

John Whaley, Dzintars Avots, Michael Carbin, and Monica S. Lam. Using Datalog with binary decision diagrams for program analysis. In Proc. of the 3rd Asian Symp. on Programming Languages and Systems, APLAS '05, pages 97-118. Springer, 2005. ISBN 3-540-29735-9.

Digital Library

[72]

Robert P. Wilson and Monica S. Lam. Efficient context-sensitive pointer analysis for C programs. In Proc. of the 1995 ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '95, pages 1-12, New York, NY, USA, 1995. ACM. ISBN 0-8989791-697-2.

[73]

Qirun Zhang, Michael R. Lyu, Hao Yuan, and Zhendong Su. Fast algorithms for Dyck-CFL-reachability with applications to alias analysis. In Proc. of the 2013 ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '13, pages 435-446, New York, NY, USA, 2013. ACM. ISBN 978-1-4503-2014-6.

Digital Library

[74]

Xin Zheng and Radu Rugina. Demand-driven alias analysis for C. In Proc. of the 35th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL '08, pages 197-208, New York, NY, USA, 2008. ACM. ISBN 978-1-59593-689-9.

Digital Library

Cited By

Rajagopalan VPortokalidis GCraven RMickelson M(2024)Evaluating the Effect of Improved Indirect Call Resolution on System Call DebloatingProceedings of the 2024 Workshop on Forming an Ecosystem Around Software Transformation10.1145/3689937.3695791(1-6)Online publication date: 14-Oct-2024
https://dl.acm.org/doi/10.1145/3689937.3695791
Halalingaiah SSundaresan VMaier DNandivada V(2024)The ART of Sharing Points-to Analysis: Reusing Points-to Analysis Results Safely and EfficientlyProceedings of the ACM on Programming Languages10.1145/36898038:OOPSLA2(2606-2632)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689803
Ghidini RErhard JSchwarz MSeidl HArceri VPasqua M(2024)C-2PO: A Weakly Relational Pointer Domain: “These Are Not the Memory Cells You Are Looking For”Proceedings of the 10th ACM SIGPLAN International Workshop on Numerical and Symbolic Abstract Domains10.1145/3689609.3689994(2-9)Online publication date: 17-Oct-2024
https://dl.acm.org/doi/10.1145/3689609.3689994
Show More Cited By

Pointer Analysis
1. Theory of computation
  1. Semantics and reasoning
    1. Program reasoning

Recommendations

Interprocedural pointer alias analysis

We present practical approximation methods for computing and representing interprocedural aliases for a program written in a language that includes pointers, reference parameters, and recursion. We present the following contributions: (1) a framework ...
Practical pointer aliasing analysis
Demand-driven pointer analysis

Known algorithms for pointer analysis are “global” in the sense that they perform an exhaustive analysis of a program or program component. In this paper we introduce a demand-driven approach for pointer analysis. Specifically, we describe a demand-...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Foundations and Trends in Programming Languages

Foundations and Trends in Programming Languages Volume 2, Issue 1

4 2015

72 pages

EISSN:2325-1131

Issue’s Table of Contents

Publisher

Now Publishers Inc.

Hanover, MA, United States

Publication History

Published: 01 April 2015

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

87
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Rajagopalan VPortokalidis GCraven RMickelson M(2024)Evaluating the Effect of Improved Indirect Call Resolution on System Call DebloatingProceedings of the 2024 Workshop on Forming an Ecosystem Around Software Transformation10.1145/3689937.3695791(1-6)Online publication date: 14-Oct-2024
https://dl.acm.org/doi/10.1145/3689937.3695791
Halalingaiah SSundaresan VMaier DNandivada V(2024)The ART of Sharing Points-to Analysis: Reusing Points-to Analysis Results Safely and EfficientlyProceedings of the ACM on Programming Languages10.1145/36898038:OOPSLA2(2606-2632)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689803
Ghidini RErhard JSchwarz MSeidl HArceri VPasqua M(2024)C-2PO: A Weakly Relational Pointer Domain: “These Are Not the Memory Cells You Are Looking For”Proceedings of the 10th ACM SIGPLAN International Workshop on Numerical and Symbolic Abstract Domains10.1145/3689609.3689994(2-9)Online publication date: 17-Oct-2024
https://dl.acm.org/doi/10.1145/3689609.3689994
Wimmer CStancu CKozak DWürthinger T(2024)Scaling Type-Based Points-to Analysis with SaturationProceedings of the ACM on Programming Languages10.1145/36564178:PLDI(990-1013)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656417
Zhao HDeep SKoutris PRoy STannen V(2024)Evaluating Datalog over Semirings: A Grounding-based ApproachProceedings of the ACM on Management of Data10.1145/36515912:2(1-26)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3651591
Blumschein CNiephaus FStancu CWimmer CLincke JHirschfeld RChristakis MPradel M(2024)Finding Cuts in Static Analysis Graphs to Debloat SoftwareProceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3650212.3680306(603-614)Online publication date: 11-Sep-2024
https://dl.acm.org/doi/10.1145/3650212.3680306
Guo YYao PZhang CChristakis MPradel M(2024)Precise Compositional Buffer Overflow Detection via Heap DisjointnessProceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3650212.3652110(63-75)Online publication date: 11-Sep-2024
https://dl.acm.org/doi/10.1145/3650212.3652110
Abeysinghe SXhebraj ARompf T(2024)Flan: An Expressive and Efficient Datalog Compiler for Program AnalysisProceedings of the ACM on Programming Languages10.1145/36329288:POPL(2577-2609)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632928
Palit TFonseca PTsafrir DMusuvathi MGupta RAbu-Ghazaleh N(2024)Kaleidoscope: Precise Invariant-Guided Pointer AnalysisProceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 310.1145/3620666.3651340(561-576)Online publication date: 27-Apr-2024
https://dl.acm.org/doi/10.1145/3620666.3651340
Jin WXu SChen DHe JZhong DFan MChen HZhang HLiu TRoychoudhury APaiva AAbreu RStorey M(2024)PyAnalyzer: An Effective and Practical Approach for Dependency Extraction from Python CodeProceedings of the IEEE/ACM 46th International Conference on Software Engineering10.1145/3597503.3640325(1-12)Online publication date: 20-May-2024
https://dl.acm.org/doi/10.1145/3597503.3640325
Show More Cited By

View Options

View options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents