Article

Ultra-fast aliasing analysis using CLA: a million lines of C code in a second

Authors:

Olivier TardieuAuthors Info & Claims

PLDI '01: Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation

Pages 254 - 263

https://doi.org/10.1145/378795.378855

Published: 01 May 2001 Publication History

Abstract

We describe the design and implementation of a system for very fast points-to analysis. On code bases of about million lines of unpreprocessed C code, our system performs field-based Andersen-style points-to analysis in less than a second and uses less than 10MB of memory. Our two main contributions are a database-centric analysis architecture called compile-link-analyze (CLA), and a new algorithm for implementing dynamic transitive closure. Our points-to analysis system is built into a forward data-dependence analysis tool that is deployed within Lucent to help with consistent type modifications to large legacy C code bases.

References

[1]

A. Aiken, M. F. ahndrich, J. Foster, and Z. Su, "A Toolkit for Constructing Type- and Constraint-Based Program Analyses", TIC'98.]]

Digital Library

[2]

A. Aiken and E. Wimmers, "Solving Systems of Set Constraints", LICS, 1992.]]

[3]

A. Aiken and E. Wimmers, "Type Inclusion Constraints and Type Inference", ICFP, 1993.]]

Digital Library

[4]

L. Andersen, "Program Analysis and Specialization for the C Programming Language", PhD. thesis, DIKU report 94/19, 1994,]]

[5]

D. Atkinson and W. Griswold, "Effective Whole-Program Analysis in the Presence of Pointers", 1998 Symp. on the Foundations of Soft. Eng.]]

Digital Library

[6]

S. Chandra, N. Heintze, D. MacQueen, D. Oliva and M. Siff, "ckit: an extensible C frontend in ML",to be released as an SML/NJ library.]]

[7]

S. Chandra and T. Reps, "Physical Type Checking for C" PASTE, 1999.]]

Digital Library

[8]

M. Das, "Unification-Based Pointer Analysis with Directional Assignments" PLDI, 2000.]]

Digital Library

[9]

"Appendix D: Optimizing Techniques (MIPS-Based C Compiler)", Programmer's Guide: Digital UNIX Version 4.0, Digital Equipment Corporation, March 1996.]]

[10]

J. Foster, M. F.ahndrich and A. Aiken, "Flow-Insensitive Points-to Analysis with Term and Set Constraints" U. of California, Berkeley, UCB//CSD97964, 1997.]]

Digital Library

[11]

M. F.ahndrich, J. Foster, Z. Su and A. Aiken, "Partial Online Cycle Elimination in Inclusion Constraint Graphs" PLDI, 1998.]]

Digital Library

[12]

C. Flanagan and M. Felleisen, "Componential Set-Based Analysis" PLDI, 1997.]]

Digital Library

[13]

J. Foster, M. F. ahndrich and A. Aiken, "Polymorphic versus Monomorphic Flow-insensitive Points-to Analysis for C", SAS 2000.]]

Digital Library

[14]

N. Heintze, "Set Based Program Analysis", PhD thesis, Carnegie Mellon University, 1992.]]

Digital Library

[15]

N. Heintze, "Set-Based Analysis of ML Programs", LFP, 1994.]]

Digital Library

[16]

N. Heintze, "Analysis of Large Code Bases: The Compile-Link-Analyze Model" unpublished report, November 1999.]]

[17]

N. Heintze and J. Jaffar, "A decision procedure for a class of Herbrand set constraints" LICS, 1990.]]

[18]

N. Heintze and D. McAllester, "On the Cubic-Bottleneck of Subtyping and Flow Analysis" LICS, 1997.]]

Digital Library

[19]

"Programming Languages - C", ISO/IEC 9899:1990, Internation Standard, 1990.]]

[20]

D. McAllester, "On the Complexity Analysis of Static Analysis", SAS, 1999.]]

Digital Library

[21]

A. Rountev and S. Chandra, "Off-line Variable Substitution for Scaling Points-to Analysis", PLDI, 2000.]]

Digital Library

[22]

M. Shapiro and S. Horwitz, "Fast and Accurate Flow-Insensitive Points-To Analysis", POPL, 1997.]]

Digital Library

[23]

Z. Su, M. F. ahndrich, and A. Aiken, "Projection Merging: Reducing Redundancies in Inclusion Constraint Graphs", POPL, 2000.]]

Digital Library

[24]

B. Steensgaard, "Points-to Analysis in Almost Linear Time", POPL, 1996.]]

Digital Library

[25]

F. Tip, "Generation of Program Analysis Tools", Institute for Logic Language and Computation dissertation series, 1995-5, 1995.]]

Cited By

