David Binkley

Followers

Following

Co-authors

Public Views

Interests

Uploads

Papers by David Binkley

Design of Micropower CMOS Preamplifiers Optimized for Low Thermal and Flicker Noise

This chapter contains sections titled: IntroductionUsing the Lateral Bipolar Transistor for Low-F... more This chapter contains sections titled: IntroductionUsing the Lateral Bipolar Transistor for Low-Flicker-Noise ApplicationsMeasures of Preamplifier Noise PerformanceReported Micropower, Low-Noise CMOS PreamplifiersMOS Noise versus the Bias Compliance VoltageExtraction of MOS Flicker-Noise ParametersDifferential Input PreamplifierSingle-Ended Input PreamplifierPrediction Accuracy for Design Guidance and OptimizationSummary of Low-Noise Design Methods and Resulting Challenges in Low-Voltage ProcessesReferencesIntroductionUsing the Lateral Bipolar Transistor for Low-Flicker-Noise ApplicationsMeasures of Preamplifier Noise PerformanceReported Micropower, Low-Noise CMOS PreamplifiersMOS Noise versus the Bias Compliance VoltageExtraction of MOS Flicker-Noise ParametersDifferential Input PreamplifierSingle-Ended Input PreamplifierPrediction Accuracy for Design Guidance and OptimizationSummary of Low-Noise Design Methods and Resulting Challenges in Low-Voltage ProcessesReferences

Crozzle: an NP-Complete Problem

At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-... more At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, with a cash reward for the highest score, in The Australian Women's Weekly. The R-by-C Crozzle problem generalizes the original. We argue that both problems are, in fact, NP-Complete. This follows from the reduction of exact 3-set cover to R-by-C Crozzle and the demonstration of a non-deterministic polynomial time algorithm for solving an arbitrary instance of the R-by-C Crozzle problem. A Java implementation of this algorithm is also considered.

Download

Slicing in the Presence of Parameter Aliasing

The notion of a program slice, originally introduced by Mark Weiser, is useful in program debuggi... more The notion of a program slice, originally introduced by Mark Weiser, is useful in program debugging, automatic parallelization, program integration, and software maintenance. A slice of a program is taken with respect to a program point p and a variable x; the slice consists of all statements of the program that might affect the value of x at point p. Prior work on interprocedural slicing, where a slice crosses the boundaries of procedure calls, has largely ignored the practical problem of aliasing (two variables are aliases if they refer to the same memory location). This papers presents an algorithm for interprocedural slicing in the presence of parameter aliases: two formal parameters that refer to the same memory location. The algorithm is parameterized by a set of parameter aliasing information. Better information yields smaller slices.

Download

Semantics guided regression test cost reduction

IEEE Transactions on Software Engineering, 1997

Software maintainers are faced with the task of regression testing: retesting a modified program ... more Software maintainers are faced with the task of regression testing: retesting a modified program on an often large number of test cases. The cost of regression testing can be reduced if the size of the program that must be retested is reduced and if old test cases and old test results can be reused. Tw o complimentary algorithms for reducing the cost of regression testing are presented. The first produces a program called differences that captures the semantic change between certified,apreviously tested program, and modified,achanged version of certified.I tis more efficient to test differences,b ecause it omits unchanged computations. The program differences is computed using a combination of program slices.

format_quoteThe first regression testing algorithm generates a smaller program, differences, which simplifies the test case rerun process by focusing on semantic changes.format_quote

Download

Multi-procedure program integration

Google, Inc. (search). SIGN IN SIGN UP. Multi-procedure program integration. Author: David Wendel... more Google, Inc. (search). SIGN IN SIGN UP. Multi-procedure program integration. Author: David Wendell Binkley, The Univ. of Wisconsin, Madison. Publication: · Doctoral Dissertation, Multi-procedure program integration. University of Wisconsin at Madison Madison, WI, USA ©1991. 1992 Doctoral Dissertation. Bibliometrics. · Downloads (6 Weeks): n/a · Downloads (12 Months): n/a · Citation Count: 7. Tools and Resources. Save to Binder; Export Formats: BibTeX; EndNote; ACM Ref. Purchase a copy from Proquest, Purchase. Share: ...

