skip to main content
research-article
Free Access

On the complexity of partially-flow-sensitive alias analysis

Published:21 May 2008Publication History
Skip Abstract Section

Abstract

We introduce the notion of a partially-flow-sensitive analysis based on the number of read and write operations that are guaranteed to be analyzed in a sequential manner. We study the complexity of partially-flow-sensitive alias analysis and show that precise alias analysis with a very limited flow-sensitivity is as hard as precise flow-sensitive alias analysis, both when dynamic memory allocation is allowed, as well as in the absence of dynamic memory allocation.

References

  1. Andersen, L. O. 1994. Program analysis and specialization for the C programming language. Ph.D. dissertation, DIKU, Univ. of Copenhagen. (DIKU report 94/19).Google ScholarGoogle Scholar
  2. Chakaravarthy, V. 2003. New results on the computability and complexity of points--to analysis. In POPL '03: Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, NY, USA, 115--125. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Horwitz, S. 1997. Precise flow-insensitive may-alias analysis is NP-hard. ACM Trans. Prog. Lang. Syst. 19, 1(Jan.), 1--6. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Kernighan, B. W. and Ritchie, D. M. 1988. The C programming language. Prentice Hall, Upper Saddle River, NJ. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Landi, W. 1992a. Interprocedural aliasing in the presence of pointers. Ph.D. dissertation, Rutgers University. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Landi, W. 1992b. Undecidability of static analysis. Let. on Prog. Lang. and Syst. 1, 4, 323--337. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Milne, R. and Strachey, C. 1977. A Theory of Programming Language Semantics. Halsted Press, New York, NY. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Muth, R. and Debray, S. K. 2000. On the complexity of flow-sensitive dataflow analyses. In Proceedings of the Symposium on Principles of Programming Languages. 67--80. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Ramalingam, G. 1994. The undecidability of aliasing. Trans. Prog. Lang. Syst. 16, 5, 1467--1471. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Reynolds, J. 2002. Separation logic: A logic for shared mutable data structures. In Logic in Computer Science. 55--74. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Strachey, C. 1966. Towards a formal semantics. In Formal Language Description Languages for Computer Programming, T. B. Steel, Ed. North Holland, Amsterdam, The Netherlands, 198--220.Google ScholarGoogle Scholar

Index Terms

  1. On the complexity of partially-flow-sensitive alias analysis

                Recommendations

                Comments

                Login options

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

                Sign in

                Full Access

                • Published in

                  cover image ACM Transactions on Programming Languages and Systems
                  ACM Transactions on Programming Languages and Systems  Volume 30, Issue 3
                  May 2008
                  245 pages
                  ISSN:0164-0925
                  EISSN:1558-4593
                  DOI:10.1145/1353445
                  Issue’s Table of Contents

                  Copyright © 2008 ACM

                  Publisher

                  Association for Computing Machinery

                  New York, NY, United States

                  Publication History

                  • Published: 21 May 2008
                  • Accepted: 1 April 2007
                  • Revised: 1 December 2006
                  • Received: 1 March 2006
                  Published in toplas Volume 30, Issue 3

                  Permissions

                  Request permissions about this article.

                  Request Permissions

                  Check for updates

                  Qualifiers

                  • research-article
                  • Research
                  • Refereed

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader
                About Cookies On This Site

                We use cookies to ensure that we give you the best experience on our website.

                Learn more

                Got it!