ACM SIGPLAN Notices · 2004 · 437 citations · 31 references
ComputingComputer ScienceData StructuresProgramming LanguagesStructural AnalysisAbstract Syntax TreesData Structure AlgorithmsDynamic Data StructuresMemory HierarchySyntactic AnalysisMemory Access PatternsPointer AnalysisPointer ArithmeticPointer-based Representation
article Analysis of pointers and structures Authors: David Chase Menlo Park, CA Menlo Park, CAView Profile , Mark Wegman IBM T.J. Watson Research Center, Yorktown Heights, NY IBM T.J. Watson Research Center, Yorktown Heights, NYView Profile , F. Ken Zadeck Brown University, Providence, RI Brown University, Providence, RIView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 39Issue 4April 2004 pp 343–359https://doi.org/10.1145/989393.989429Published:01 April 2004Publication History 0citation587DownloadsMetricsTotal Citations0Total Downloads587Last 12 Months5Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
31
Michael Hind · 2001 · 583 citations
An efficient method of computing static single assignment form
Ron K. Cytron, Jeanne Ferrante, Barry K. Rosen et al. · 1989 · 465 citations
Flow analysis and optimization of LISP-like structures
Neil D. Jones, Steven S. Muchnick · 1979 · 308 citations