Application of the pointer state subgraph to static program slicing

Journal of Systems and Software, 1998

A new technique for performing static analysis of programs that contain unconstrained pointers is... more A new technique for performing static analysis of programs that contain unconstrained pointers is presented. The technique is based on the pointer state subgraph: a reduced control flow graph that takes advantage of the fact that in any program there exists a smaller program that computes only the values of pointer variables. The pointer state subgraph is useful in building static analysis tools. As an example, the application of the pointer state subgraph to program slicing is considered. Finally, some experimental results, obtained ...

The application of program slicing to regression testing

Information and Software Technology, 1998

Software maintainers are faced with the task of regression testing: retesting a program after a m... more Software maintainers are faced with the task of regression testing: retesting a program after a modi cation. The goal of regression testing is to ensure that bug xes and new functionality do not adversely a ect the correct functionality inherited from the original program. Regression testing often involves running a large program on a large number of test cases; thus, it can be expensive in terms of both human and machine time. Many approaches for reducing the cost of regression testing have been proposed. Those that make use of program slicing are surveyed.

Download

Tradeoffs in MOS Performance, and Design of Differential Pairs and Current Mirrors

This chapter contains sections titled: IntroductionPerformance TrendsPerformance TradeoffsDesign ... more This chapter contains sections titled: IntroductionPerformance TrendsPerformance TradeoffsDesign of Differential Pairs and Current Mirrors Using the Analog CMOS Design, Tradeoffs and Optimization SpreadsheetReferencesIntroductionPerformance TrendsPerformance TradeoffsDesign of Differential Pairs and Current Mirrors Using the Analog CMOS Design, Tradeoffs and Optimization SpreadsheetReferences

Flow insensitive points-to sets

Information and Software Technology, 2002

Pointer analysis is an important part of source code anal ysis. Many programs that manipulate sou... more Pointer analysis is an important part of source code anal ysis. Many programs that manipulate source code take points-to sets as part of their input. Points-to related data collected from 27 mid-sized C programs (ranging in size from 1,168 to 87,579 lines of code) is presented. The data shows the relative sizes and the complexities of computing points-to sets. Such data is useful in improving algo rithms for the computation of points-to sets as well as algorithms that make use of this information in other operations.

format_quoteBase data from 29 programs shows user time taken to compute points-to sets, vital for performance analysis of algorithms.format_quote

Download

Computing amorphous program slices using de-pendence graphs and a data-flow model

Sac, 1999

This paper presents an algorithm for computing amorphous program slices. Amorphous program slicin... more This paper presents an algorithm for computing amorphous program slices. Amorphous program slicing relaxes the syntactic condition of traditional slicing and can therefore produce considerably smaller slices. Existing algorithms slice the program'sc ontrol-flowg raph and then apply a collection of axiomatic rules. Am ore unified approach is obtained using the system dependence graph for both steps. Slicing this graph requires linear time. Furthermore, it contains sufficient information to allowt he rules to be easily specified and applied. Some of these rules treat the system dependence graph as a data-flowg raph and use a data-flowe valuation model, while others perform standard compiler optimizations. The application of amorphous slicing to the problem of determining array access safety is considered.

Download

An empirical study of predicate dependence levels and trends

Proceedings - International Conference on Software Engineering, 2003

Many source code analyses are closely related to and strongly influenced by interdependence among... more

format_quoteEliminating up to 97% of visible global variables shows dependence analysis can significantly simplify program complexity.format_quote

Download

Amorphous program slicing

Journal of Systems and Software, 2003

