|
Google Research
Other Google Resources
|
David received a B.A. in Geography from the University of California, Berkeley, an M.S. in Mathematics from California State University, Hayward, and a Ph.D. in Computer Science from the University of California, San Diego. He has taught Computer Science at the Hong Kong University of Science and Technology, and worked at several Silicon Valley startups. David is currently a Senior Software Engineer at Google.
Experiences Using Static Analysis to Find Bugs, Nathaniel Ayewah, David Hovemeyer, J. David Morgenthaler, John Penix, William Pugh, IEEE Software (2008) (to appear).
Predicting Accurate and Actionable Static Analysis Warnings: An Experimental Approach, Joseph Ruthruff, John Penix, J. David Morgenthaler, Sebastian Elbaum, Gregg Rothermel, Proceedings of the International Conference on Software Engineering, 2008, pp. 341-350.
Evaluating Static Analysis Defect Warnings on Production Software, Nathaniel Ayewah, William Pugh, J. David Morgenthaler, John Penix, YuQian Zhou, Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, 2007, pp. 1-8.
Using FindBugs on Production Software, Nathaniel Ayewah, J. David Morgenthaler, John Penix, William Pugh, YuQian Zhou, Proc. OOPSLA'07, 2007.
Optimal Integer Alphabetic Trees in Linear Time, T. C. Hu, Lawrence L. Larmore, J. David Morgenthaler, ESA 2005, 13th Annual European Symposium, pp. 226-237.
Tool Support for Planning the Restructuring of Data Abstractions in Large Systems, William G. Griswold, Morison I. Chen, Robert W. Bowdidge, Jenny L. Cabaniss, Van B. Nguyen, J. David Morgenthaler, IEEE Trans. Software Eng., vol. 24 (1998), pp. 534-558.
Static analysis for a software transformation tool, John David Morgenthaler, 1997.
Tool Support for Planning the Restructuring of Data Abstractions in Large Systems, William G. Griswold, Morison I. Chen, Robert W. Bowdidge, J. David Morgenthaler, SIGSOFT FSE, 1996, pp. 33-45.
Optimum Alphabetic Binary Trees, T. C. Hu, J. David Morgenthaler, Combinatorics and Computer Science, 1995, pp. 234-243.
Dynamic programming and graph optimization problems, T. C. Hu, J. D. Morgenthaler, Computers & Mathematics with Applications, vol. 27 (1994), pp. 53-58.
|
|
