|
Search the dblp DataBase
Emerson R. Murphy-Hill:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Emerson R. Murphy-Hill
Improving usability of refactoring tools. [Citation Graph (0, 0)][DBLP] OOPSLA Companion, 2006, pp:746-747 [Conf]
- Emerson R. Murphy-Hill, Andrew P. Black
Traits: experience with a language feature. [Citation Graph (0, 0)][DBLP] OOPSLA Companion, 2004, pp:275-282 [Conf]
- Emerson R. Murphy-Hill, Andrew P. Black
Tools for a successful refactoring. [Citation Graph (0, 0)][DBLP] OOPSLA Companion, 2006, pp:694-695 [Conf]
- Emerson R. Murphy-Hill, Chuan-Kai Lin, Andrew P. Black, Jonathan Walpole
Can infopipes facilitate reuse in a traffic application? [Citation Graph (0, 0)][DBLP] OOPSLA Companion, 2005, pp:100-101 [Conf]
- Emerson R. Murphy-Hill, Philip J. Quitslund, Andrew P. Black
Removing duplication from java.io: a case study using traits. [Citation Graph (0, 0)][DBLP] OOPSLA Companion, 2005, pp:282-291 [Conf]
- Emerson R. Murphy-Hill
Activating refactorings faster. [Citation Graph (0, 0)][DBLP] OOPSLA Companion, 2007, pp:925-926 [Conf]
- Judith Bayard Cushing, Nalini Nadkarni, Michael Finch, Anne Fiala, Emerson R. Murphy-Hill, Lois M. L. Delcambre, David Maier
Component-based end-user database design for ecologists. [Citation Graph (0, 0)][DBLP] J. Intell. Inf. Syst., 2007, v:29, n:1, pp:7-24 [Journal]
Why Don't People Use Refactoring Tools? [Citation Graph (, )][DBLP]
Breaking the barriers to successful refactoring: observations and tools for extract method. [Citation Graph (, )][DBLP]
How we refactor, and how we know it. [Citation Graph (, )][DBLP]
A degree-of-knowledge model to capture source code familiarity. [Citation Graph (, )][DBLP]
Scalable, expressive, and context-sensitive code smell display. [Citation Graph (, )][DBLP]
Evaluation and usability of programming languages and tools (plateau). [Citation Graph (, )][DBLP]
Supporting Java traits in Eclipse. [Citation Graph (, )][DBLP]
High velocity refactorings in Eclipse. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|