Ras Bodik

Associate Professor

Research Areas

• Programming Systems (PS), Software engineering; Program analysis; Computer architecture

Research Centers

• Parallel Computing Laboratory (ParLab)

Teaching Schedule (Fall 2009)

• CS 164. Programming Languages and Compilers, T T 3:30-5:00P, 306 Soda

Biography

Received his diploma in Computer Engineering from the Technical University, Kosice, Slovakia, 1992, M.S. and Ph.D. in Computer Science, University of Pittsburgh, Pittsburgh, PA, 1994, 1999. Taught at the University of Wisconsin¿Madison before joining the Computer Science Division at UC Berkeley in 2002. His dissertation on value-flow program analysis won the ACM SIGPLAN Doctoral Dissertation Award. Ras Bodik is a recipient of several teaching awards. His undergraduate course on compiler construction teaches how to use program translation technology in software engineering practice.

Selected Publications

• C. Jones, R. Liu, L. Meyerovich, K. Asanović, and R. Bodik, "Parallelizing the Web Browser," in First USENIX Workshop on Hot Topics in Parallelism, 2009.
• A. Solar Lezama, L. Tancau, R. Bodik, V. Saraswat, and S. A. Seshia, "Combinatorial sketching for finite programs," in Proc. 12th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS-XII), New York, NY: The Association for Computing Machinery, Inc., 2006, pp. 404-415.
• A. Solar-Lezama, R. Rabbah, R. Bodik, and K. Ebcioglu, "Programming by sketching for bitstreaming programs," ACM SIGPLAN Notices, vol. 40, no. 6, pp. 281-294, June 2005.
• D. Mandelin, L. Xu, R. Bodik, and D. Kimelman, "Jungloid mining: Helping to navigate the API jungle," ACM SIGPLAN Notices, vol. 40, no. 6, pp. 48-61, June 2005.
• B. A. Fields, R. Bodik, M. D. Hill, and C. J. Newburn, "Interaction cost: For when event counts just don't add up," IEEE Micro, vol. 24, no. 6, pp. 57-61, Nov. 2004.
• B. Fields, S. Rubin, and R. Bodik, "Focusing processor policies via critical-path prediction," in Proc. 28th Ann. IEEE Intl. Symp. on Computer Architecture, New York, NY: ACM Press, 2001, pp. 74-85.
• R. Bodik, R. Gupta, and V. Sarkar, "ABCD: Eliminating array bounds checks on demand," ACM SIGPLAN Notices, vol. 35, no. 5, pp. 321-333, May 2000.