David W. Binkley - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

Publications with a 'David W. Binkley' as author, editor, or advisor:

Results from a large-scale study of performance optimization techniques for source code analyses based on graph reachability algorithmsBinkley, D., Harman, M.. In Source Code Analysis and Manipulation, 2003. Proceedings. Third IEEE International Workshop on. 2003:
Amorphous procedure extractionHarman, M., Binkley, D., Singh, R., Hierons, R.M.. In Source Code Analysis and Manipulation, 2004. Fourth IEEE International Workshop on. 2004: [doi]
Formalizing executable dynamic and forward slicingBinkley, D., Danicic, S., Gyimothy, T., Harman, M., Kiss, A., Ouarbya, L.. In Source Code Analysis and Manipulation, 2004. Fourth IEEE International Workshop on. 2004: [doi]
ORBS and the limits of static slicingDavid Binkley, Nicolas E. Gold, Mark Harman, Syed S. Islam, Jens Krinke, Shin Yoo. SCAM 2015: 1-10 [doi]
Source code analysis with LDADavid Binkley, Daniel Heinz, Dawn Lawrie, Justin Overfelt. SMR, 28(10):893-920, 2016. [doi]
An Empirical Study of Computation Equivalence as Determined by Decomposition Slice EquivalenceKeith Gallagher, David Binkley. WCRE 2003: 316-322 [doi]
Extracting Meaning from Abbreviated IdentifiersDawn Lawrie, Henry Feild, David Binkley. Source Code Analysis and Manipulation, IEEE International Workshop on, 0, 2007. [doi]
An empirical analysis of the distribution of unit test smells and their impact on software maintenanceGabriele Bavota, Abdallah Qusef, Rocco Oliveto, Andrea De Lucia, David Binkley. ICSM 2012: 56-65 [doi]
Reducing the cost of regression testing by semantics guided test case selectionDavid Binkley. ICSM 1995: 251 [doi]
From Transistor to PLL - Analogue Design and EDA MethodsDavid Binkley, Helmut E. Graeb, Georges G. E. Gielen, Jaijeet S. Roychowdhury. date 2008: [doi]
Extracting Meaning from Abbreviated IdentifiersDawn Lawrie, Henry Feild, David Binkley. SCAM 2007: 213-222 [doi]
Evaluating test-to-code traceability recovery methods through controlled experimentsAbdallah Qusef, Gabriele Bavota, Rocco Oliveto, Andrea De Lucia, David Binkley. SMR, 25(11):1167-1191, 2013. [doi]
An empirical study of rules for well-formed identifiersDawn Lawrie, Henry Feild, David Binkley. SMR, 19(4):205-229, 2007. [doi]
Identifying 'Linchpin Vertices' That Cause Large Dependence ClustersDavid Binkley, Mark Harman. Source Code Analysis and Manipulation, IEEE International Workshop on, 0, 2009. [doi]
Locating Dependence Clusters and Dependence PollutionDavid Binkley, Mark Harman. ICSM 2005: 177-186 [doi]
Identifying Linchpin Vertices That Cause Large Dependence ClustersDavid Binkley, Mark Harman. SCAM 2009: 89-98 [doi]
Cloning and copying between GNOME projectsJens Krinke, Nicolas Gold, Yue Jia, David Binkley. msr 2010: 98-101 [doi]
Characterising, Explaining, and Exploiting the Approximate Nature of Static Analysis through AnimationDavid Binkley, Mark Harman, Jens Krinke. SCAM 2006: 43-52 [doi]
An empirical study of identifier splitting techniquesEmily Hill, David Binkley, Dawn J. Lawrie, Lori L. Pollock, K. Vijay-Shanker. ese, 19(6):1754-1780, 2014. [doi]
Quantifying identifier quality: an analysis of trendsDawn Lawrie, Henry Feild, David Binkley. ese, 12(4):359-388, 2007. [doi]
PORBS: A parallel observation-based slicerSyed S. Islam, David Binkley. IWPC 2016: 1-3 [doi]
Practical guidelines for change recommendation using association rule miningLeon Moonen, Stefano Di Alesio, David Binkley, Thomas Rolfsnes. ASE 2016: 732-743 [doi]
Program Simplification as a Means of Approximating Undecidable PropositionsMark Harman, Chris Fox, Robert M. Hierons, David Binkley, Sebastian Danicic. IWPC 1999: 208-217 [doi]
Reducing the cost of regression testingDavid Binkley. sigsoft, 25(1):35-36, 2000. [doi]
A formalisation of the relationship between forms of program slicingDavid Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Bogdan Korel. SCP, 62(3):228-252, 2006. [doi]
Characterising, Explaining, and Exploiting the Approximate Nature of Static Analysis through AnimationDavid Binkley, Mark Harman, Jens Krinke. Source Code Analysis and Manipulation, IEEE International Workshop on, 0, 2006. [doi]
A dataset for evaluating identifier splittersDavid Binkley, Dawn Lawrie, Lori L. Pollock, Emily Hill, K. Vijay-Shanker. msr 2013: 401-404 [doi]
Stop-List SlicingKeith Gallagher, David Binkley, Mark Harman. Source Code Analysis and Manipulation, IEEE International Workshop on, 0, 2006. [doi]
Modeling for Stakeholder EngagementTom Lusco, David Binkley, Ron Ice. icsa 2018: 116-119 [doi]
Change Impact using Dynamic History Analysis: (Abstract Only)Sydney Pugh, David Binkley. sigcse 2018: 275 [doi]
Coherent dependence clustersSyed S. Islam, Jens Krinke, David Binkley, Mark Harman. PASTE 2010: 53-60 [doi]
C++ in Safety Critical SystemsDavid Binkley. ansoft, 4:223-234, 1997.
Efficient Identification of Linchpin Vertices in Dependence ClustersDavid Binkley, Nicolas Gold, Mark Harman, Syed S. Islam, Jens Krinke, Zheng Li. TOPLAS, 35(2):7, 2013. [doi]
The species per path approach to SearchBased test data generationPhil McMinn, Mark Harman, David Binkley, Paolo Tonella. ISSTA 2006: 13-24 [doi]
Flow insensitive points-to setsPaul Anderson, David Binkley, Genevieve Rosay, Tim Teitelbaum. INFSOF, 44(13):743-754, 2002.
Dependence cluster visualizationSyed S. Islam, Jens Krinke, David Binkley. softvis 2010: 93-102 [doi]
Stop-List SlicingKeith Gallagher, David Binkley, Mark Harman. SCAM 2006: 11-20 [doi]
Program SlicingDavid Binkley, Keith Brian Gallagher. ac, 43:1-50, 1996.
Distinguishing copies from originals in software clonesJens Krinke, Nicolas Gold, Yue Jia, David Binkley. iwsc 2010: 41-48 [doi]
The application of program slicing to regression testingDavid Binkley. INFSOF, 40(11-12):583-594, 1998. [doi]
Expanding identifiers to normalize source code vocabularyDawn Lawrie, David Binkley. ICSM 2011: 113-122 [doi]
Normalizing Source Code VocabularyDawn J. Lawrie, David Binkley, Christopher Morrell. WCRE 2010: 3-12 [doi]
Theory and algorithms for slicing unstructured programsMark Harman, Arun Lakhotia, David Binkley. INFSOF, 48(7):549-565, 2006. [doi]
An Empirical Study of the Effect of Semantic Differences on Programmer ComprehensionDavid Binkley. IWPC 2002: 97-106 [doi]
Improving identifier informativeness using part of speech informationDavid Binkley, Matthew Hearn, Dawn Lawrie. msr 2011: 203-206 [doi]
Observational slicing based on visual semanticsShin Yoo, David Binkley, Roger D. Eastman. jss, 129:60-78, 2017. [doi]
Theoretical foundations of dynamic program slicingDavid Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Bogdan Korel. TCS, 360(1-3):23-41, 2006. [doi]
Understanding LDA in source code analysisDavid Binkley, Daniel Heinz, Dawn J. Lawrie, Justin Overfelt. IWPC 2014: 26-36 [doi]
05451 Abstracts Collection -- Beyond Program SlicingDavid Binkley, Mark Harman, Jens Krinke. Dagstuhl 2006: [doi]
An Empirical Study of Amorphous Slicing as a Program Comprehension Support ToolDavid Binkley, L. Ross Raszewski, Christopher Smith, Mark Harman. IWPC 2000: 161-170 [doi]
Model projection: simplifying models in response to restricting the environmentKelly Androutsopoulos, David Binkley, David Clark, Nicolas Gold, Mark Harman, Kevin Lano, Zheng Li. ICSE 2011: 291-300 [doi]
Predicting relevance of change recommendationsThomas Rolfsnes, Leon Moonen, David Binkley. ASE 2017: 694-705 [doi]
Re-Connecting MOS Modeling and Circuit Design: New Methods for Design QualityDaniel Foty, David Binkley. isqed 2001: 13 [doi]
Flow Insensitive Points-To SetsPaul Anderson, David Binkley, Genevieve Rosay, Tim Teitelbaum. SCAM 2001: 81-91 [doi]
SCOTCH: Slicing and Coupling Based Test to Code Trace HunterAbdallah Qusef, Gabriele Bavota, Rocco Oliveto, Andrea De Lucia, David Binkley. WCRE 2011: 443-444 [doi]
Formalizing Executable Dynamic and Forward SlicingDavid Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Lahcen Ouarbya. SCAM 2004: 43-52 [doi]
An empirical study of static program slice sizeDavid Binkley, Nicolas Gold, Mark Harman. TOSEM, 16(2):8, 2007. [doi]
Tool-Supported Refactoring of Existing Object-Oriented Code into AspectsDavid Binkley, Mariano Ceccato, Mark Harman, Filippo Ricca, Paolo Tonella. TSE, 32(9):698-717, 2006. [doi]
Generalized observational slicing for tree-represented modelling languagesNicolas E. Gold, David Binkley, Mark Harman, Syed S. Islam, Jens Krinke, Shin Yoo. FSE 2017: 547-558 [doi]
1st international workshop on natural language analysis in software engineering (NaturaLiSE 2013)Lori L. Pollock, David Binkley, Dawn Lawrie, Emily Hill, Rocco Oliveto, Gabriele Bavota, Alberto Bacchelli. ICSE 2013: 1537-1538 [doi]
Enabling improved IR-based feature locationDavid Binkley, Dawn J. Lawrie, Christopher Uehlinger, Daniel Heinz. jss, 101:30-42, 2015. [doi]
Cloning in Max/MSP PatchesNicolas Gold, Jens Krinke, Mark Harman, David Binkley. icmc 2011: [doi]
The impact of vocabulary normalizationDavid Binkley, Dawn J. Lawrie. SMR, 27(4):255-273, 2015. [doi]
Coherent clusters in source codeSyed S. Islam, Jens Krinke, David Binkley, Mark Harman. jss, 88:1-24, 2014. [doi]
Assessing the impact of global variables on program dependence and dependence clustersDavid Binkley, Mark Harman, Youssef Hassoun, Syed Islam, Zheng Li. jss, 83(1):96-107, 2010. [doi]
FlagRemover: A testability transformation for transforming loop-assigned flagsDavid Binkley, Mark Harman, Kiran Lakhotia. TOSEM, 20(3):12, 2011. [doi]
An empirical study on dependence clusters for effort-aware fault-proneness predictionYibiao Yang, Mark Harman, Jens Krinke, Syed S. Islam, David Binkley, Yuming Zhou, Baowen Xu. ASE 2016: 296-307 [doi]
Forward slices are smaller than backward slicesDavid Binkley, Mark Harman. SCAM 2005: 15-24 [doi]
An enabling optimization for C++ virtual functionsBradley M. Kuhn, David Binkley. SAC 1996: 420-428 [doi]
To camelcase or under_scoreDavid Binkley, Marcia Davis, Dawn Lawrie, Christopher Morrell. IWPC 2009: 158-167 [doi]
An Implementation of and Experiment with Semantic DifferencingDavid Binkley, Rob Capellini, L. Ross Raszewski, Christopher Smith. ICSM 2001: 82-91 [doi]
Precise Executable Interprocedural SlicesDavid Binkley. loplas, 2(1-4):31-45, 1993. [doi]
Crozzle: an NP-complete problemDavid Binkley, Bradley M. Kuhn. SAC 1997: 30-34 [doi]
Evolutionary testing in the presence of loop-assigned flags: a testability transformation approachAndré Baresel, David Binkley, Mark Harman, Bogdan Korel. ISSTA 2004: 108-118 [doi]
Dependence Anti PatternsDavid Binkley, Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahdavi, Joachim Wegener. jckbse 2008: 25-34 [doi]
Source Code Analysis: A Road MapDavid Binkley. ICSE 2007: 104-119 [doi]
Leveraged Quality Assessment using Information Retrieval TechniquesDawn J. Lawrie, Henry Feild, David Binkley. IWPC 2006: 149-158 [doi]
Tree-Oriented vs. Line-Oriented Observation-Based SlicingDavid Binkley, Nicolas Gold, Syed S. Islam, Jens Krinke, Shin Yoo. SCAM 2017: 21-30 [doi]
Uncovering dependence clusters and linchpin functionsDavid Binkley, Árpád Beszédes, Syed S. Islam, Judit Jász, Bela Vancsics. ICSM 2015: 141-150 [doi]
Dependence clusters in source codeMark Harman, David Binkley, Keith Gallagher, Nicolas Gold, Jens Krinke. TOPLAS, 32(1), 2009. [doi]
Amorphous Procedure ExtractionMark Harman, David Binkley, Ranjit Singh, Robert M. Hierons. SCAM 2004: 85-94 [doi]
ORBS: language-independent program slicingDavid Binkley, Nicolas Gold, Mark Harman, Syed S. Islam, Jens Krinke, Shin Yoo. FSE 2014: 109-120 [doi]
A Large-Scale Empirical Study of Forward and Backward Static Slice Size and Context SensitivityDavid Binkley, Mark Harman. ICSM 2003: 44-53 [doi]
Increasing diversity: Natural language measures for software fault predictionDavid Binkley, Henry Feild, Dawn J. Lawrie, Maurizio Pighin. jss, 82(11):1793-1803, 2009. [doi]
Testability Transformation - Program Transformation to Improve TestabilityMark Harman, André Baresel, David Binkley, Robert M. Hierons, Lin Hu, Bogdan Korel, Phil McMinn, Marc Roper. fortest 2008: 320-344 [doi]
Syntactic Identifier Conciseness and ConsistencyDawn Lawrie, Henry Feild, David Binkley. Source Code Analysis and Manipulation, IEEE International Workshop on, 0, 2006. [doi]
Learning to Rank Improves IR in SEDavid Binkley, Dawn J. Lawrie. ICSM 2014: 441-445 [doi]
Seeing Is Slicing: Observation Based Slicing of Picture Description LanguagesShin Yoo, David Binkley, Roger D. Eastman. SCAM 2014: 175-184 [doi]
Editorial of special section from Software Evolution Week 2014David Binkley, Filippo Ricca, Serge Demeyer. INFSOF, 65:95-96, 2015. [doi]
05451 Executive Summary -- Beyond Program Slicing Dagstuhl SeminarMark Harman, David Binkley, Jens Krinke. Dagstuhl 2006: [doi]
A trajectory-based strict semantics for program slicingRichard W. Barraclough, David Binkley, Sebastian Danicic, Mark Harman, Robert M. Hierons, Ákos Kiss, Mike Laurence, Lahcen Ouarbya. TCS, 411(11-13):1372-1386, 2010. [doi]
Evaluating Key Statements AnalysisDavid Binkley, Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahdavi. Source Code Analysis and Manipulation, IEEE International Workshop on, 0, 2008. [doi]
Forward slices are smaller than backward slicesDavid Binkley, Mark Harman. Source Code Analysis and Manipulation, IEEE International Workshop on, 0, 2005. [doi]
Issues in clone classification for dataflow languagesNicolas Gold, Jens Krinke, Mark Harman, David Binkley. iwsc 2010: 83-84 [doi]
A Case for Software Specific Natural Language TechniquesDavid Binkley, Dawn J. Lawrie. SCAM 2016: 187-196 [doi]
Interprocedural Constant Propagation using Dependence Graphs and a Data-Flow ModelDavid Binkley. cc 1994: 374-388
SCOTCH: Test-to-code traceability using slicing and conceptual couplingAbdallah Qusef, Gabriele Bavota, Rocco Oliveto, Andrea De Lucia, David Binkley. ICSM 2011: 63-72 [doi]
A CAD methodology for optimizing transistor current and sizing in analog CMOS designDavid Binkley, C. E. Hopper, Steve D. Tucker, Brian C. Moss, James M. Rochelle, Daniel Foty. tcad, 22(2):225-237, 2003. [doi]
A comparison of tree- and line-oriented observational slicingDavid W. Binkley, Nicolas Gold, Syed S. Islam, Jens Krinke, Shin Yoo. ese, 24(5):3077-3113, 2019. [doi]
In search of a customizable and uniform user interfaceBradley M. Kuhn, David W. Binkley. crossroads, 1(2):34-39, 1994. [doi]
Using semantic differencing to reduce the cost of regression testingDavid W. Binkley. ICSM 1992: 41-50 [doi]
QSES: Quasi-Static Executable SlicesQuentin Stiévenart, David W. Binkley, Coen De Roover. SCAM 2021: 209-213 [doi]
MOAD: Modeling Observation-Based Approximate DependencySeongmin Lee, David W. Binkley, Robert Feldt, Nicolas Gold, Shin Yoo. SCAM 2019: 12-22 [doi]
On Adaptive Change RecommendationLeon Moonen, David W. Binkley, Sydney Pugh. jss, 164:110550, 2020. [doi]
MOBS: multi-operator observation-based slicing using lexical approximation of program dependenceSeongmin Lee, David W. Binkley, Nicolas Gold, Syed S. Islam, Jens Krinke, Shin Yoo. ICSE 2018: 302-303 [doi]
Static Stack-Preserving Intra-Procedural Slicing of WebAssembly BinariesQuentin Stiévenart, David W. Binkley, Coen De Roover. ICSE 2022: 2031-2042 [doi]
To CamelCase or under_scoreDavid W. Binkley, Marcia Davis, Dawn J. Lawrie, Christopher Morrell. IWPC 2019: 177 [doi]
Dynamic Slicing of WebAssembly BinariesQuentin Stiévenart, David W. Binkley, Coen De Roover. ICSM 2023: 84-96 [doi]
[Research Paper] The Case for Adaptive Change RecommendationSydney Pugh, David W. Binkley, Leon Moonen. SCAM 2018: 129-138 [doi]
Experimental Validation of New Software TechnologyMarvin V. Zelkowitz, Dolores R. Wallace, David W. Binkley. In Natalia Juristo, Ana M. Moreno, editors, Lecture Notes on Empirical Software Engineering. Volume 12 of Series on Software Engineering and Knowledge Engineering, pages 229-263, World Scientific, 2003. [doi]
Flow Insensitive Points-To SetsP. Anderson, D. Binkley, G. Rosay, T. Teitelbaum. Source Code Analysis and Manipulation, IEEE International Workshop on, 0, 2001. [doi]

All Publications

Filter by Year

Filter by Type

Filter by Topic

Filter by Venue

Filter by Co-author

Filter by Top terms

Download

External Links

Profile Name

Statistics

Aliases

Researchr

David W. Binkley's Profile

Unidentified Publications