Traditional, syntax-preserving program slicing simplifies a program by deleting components (e.g.,... more Traditional, syntax-preserving program slicing simplifies a program by deleting components (e.g., statements and predicates) that do not affect a computation of interest. Amorphous slicing removes the limitation to component deletion as the only means of simplification, while retaining the semantic property that a slice preserves the selected behaviour of interest from the original program. This leads to slices which are often considerably smaller than their syntax-preserving counterparts.

Download

Spectacular Display: The Art of Nkanu Initiation Rituals

African Arts, 2001

... 78 color photos, 2 maps; $29.95 softcover), published by the National Museum of African Art i... more

An Empirical Study of Computation Equivalence as Determined by Decomposition Slice Equivalence

by David Binkley and Keith Gallagher

Reverse Engineering - Working Conference Proceedings, 2003

The full-text may be used and/or reproduced, and given to third parties in any format or medium, ... more

Download

Appendix: The Analog CMOS Design, Tradeoffs and Optimization Spreadsheet

This appendix contains sections titled: OverviewThe MOSFETs SheetThe Circuit Analysis SheetThe Pr... more

Download

A Survey of Empirical Results on Program Slicing

Advances in Computers, 2004

A program slice extracts a semantically meaningful portion of a program, based upon a user-select... more A program slice extracts a semantically meaningful portion of a program, based upon a user-selected slicing criterion. As the study of program slicing has matured, a growing body of empirical data has been gathered on the size of slices, slicing tools and techniques, the applications of slicing, and the beneficial psychological effects of slices on the programmers who use them. Empirical work on these topics is surveyed, highlighting trends and areas where additional empirical investigation is desirable, either because of contradictory findings or scarcity of results in the existing body of empirical knowledge.

Download

Amorphous procedure extraction

The procedure extraction problem is concerned with the meaning preserving formation of a procedur... more The procedure extraction problem is concerned with the meaning preserving formation of a procedure from a (not necessarily contiguous) selected set of statements. Previous approaches to the problem have used dependence analysis to identify the non-selected statements which must be 'promoted' (also selected) in order to preserve semantics. All previous approaches to the problem have been syntax preserving. This paper shows that by allowing transformation of the program's syntax it is possible to extract both procedures and functions in an amorphous manner. That is, although the amorphous extraction process is meaning preserving it is not necessarily syntax preserving. The amorphous approach is advantageous in a variety of situations. These include when it is desirable to avoid promotion, when a value-returning function is to be extracted from a scattered set of assignments to a variable, and when side effects are present in the program from which the procedure is to be extracted.

Download

Extending Optimization Methods to Smaller‐Geometry CMOS Processes and Future Technologies

This chapter contains sections titled: IntroductionUsing the Inversion Coefficient for CMOS Proce... more This chapter contains sections titled: IntroductionUsing the Inversion Coefficient for CMOS Process Independence and for Extension to Smaller-Geometry ProcessesEnhancing Optimization Methods by Including Gate Leakage Current EffectsUsing an Inversion Coefficient Measure for Non-CMOS TechnologiesReferencesIntroductionUsing the Inversion Coefficient for CMOS Process Independence and for Extension to Smaller-Geometry ProcessesEnhancing Optimization Methods by Including Gate Leakage Current EffectsUsing an Inversion Coefficient Measure for Non-CMOS TechnologiesReferences

Evolutionary testing in the presence of loop-assigned flags: A testability transformation approach

An enabling optimization for C++ virtual functions

Gaining the code re-use advantages of object oriented programming requires dynamic function bindi... more Gaining the code re-use advantages of object oriented programming requires dynamic function binding, which allows a new subclass to override a function of a superclass. Dynamic binding is obtained in C++ through the use of virtual functions. Unfortunately, virtual functions have two negative impacts on performance. First, they are traditionally compiled into indirect call instructions, which take longer to execute than direct call instructions. Second, it is difficult for the compiler to perform optimization since summary information from called procedures is hard or even impossible to obtain. The net effect is that C++ programmers avoid the use of virtual functions.

Download

David Binkley

Uploads

Papers by David Binkley

Log In