I am interested in the area of programming languages. In general, I like to apply the formal techniques and tools from the programming languages domain (e.g., abstract interpretation, formal semantics) to other domains.

Dr. William Cook and I are working on the database/programming language integration problem. Our current work automatically transforms an orthogonally persistent program into a program that uses an explicit query. This way, programmers can build modular, scalable, data-intensive applications that still have good performance.*

Previously, I worked with Dr. Kathryn McKinley and the DaCapo group on Java memory management (garbage collection) techniques. I did some preliminary investigations on optimal limits of garbage collection performance.

Peer-Reviewed Publications

Interprocedural Query Extraction for Transparent Persistence
B. Wiedermann, A. Ibrahim, and W. R. Cook
OOPSLA 2008

Wake Up and Smell the Coffee: Evaluation Methodology for the 21st Century
S. M. Blackburn, K. S. McKinley, R. Garner, C. Hoffman, A. M. Khan, R. Bentzur A. Diwan, D. Feinberg, D. Frampton, S. Z. Guyer, M. Hirzel, A. Hosking, M. Jump, H. Lee, J. E. B. Moss, A. Phansalkar, D. Stefanovic, T. VanDrunen, D. von Dincklage, and B. Wiedermann
CACM, Research Highlights (Invited), 51(8) pages 83--89, August, 2008.

Extracting Queries by Static Analysis of Transparent Persistence
B. Wiedermann and W. R. Cook
POPL 2007
Slides (pdf)

The DaCapo Benchmarks: Java Benchmarking Development and Analysis
S. M. Blackburn, R. Garner, C. Hoffman, A. M. Khan, K. S. McKinley, R. Bentzur A. Diwan, D. Feinberg, D. Frampton, S. Z. Guyer, M. Hirzel, A. Hosking, M. Jump, H. Lee, J. E. B. Moss, A. Phansalkar, D. Stefanovic, T. VanDrunen, D. von Dincklage, and B. Wiedermann
OOPSLA 2006
Extended Version; Technical Report, ANU, TR-CS-06-01, 2006

Books

Python How To Program
H. Deitel, P. Deitel, J. Liperi and B. Wiedermann
Prentice Hall: Upper Saddle Lake, NJ, 2002
[Amazon]

Technical Reports

Copies available upon request.

A Unifying Framework for Describing the Space of Pointer Analysis Approximations (Extended Version)
B. Hardekopf, B. Wiedermann, W. R. Cook, and C. Lin
The University of Texas at Austin, Department of Computer Sciences. Report# TR-08-32. July, 2008.

Know your place: Selectively Executing Statements Based On Context
B. Wiedermann
The University of Texas at Austin, Department of Computer Sciences. Report# TR-07-38. July, 2007.

Quit Copying Me: A Framework for Evaluating Optimal Garbage Collection Costs
B. Wiedermann
The University of Texas at Austin, Department of Computer Sciences. Report# TR-07-39. July, 2007.

The DaCapo Benchmarks: Java Benchmarking Development and Analysis (Extended Version)
S. M. Blackburn, R. Garner, C. Hoffman, A. M. Khan, K. S. McKinley, R. Bentzur A. Diwan, D. Feinberg, D. Frampton, S. Z. Guyer, M. Hirzel, A. Hosking, M. Jump, H. Lee, J. E. B. Moss, A. Phansalkar, D. Stefanovic, T. VanDrunen, D. von Dincklage, and B. Wiedermann
ANU Computer Science TR-CS-06-01. October, 2006

Miscellaneous

How to Use the Pumping Theorem
B. Wiedermann
Unpublished lecture notes. October, 2004.

The Complete Python Training Course
H. Deitel, P. Deitel, J. Liperi and B. Wiedermann
Prentice Hall: Upper Saddle Lake, NJ, 2002
[Amazon]

UT Colloqiua iCal (Beta)

Lit. Review

Google Scholar  |   Windows Live Academic  |   DBLP  |   Paper Search  |   CiteSeer   |   CS Bibliographies  |   CiteULike  |   PL Research   |   CoRR   |   UT Library

Conferences

Confy Calendar  |   CMU list  |   DBLP List 

Writing / Speaking

CMU Advice  |   SPJ Advice