The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David Binkley: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Susan Horwitz, Thomas W. Reps, David Binkley
    Interprocedural Slicing Using Dependence Graphs. [Citation Graph (1, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1990, v:12, n:1, pp:26-60 [Journal]
  2. David Binkley
    Interprocedural Constant Propagation using Dependence Graphs and a Data-Flow Model. [Citation Graph (0, 0)][DBLP]
    CC, 1994, pp:374-388 [Conf]
  3. Daniel Foty, David Binkley
    MOSFET modeling and circuit design: re-establishing a lost connection (tutorial). [Citation Graph (0, 0)][DBLP]
    DAC, 2000, pp:560- [Conf]
  4. Suriya Ashok Kumar, Rafic Z. Makki, David Binkley
    IDDT Testing of Embedded CMOS SRAMs. [Citation Graph (0, 0)][DBLP]
    DATE, 2002, pp:1117- [Conf]
  5. David Binkley, Mark Harman
    An Empirical Study of Predicate Dependence Levels and Trends. [Citation Graph (0, 0)][DBLP]
    ICSE, 2003, pp:330-340 [Conf]
  6. David Binkley
    Reducing the cost of regression testing by semantics guided test case selection. [Citation Graph (0, 0)][DBLP]
    ICSM, 1995, pp:251-0 [Conf]
  7. David Binkley, Mariano Ceccato, Mark Harman, Filippo Ricca, Paolo Tonella
    Automated Refactoring of Object Oriented Code into Aspects. [Citation Graph (0, 0)][DBLP]
    ICSM, 2005, pp:27-36 [Conf]
  8. David Binkley, Rob Capellini, L. Ross Raszewski, Christopher Smith
    An Implementation of and Experiment with Semantic Differencing. [Citation Graph (0, 0)][DBLP]
    ICSM, 2001, pp:82-91 [Conf]
  9. David Binkley, Mark Harman
    A Large-Scale Empirical Study of Forward and Backward Static Slice Size and Context Sensitivity. [Citation Graph (0, 0)][DBLP]
    ICSM, 2003, pp:44-53 [Conf]
  10. David Binkley, Mark Harman
    Locating Dependence Clusters and Dependence Pollution. [Citation Graph (0, 0)][DBLP]
    ICSM, 2005, pp:177-186 [Conf]
  11. Daniel Foty, David Binkley
    Re-Connecting MOS Modeling and Circuit Design: New Methods for Design Quality. [Citation Graph (0, 0)][DBLP]
    ISQED, 2001, pp:13- [Conf]
  12. André Baresel, David Binkley, Mark Harman, Bogdan Korel
    Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach. [Citation Graph (0, 0)][DBLP]
    ISSTA, 2004, pp:108-118 [Conf]
  13. Phil McMinn, Mark Harman, David Binkley, Paolo Tonella
    The species per path approach to SearchBased test data generation. [Citation Graph (0, 0)][DBLP]
    ISSTA, 2006, pp:13-24 [Conf]
  14. David Binkley
    An Empirical Study of the Effect of Semantic Differences on Programmer Comprehension. [Citation Graph (0, 0)][DBLP]
    IWPC, 2002, pp:97-106 [Conf]
  15. David Binkley, Bruce Duncan, Brennan Jubb, April Wielgosz
    The Feedback Compiler. [Citation Graph (0, 0)][DBLP]
    IWPC, 1998, pp:198-0 [Conf]
  16. David Binkley, L. Ross Raszewski, Christopher Smith, Mark Harman
    An Empirical Study of Amorphous Slicing as a Program Comprehension Support Tool. [Citation Graph (0, 0)][DBLP]
    IWPC, 2000, pp:161-170 [Conf]
  17. Mark Harman, Chris Fox, Robert M. Hierons, David Binkley, Sebastian Danicic
    Program Simplification as a Means of Approximating Undecidable Propositions. [Citation Graph (0, 0)][DBLP]
    IWPC, 1999, pp:208-217 [Conf]
  18. Dawn J. Lawrie, Henry Feild, David Binkley
    Leveraged Quality Assessment using Information Retrieval Techniques. [Citation Graph (0, 0)][DBLP]
    ICPC, 2006, pp:149-158 [Conf]
  19. Dawn Lawrie, Christopher Morrell, Henry Feild, David Binkley
    What's in a Name? A Study of Identifiers. [Citation Graph (0, 0)][DBLP]
    ICPC, 2006, pp:3-12 [Conf]
  20. Susan Horwitz, Thomas W. Reps, David Binkley
    Interprocedural Slicing Using Dependence Graphs. [Citation Graph (0, 0)][DBLP]
    PLDI, 1988, pp:35-46 [Conf]
  21. Susan Horwitz, Thomas W. Reps, David Binkley
    Interprocedural slicing using dependence graphs (with retrospective) [Citation Graph (0, 0)][DBLP]
    Best of PLDI, 1988, pp:229-243 [Conf]
  22. David Binkley
    Computing Amorphous Program Slices Using Dependence Graphs. [Citation Graph (0, 0)][DBLP]
    SAC, 1999, pp:519-525 [Conf]
  23. David Binkley, Bradley M. Kuhn
    Crozzle: an NP-complete problem. [Citation Graph (0, 0)][DBLP]
    SAC, 1997, pp:30-34 [Conf]
  24. Bradley M. Kuhn, David Binkley
    An enabling optimization for C++ virtual functions. [Citation Graph (0, 0)][DBLP]
    SAC, 1996, pp:420-428 [Conf]
  25. Paul Anderson, David Binkley, Genevieve Rosay, Tim Teitelbaum
    Flow Insensitive Points-To Sets. [Citation Graph (0, 0)][DBLP]
    SCAM, 2001, pp:81-91 [Conf]
  26. David Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Bogdan Korel
    Minimal Slicing and the Relationships Between Forms of Slicing. [Citation Graph (0, 0)][DBLP]
    SCAM, 2005, pp:45-56 [Conf]
  27. David Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Lahcen Ouarbya
    Formalizing Executable Dynamic and Forward Slicing. [Citation Graph (0, 0)][DBLP]
    SCAM, 2004, pp:43-52 [Conf]
  28. David Binkley, Mark Harman
    Results from a Large-Scale Study of Performance Optimization Techniques for Source Code Analyses Based on Graph Reachability Algorithms. [Citation Graph (0, 0)][DBLP]
    SCAM, 2003, pp:203-0 [Conf]
  29. David Binkley, Mark Harman
    Forward slices are smaller than backward slices. [Citation Graph (0, 0)][DBLP]
    SCAM, 2005, pp:15-24 [Conf]
  30. David Binkley, Mark Harman, Jens Krinke
    Characterising, Explaining, and Exploiting the Approximate Nature of Static Analysis through Animation. [Citation Graph (0, 0)][DBLP]
    SCAM, 2006, pp:43-52 [Conf]
  31. Keith Gallagher, David Binkley, Mark Harman
    Stop-List Slicing. [Citation Graph (0, 0)][DBLP]
    SCAM, 2006, pp:11-20 [Conf]
  32. Mark Harman, David Binkley, Ranjit Singh, Robert M. Hierons
    Amorphous Procedure Extraction. [Citation Graph (0, 0)][DBLP]
    SCAM, 2004, pp:85-94 [Conf]
  33. Dawn Lawrie, Henry Feild, David Binkley
    Syntactic Identifier Conciseness and Consistency. [Citation Graph (0, 0)][DBLP]
    SCAM, 2006, pp:139-148 [Conf]
  34. Keith Gallagher, David Binkley
    An Empirical Study of Computation Equivalence as Determined by Decomposition Slice Equivalence. [Citation Graph (0, 0)][DBLP]
    WCRE, 2003, pp:316-322 [Conf]
  35. Mark Harman, Nicolas Gold, Robert M. Hierons, David Binkley
    Code Extraction Algorithms which Unify Slicing and Concept Assignment. [Citation Graph (0, 0)][DBLP]
    WCRE, 2002, pp:11-21 [Conf]
  36. Lin Hu, Mark Harman, Robert M. Hierons, David Binkley
    Loop Squashing Transformations for Amorphous Slicing. [Citation Graph (0, 0)][DBLP]
    WCRE, 2004, pp:152-160 [Conf]
  37. Timothy M. Meyers, David Binkley
    Slice-Based Cohesion Metrics and Software Intervention. [Citation Graph (0, 0)][DBLP]
    WCRE, 2004, pp:256-265 [Conf]
  38. David Binkley, Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahdavi
    An Empirical Study of Executable Concept Slice Size. [Citation Graph (0, 0)][DBLP]
    WCRE, 2006, pp:103-114 [Conf]
  39. David Binkley, Keith Brian Gallagher
    Program Slicing. [Citation Graph (0, 0)][DBLP]
    Advances in Computers, 1996, v:43, n:, pp:1-50 [Journal]
  40. David Binkley, Mark Harman
    A survey of empirical results on program slicing. [Citation Graph (0, 0)][DBLP]
    Advances in Computers, 2004, v:62, n:, pp:106-179 [Journal]
  41. David Binkley
    C++ in Safety Critical Systems. [Citation Graph (0, 0)][DBLP]
    Ann. Software Eng., 1997, v:4, n:, pp:223-234 [Journal]
  42. Mark Harman, Lin Hu, Malcolm Munro, Xingyuan Zhang, David Binkley, Sebastian Danicic, Mohammed Daoudi, Lahcen Ouarbya
    Syntax-Directed Amorphous Slicing. [Citation Graph (0, 0)][DBLP]
    Autom. Softw. Eng., 2004, v:11, n:1, pp:27-61 [Journal]
  43. David Binkley, Sebastian Danicic, Mark Harman, John Howroyd, Lahcen Ouarbya
    A formal relationship between program slicing and partial evaluation. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 2006, v:18, n:2, pp:103-119 [Journal]
  44. Paul Anderson, David Binkley, Genevieve Rosay, Tim Teitelbaum
    Flow insensitive points-to sets. [Citation Graph (0, 0)][DBLP]
    Information & Software Technology, 2002, v:44, n:13, pp:743-754 [Journal]
  45. Mark Harman, Arun Lakhotia, David Binkley
    Theory and algorithms for slicing unstructured programs. [Citation Graph (0, 0)][DBLP]
    Information & Software Technology, 2006, v:48, n:7, pp:549-565 [Journal]
  46. David Binkley
    The application of program slicing to regression testing. [Citation Graph (0, 0)][DBLP]
    Information & Software Technology, 1998, v:40, n:11-12, pp:583-594 [Journal]
  47. David Binkley, James R. Lyle
    Application of the pointer state subgraph to static program slicing. [Citation Graph (0, 0)][DBLP]
    Journal of Systems and Software, 1998, v:40, n:1, pp:17-27 [Journal]
  48. Mark Harman, David Binkley, Sebastian Danicic
    Amorphous program slicing. [Citation Graph (0, 0)][DBLP]
    Journal of Systems and Software, 2003, v:68, n:1, pp:45-64 [Journal]
  49. David Binkley
    Precise Executable Interprocedural Slices. [Citation Graph (0, 0)][DBLP]
    LOPLAS, 1993, v:2, n:1-4, pp:31-45 [Journal]
  50. David Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Bogdan Korel
    A formalisation of the relationship between forms of program slicing. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2006, v:62, n:3, pp:228-252 [Journal]
  51. Nicolas E. Gold, Mark Harman, David Binkley, Robert M. Hierons
    Unifying program slicing and concept assignment for higher-level executable source code extraction. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 2005, v:35, n:10, pp:977-1006 [Journal]
  52. David Binkley, Liz Burd, Mark Harman, Paolo Tonella
    Introduction. [Citation Graph (0, 0)][DBLP]
    Software Quality Journal, 2004, v:12, n:4, pp:293-295 [Journal]
  53. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2003, v:22, n:2, pp:225-237 [Journal]
  54. David Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Bogdan Korel
    Theoretical foundations of dynamic program slicing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:360, n:1-3, pp:23-41 [Journal]
  55. David Binkley, Susan Horwitz, Thomas W. Reps
    Program Integration for Languages with Procedure Calls. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Softw. Eng. Methodol., 1995, v:4, n:1, pp:3-35 [Journal]
  56. David Binkley
    Semantics Guided Regression Test Cost Reduction. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1997, v:23, n:8, pp:498-516 [Journal]
  57. David Binkley, Mark Harman
    Analysis and Visualization of Predicate Dependence on Formal Parameters and Global Variables. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 2004, v:30, n:11, pp:715-735 [Journal]
  58. David Binkley, Mariano Ceccato, Mark Harman, Filippo Ricca, Paolo Tonella
    Tool-Supported Refactoring of Existing Object-Oriented Code into Aspects. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 2006, v:32, n:9, pp:698-717 [Journal]
  59. Dawn Lawrie, Henry Feild, David Binkley
    Quantifying identifier quality: an analysis of trends. [Citation Graph (0, 0)][DBLP]
    Empirical Software Engineering, 2007, v:12, n:4, pp:359-388 [Journal]
  60. David Binkley, Nicolas Gold, Mark Harman
    An empirical study of static program slice size. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Softw. Eng. Methodol., 2007, v:16, n:2, pp:- [Journal]
  61. David Binkley, Rainer Koschke, Spiros Mancoridis
    Guest Editors' Introduction to the Special Section from the International Conference on Software Maintenance and Evolution. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 2007, v:33, n:12, pp:797-798 [Journal]
  62. Srikanth Mohan, Arun Ravindran, David Binkley, Arindam Mukherjee
    Power Optimized Design of CMOS Programmable Gain Amplifiers. [Citation Graph (0, 0)][DBLP]
    J. Low Power Electronics, 2006, v:2, n:2, pp:259-270 [Journal]

  63. 05451 Executive Summary -- Beyond Program Slicing Dagstuhl Seminar. [Citation Graph (, )][DBLP]


  64. 05451 Abstracts Collection -- Beyond Program Slicing. [Citation Graph (, )][DBLP]


  65. From Transistor to PLL - Analogue Design and EDA Methods. [Citation Graph (, )][DBLP]


  66. Source Code Analysis: A Road Map. [Citation Graph (, )][DBLP]


  67. Impact of Limited Memory Resources. [Citation Graph (, )][DBLP]


  68. To camelcase or under_score. [Citation Graph (, )][DBLP]


  69. Dependence Anti Patterns. [Citation Graph (, )][DBLP]


  70. Cloning and copying between GNOME projects. [Citation Graph (, )][DBLP]


  71. Coherent dependence clusters. [Citation Graph (, )][DBLP]


  72. Extracting Meaning from Abbreviated Identifiers. [Citation Graph (, )][DBLP]


  73. Evaluating Key Statements Analysis. [Citation Graph (, )][DBLP]


  74. Identifying 'Linchpin Vertices' That Cause Large Dependence Clusters. [Citation Graph (, )][DBLP]


  75. Using peer-led team learning to increase participation and success of under-represented groups in introductory computer science. [Citation Graph (, )][DBLP]


  76. Testability Transformation - Program Transformation to Improve Testability. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002