Ben Hardekopf

University of Texas at Austin

Pointer Analysis: Building a Foundation for Effective Program Analysis


Pointer analysis is an important enabling technology for effective program analysis; it has applications in fields ranging from program verification and model checking to parallelization, from program understanding to hardware synthesis, and many other fields as well. In this talk I describe how I provide a stronger foundation for all of these fields by creating a set of new and highly scalable algorithms for precise pointer analysis.


 These algorithms stem from a principled approach based on exploiting different notions of equivalence, which has a far-reaching impact on many different types of pointer analysis. In addition, I describe my vision for the future of pointer analysis research, which constitutes a radical departure from current practice. Finally, I briefly discuss my current research, still in its beginning stages, which leverages my advances in pointer analysis to address interesting problems dealing with concurrency and abstraction.




Ben Hardekopf received a BSE in Electrical Engineering with a 2nd major in Computer Science from Duke University in 1997. While serving as an active duty officer in the United States Air Force, he also received a Masters in Computer Science from SUNY at Utica/Rome in 2000 He is currently attending the Ph.D. program at The University of Texas at Austin under Dr. Calvin Lin and expects to graduate in May of 2009.



5130 Upson Hall

Tuesday, April 7, 2009

Refreshments at 4:00pm in the Upson 4th Floor Atrium

Computer Science


Spring 2009