![]() | 2010 | |
---|---|---|
85 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Mark Harman, Youssef Hassoun, Syed Islam, Zheng Li: Assessing the impact of global variables on program dependence and dependence clusters. Journal of Systems and Software 83(1): 96-107 (2010) |
2009 | ||
84 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Marcia Davis, Dawn Lawrie, Christopher Morrell: To camelcase or under_score. ICPC 2009: 158-167 |
83 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Mark Harman: Identifying 'Linchpin Vertices' That Cause Large Dependence Clusters. SCAM 2009: 89-98 |
82 | ![]() ![]() ![]() ![]() ![]() ![]() | Susan Horwitz, Susan H. Rodger, Maureen Biggers, David Binkley, C. Kolin Frantz, Dawn Gundermann, Susanne E. Hambrusch, Steven Huss-Lederman, Ethan V. Munson, Barbara G. Ryder, Monica Sweat: Using peer-led team learning to increase participation and success of under-represented groups in introductory computer science. SIGCSE 2009: 163-167 |
81 | ![]() ![]() ![]() ![]() ![]() ![]() | Mark Harman, David Binkley, Keith Gallagher, Nicolas Gold, Jens Krinke: Dependence clusters in source code. ACM Trans. Program. Lang. Syst. 32(1): (2009) |
80 | ![]() ![]() ![]() ![]() ![]() ![]() | Phil McMinn, David Binkley, Mark Harman: Empirical evaluation of a nesting testability transformation for evolutionary testing. ACM Trans. Softw. Eng. Methodol. 18(3): (2009) |
79 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Henry Feild, Dawn J. Lawrie, Maurizio Pighin: Increasing diversity: Natural language measures for software fault prediction. Journal of Systems and Software 82(11): 1793-1803 (2009) |
78 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Dawn Lawrie, Steve Maex, Christopher Morrell: Identifier length and limited programmer memory. Sci. Comput. Program. 74(7): 430-445 (2009) |
2008 | ||
77 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahdavi, Joachim Wegener: Dependence Anti Patterns. ASE Workshops 2008: 25-34 |
76 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Helmut E. Graeb, Georges G. E. Gielen, Jaijeet S. Roychowdhury: From Transistor to PLL - Analogue Design and EDA Methods. DATE 2008 |
75 | ![]() ![]() ![]() ![]() ![]() ![]() | Mark Harman, André Baresel, David Binkley, Robert M. Hierons, Lin Hu, Bogdan Korel, Phil McMinn, Marc Roper: Testability Transformation - Program Transformation to Improve Testability. Formal Methods and Testing 2008: 320-344 |
74 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Dawn Lawrie, Steve Maex, Christopher Morrell: Impact of Limited Memory Resources. ICPC 2008: 83-92 |
73 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahdavi: Evaluating Key Statements Analysis. SCAM 2008: 121-130 |
72 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahdavi: An empirical study of the relationship between the concepts expressed in source code and dependence. Journal of Systems and Software 81(12): 2287-2298 (2008) |
2007 | ||
71 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley: Source Code Analysis: A Road Map. FOSE 2007: 104-119 |
70 | ![]() ![]() ![]() ![]() ![]() ![]() | Dawn Lawrie, Henry Feild, David Binkley: Extracting Meaning from Abbreviated Identifiers. SCAM 2007: 213-222 |
69 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Mark Harman, Jens Krinke: Empirical study of optimization techniques for massive slicing. ACM Trans. Program. Lang. Syst. 30(1): (2007) |
68 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Nicolas Gold, Mark Harman: An empirical study of static program slice size. ACM Trans. Softw. Eng. Methodol. 16(2): (2007) |
67 | ![]() ![]() ![]() ![]() ![]() ![]() | Timothy M. Meyers, David Binkley: An empirical study of slice-based cohesion and coupling metrics. ACM Trans. Softw. Eng. Methodol. 17(1): (2007) |
66 | ![]() ![]() ![]() ![]() ![]() ![]() | Dawn Lawrie, Henry Feild, David Binkley: Quantifying identifier quality: an analysis of trends. Empirical Software Engineering 12(4): 359-388 (2007) |
65 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Rainer Koschke, Spiros Mancoridis: Guest Editors' Introduction to the Special Section from the International Conference on Software Maintenance and Evolution. IEEE Trans. Software Eng. 33(12): 797-798 (2007) |
64 | ![]() ![]() ![]() ![]() ![]() ![]() | Dawn Lawrie, Christopher Morrell, Henry Feild, David Binkley: Effective identifier names for comprehension and memory. ISSE 3(4): 303-318 (2007) |
63 | ![]() ![]() ![]() ![]() ![]() ![]() | Dawn Lawrie, Henry Feild, David Binkley: An empirical study of rules for well-formed identifiers. Journal of Software Maintenance 19(4): 205-229 (2007) |
2006 | ||
62 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Mark Harman, Jens Krinke: Beyond Program Slicing, 06.11. - 11.11.2005 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
61 | ![]() ![]() ![]() ![]() ![]() ![]() | Dawn J. Lawrie, Henry Feild, David Binkley: Leveraged Quality Assessment using Information Retrieval Techniques. ICPC 2006: 149-158 |
60 | ![]() ![]() ![]() ![]() ![]() ![]() | Dawn Lawrie, Christopher Morrell, Henry Feild, David Binkley: What's in a Name? A Study of Identifiers. ICPC 2006: 3-12 |
59 | ![]() ![]() ![]() ![]() ![]() ![]() | Phil McMinn, Mark Harman, David Binkley, Paolo Tonella: The species per path approach to SearchBased test data generation. ISSTA 2006: 13-24 |
58 | ![]() ![]() ![]() ![]() ![]() ![]() | Keith Gallagher, David Binkley, Mark Harman: Stop-List Slicing. SCAM 2006: 11-20 |
57 | ![]() ![]() ![]() ![]() ![]() ![]() | Dawn Lawrie, Henry Feild, David Binkley: Syntactic Identifier Conciseness and Consistency. SCAM 2006: 139-148 |
56 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Mark Harman, Jens Krinke: Characterising, Explaining, and Exploiting the Approximate Nature of Static Analysis through Animation. SCAM 2006: 43-52 |
55 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahdavi: An Empirical Study of Executable Concept Slice Size. WCRE 2006: 103-114 |
54 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Sebastian Danicic, Mark Harman, John Howroyd, Lahcen Ouarbya: A formal relationship between program slicing and partial evaluation. Formal Asp. Comput. 18(2): 103-119 (2006) |
53 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Mariano Ceccato, Mark Harman, Filippo Ricca, Paolo Tonella: Tool-Supported Refactoring of Existing Object-Oriented Code into Aspects. IEEE Trans. Software Eng. 32(9): 698-717 (2006) |
52 | ![]() ![]() ![]() ![]() ![]() ![]() | Mark Harman, Arun Lakhotia, David Binkley: Theory and algorithms for slicing unstructured programs. Information & Software Technology 48(7): 549-565 (2006) |
51 | ![]() ![]() ![]() ![]() ![]() ![]() | Srikanth Mohan, Arun Ravindran, David Binkley, Arindam Mukherjee: Power Optimized Design of CMOS Programmable Gain Amplifiers. J. Low Power Electronics 2(2): 259-270 (2006) |
50 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Bogdan Korel: A formalisation of the relationship between forms of program slicing. Sci. Comput. Program. 62(3): 228-252 (2006) |
49 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Bogdan Korel: Theoretical foundations of dynamic program slicing. Theor. Comput. Sci. 360(1-3): 23-41 (2006) |
2005 | ||
48 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Mark Harman, Jens Krinke: 05451 Abstracts Collection -- Beyond Program Slicing. Beyond Program Slicing 2005 |
47 | ![]() ![]() ![]() ![]() ![]() ![]() | Mark Harman, David Binkley, Jens Krinke: 05451 Executive Summary -- Beyond Program Slicing Dagstuhl Seminar. Beyond Program Slicing 2005 |
46 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Mark Harman: Locating Dependence Clusters and Dependence Pollution. ICSM 2005: 177-186 |
45 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Mariano Ceccato, Mark Harman, Filippo Ricca, Paolo Tonella: Automated Refactoring of Object Oriented Code into Aspects. ICSM 2005: 27-36 |
44 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Mark Harman: Forward slices are smaller than backward slices. SCAM 2005: 15-24 |
43 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Bogdan Korel: Minimal Slicing and the Relationships Between Forms of Slicing. SCAM 2005: 45-56 |
42 | ![]() ![]() ![]() ![]() ![]() ![]() | Nicolas E. Gold, Mark Harman, David Binkley, Robert M. Hierons: Unifying program slicing and concept assignment for higher-level executable source code extraction. Softw., Pract. Exper. 35(10): 977-1006 (2005) |
2004 | ||
41 | ![]() ![]() ![]() ![]() ![]() ![]() | André Baresel, David Binkley, Mark Harman, Bogdan Korel: Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach. ISSTA 2004: 108-118 |
40 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Lahcen Ouarbya: Formalizing Executable Dynamic and Forward Slicing. SCAM 2004: 43-52 |
39 | ![]() ![]() ![]() ![]() ![]() ![]() | Mark Harman, David Binkley, Ranjit Singh, Robert M. Hierons: Amorphous Procedure Extraction. SCAM 2004: 85-94 |
38 | ![]() ![]() ![]() ![]() ![]() ![]() | Lin Hu, Mark Harman, Robert M. Hierons, David Binkley: Loop Squashing Transformations for Amorphous Slicing. WCRE 2004: 152-160 |
37 | ![]() ![]() ![]() ![]() ![]() ![]() | Timothy M. Meyers, David Binkley: Slice-Based Cohesion Metrics and Software Intervention. WCRE 2004: 256-265 |
36 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Mark Harman: A survey of empirical results on program slicing. Advances in Computers 62: 106-179 (2004) |
35 | ![]() ![]() ![]() ![]() ![]() ![]() | Mark Harman, Lin Hu, Malcolm Munro, Xingyuan Zhang, David Binkley, Sebastian Danicic, Mohammed Daoudi, Lahcen Ouarbya: Syntax-Directed Amorphous Slicing. Autom. Softw. Eng. 11(1): 27-61 (2004) |
34 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Mark Harman: Analysis and Visualization of Predicate Dependence on Formal Parameters and Global Variables. IEEE Trans. Software Eng. 30(11): 715-735 (2004) |
33 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Liz Burd, Mark Harman, Paolo Tonella: Introduction. Software Quality Journal 12(4): 293-295 (2004) |
2003 | ||
32 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Mark Harman: An Empirical Study of Predicate Dependence Levels and Trends. ICSE 2003: 330-340 |
31 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Mark Harman: A Large-Scale Empirical Study of Forward and Backward Static Slice Size and Context Sensitivity. ICSM 2003: 44-53 |
30 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Mark Harman: Results from a Large-Scale Study of Performance Optimization Techniques for Source Code Analyses Based on Graph Reachability Algorithms. SCAM 2003: 203- |
29 | ![]() ![]() ![]() ![]() ![]() ![]() | Keith Gallagher, David Binkley: An Empirical Study of Computation Equivalence as Determined by Decomposition Slice Equivalence. WCRE 2003: 316-322 |
28 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, C. E. Hopper, Steve D. Tucker, Brian C. Moss, James M. Rochelle, Daniel Foty: A CAD methodology for optimizing transistor current and sizing in analog CMOS design. IEEE Trans. on CAD of Integrated Circuits and Systems 22(2): 225-237 (2003) |
27 | ![]() ![]() ![]() ![]() ![]() ![]() | Mark Harman, David Binkley, Sebastian Danicic: Amorphous program slicing. Journal of Systems and Software 68(1): 45-64 (2003) |
2002 | ||
26 | ![]() ![]() ![]() ![]() ![]() ![]() | Suriya Ashok Kumar, Rafic Z. Makki, David Binkley: IDDT Testing of Embedded CMOS SRAMs. DATE 2002: 1117 |
25 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley: An Empirical Study of the Effect of Semantic Differences on Programmer Comprehension. IWPC 2002: 97-106 |
24 | ![]() ![]() ![]() ![]() ![]() ![]() | Mark Harman, Nicolas Gold, Robert M. Hierons, David Binkley: Code Extraction Algorithms which Unify Slicing and Concept Assignment. WCRE 2002: 11-21 |
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Paul Anderson, David Binkley, Genevieve Rosay, Tim Teitelbaum: Flow insensitive points-to sets. Information & Software Technology 44(13): 743-754 (2002) |
2001 | ||
22 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Rob Capellini, L. Ross Raszewski, Christopher Smith: An Implementation of and Experiment with Semantic Differencing. ICSM 2001: 82-91 |
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Daniel Foty, David Binkley: Re-Connecting MOS Modeling and Circuit Design: New Methods for Design Quality. ISQED 2001: 13 |
20 | ![]() ![]() ![]() ![]() ![]() ![]() | Paul Anderson, David Binkley, Genevieve Rosay, Tim Teitelbaum: Flow Insensitive Points-To Sets. SCAM 2001: 81-91 |
2000 | ||
19 | ![]() ![]() ![]() ![]() ![]() ![]() | Daniel Foty, David Binkley: MOSFET modeling and circuit design: re-establishing a lost connection (tutorial). DAC 2000: 560 |
18 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, L. Ross Raszewski, Christopher Smith, Mark Harman: An Empirical Study of Amorphous Slicing as a Program Comprehension Support Tool. IWPC 2000: 161-170 |
1999 | ||
17 | ![]() ![]() ![]() ![]() ![]() ![]() | Mark Harman, Chris Fox, Robert M. Hierons, David Binkley, Sebastian Danicic: Program Simplification as a Means of Approximating Undecidable Propositions. IWPC 1999: 208-217 |
16 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley: Computing Amorphous Program Slices Using Dependence Graphs. SAC 1999: 519-525 |
1998 | ||
15 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Bruce Duncan, Brennan Jubb, April Wielgosz: The Feedback Compiler. IWPC 1998: 198- |
14 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley: The application of program slicing to regression testing. Information & Software Technology 40(11-12): 583-594 (1998) |
13 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, James R. Lyle: Application of the pointer state subgraph to static program slicing. Journal of Systems and Software 40(1): 17-27 (1998) |
1997 | ||
12 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Bradley M. Kuhn: Crozzle: an NP-complete problem. SAC 1997: 30-34 |
11 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley: C++ in Safety Critical Systems. Ann. Software Eng. 4: 223-234 (1997) |
10 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley: Semantics Guided Regression Test Cost Reduction. IEEE Trans. Software Eng. 23(8): 498-516 (1997) |
1996 | ||
9 | ![]() ![]() ![]() ![]() ![]() ![]() | Bradley M. Kuhn, David Binkley: An enabling optimization for C++ virtual functions. SAC 1996: 420-428 |
8 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Keith Brian Gallagher: Program Slicing. Advances in Computers 43: 1-50 (1996) |
1995 | ||
7 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley: Reducing the cost of regression testing by semantics guided test case selection. ICSM 1995: 251- |
6 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley, Susan Horwitz, Thomas W. Reps: Program Integration for Languages with Procedure Calls. ACM Trans. Softw. Eng. Methodol. 4(1): 3-35 (1995) |
1994 | ||
5 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley: Interprocedural Constant Propagation using Dependence Graphs and a Data-Flow Model. CC 1994: 374-388 |
1993 | ||
4 | ![]() ![]() ![]() ![]() ![]() ![]() | David Binkley: Precise Executable Interprocedural Slices. LOPLAS 2(1-4): 31-45 (1993) |
1990 | ||
3 | ![]() ![]() ![]() ![]() ![]() ![]() | Susan Horwitz, Thomas W. Reps, David Binkley: Interprocedural Slicing Using Dependence Graphs. ACM Trans. Program. Lang. Syst. 12(1): 26-60 (1990) |
1988 | ||
2 | ![]() ![]() ![]() ![]() ![]() ![]() | Susan Horwitz, Thomas W. Reps, David Binkley: Interprocedural slicing using dependence graphs (with retrospective) Best of PLDI 1988: 229-243 |
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Susan Horwitz, Thomas W. Reps, David Binkley: Interprocedural Slicing Using Dependence Graphs. PLDI 1988: 35-46 |