Emre MBoyland PParekh ASchroeder RDewey KHardekopf B(2023)Aliasing Limits on Translating C to Safe RustProceedings of the ACM on Programming Languages10.1145/35860467:OOPSLA1(551-579)Online publication date: 6-Apr-2023
https://dl.acm.org/doi/10.1145/3586046
Barbar MSui Y(2021)Compacting points-to sets through object clusteringProceedings of the ACM on Programming Languages10.1145/34855475:OOPSLA(1-27)Online publication date: 15-Oct-2021
https://dl.acm.org/doi/10.1145/3485547
Mathiasen APavlogiannis A(2021)The fine-grained and parallel complexity of andersen’s pointer analysisProceedings of the ACM on Programming Languages10.1145/34343155:POPL(1-29)Online publication date: 4-Jan-2021
https://dl.acm.org/doi/10.1145/3434315
Show More Cited By

Index Terms

Ultra-fast aliasing analysis using CLA: a million lines of C code in a second

Recommendations

Ultra-fast aliasing analysis using CLA: a million lines of C code in a second

We describe the design and implementation of a system for very fast points-to analysis. On code bases of about million lines of unpreprocessed C code, our system performs field-based Andersen-style points-to analysis in less than a second and uses less ...
Practical pointer aliasing analysis
Program decomposition for pointer aliasing: a step toward practical analyses

Pointer aliasing analysis is crucial to compile-time analyses for languages with general-purpose pointer usage (such as C), but many aliasing methods have proven quite costly. We present a technique that partitions the statements of a program to allow ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PLDI '01: Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation

June 2001

331 pages

ISBN:1581134142

DOI:10.1145/378795

Chairmen:
Michael Burke
IBM T.J. Watson Research Center
,
Mary Lou Soffa
Univ. of Pittsburgh

ACM SIGPLAN Notices Volume 36, Issue 5
May 2001
330 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/381694
Editors:
Cindy Norris,
James B. Bergin
Issue’s Table of Contents

Copyright © 2001 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 2001

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PLDI01

Sponsor:

SIGPLAN

PLDI01: ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation

Utah, Snowbird, USA

Acceptance Rates

PLDI '01 Paper Acceptance Rate 30 of 144 submissions, 21%;

Overall Acceptance Rate 406 of 2,067 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

218
Total Citations
View Citations
1,147
Total Downloads

Downloads (Last 12 months)22
Downloads (Last 6 weeks)1

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Emre MBoyland PParekh ASchroeder RDewey KHardekopf B(2023)Aliasing Limits on Translating C to Safe RustProceedings of the ACM on Programming Languages10.1145/35860467:OOPSLA1(551-579)Online publication date: 6-Apr-2023
https://dl.acm.org/doi/10.1145/3586046
Barbar MSui Y(2021)Compacting points-to sets through object clusteringProceedings of the ACM on Programming Languages10.1145/34855475:OOPSLA(1-27)Online publication date: 15-Oct-2021
https://dl.acm.org/doi/10.1145/3485547
Mathiasen APavlogiannis A(2021)The fine-grained and parallel complexity of andersen’s pointer analysisProceedings of the ACM on Programming Languages10.1145/34343155:POPL(1-29)Online publication date: 4-Jan-2021
https://dl.acm.org/doi/10.1145/3434315
Barbar MSui Y(2021)Hash Consed Points-To SetsStatic Analysis10.1007/978-3-030-88806-0_2(25-48)Online publication date: 13-Oct-2021
https://doi.org/10.1007/978-3-030-88806-0_2
Bai JLawall JHu S(2020)Effective Detection of Sleep-in-atomic-context Bugs in the Linux KernelACM Transactions on Computer Systems10.1145/338199036:4(1-30)Online publication date: 17-Apr-2020
https://dl.acm.org/doi/10.1145/3381990
Süß TNagel LVef MBrinkmann AFeld DSoddemann T(2020)Pure Functions in C: A Small Keyword for Automatic ParallelizationInternational Journal of Parallel Programming10.1007/s10766-020-00660-4Online publication date: 30-May-2020
https://doi.org/10.1007/s10766-020-00660-4
Bai JLawall JChen QHu SDan TDahlia M(2019)Effective static analysis of concurrency use-after-free bugs in Linux device driversProceedings of the 2019 USENIX Conference on Usenix Annual Technical Conference10.5555/3358807.3358830(255-268)Online publication date: 10-Jul-2019
https://dl.acm.org/doi/10.5555/3358807.3358830
Bai JLawall JTan WHu SBahar IHerlihy MWitchel ELebeck A(2019)DCNSProceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3297858.3304065(287-299)Online publication date: 4-Apr-2019
https://dl.acm.org/doi/10.1145/3297858.3304065
Feichtner JMissmann DSpreitzer RPapadimitratos PButler KPöpper C(2018)Automated Binary Analysis on iOSProceedings of the 11th ACM Conference on Security & Privacy in Wireless and Mobile Networks10.1145/3212480.3212487(236-247)Online publication date: 18-Jun-2018
https://dl.acm.org/doi/10.1145/3212480.3212487
Liu Y(2018)Logic programming applicationsDeclarative Logic Programming10.1145/3191315.3191326(519-548)Online publication date: 1-Sep-2018
https://dl.acm.org/doi/10.1145/3191315.3191326
Show More Cited By

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents