Cooperative Bug Isolation: Winning Thesis of the 2005 ACM by Ben Liblit

By Ben Liblit

Efforts to appreciate and are expecting the habit of software program date again to the earliest days of computing device programming,over part a century in the past. within the intervening a long time, the necessity for potent equipment of knowing software program has purely elevated; so- ware has unfold to turn into the underpinning of a lot of contemporary society, and the possibly disastrous outcomes of damaged or poorly understood software program became all too obvious. Ben Liblit’s paintings reconsiders universal assumptions approximately how we must always research software program and it arrives at a few extraordinary new effects. Inprinciple,understandingsoftware isn't this type of hardproblem. Certainlya c- puter scientist learning courses seems to be in a miles enhanced place than, say, a biologist attempting to comprehend a dwelling organism or an economist attempting to comprehend the habit of markets, as the biologist and the economist needs to depend on oblique statement of the elemental methods they want to appreciate. A c- puterscientist, however,starts with a complete,precise descriptionof the behaviorof software—the application itself! after all, the tale seems to not be so straightf- ward, simply because regardless of having an ideal description, courses are suf ciently c- plex that it's always dif cult or perhaps very unlikely to reply to many easy questions on them.

Show description

Read or Download Cooperative Bug Isolation: Winning Thesis of the 2005 ACM Doctoral Dissertation Competition PDF

Similar logic books

Lectures on Algebraic Model Theory

Lately, version concept has had striking luck in fixing vital difficulties in addition to in laying off new gentle on our knowing of them. the 3 lectures amassed the following current contemporary advancements in 3 such components: Anand Pillay on differential fields, Patrick Speissegger on o-minimality and Matthias Clasen and Matthew Valeriote on tame congruence idea.

Foundations of Computing

Presents an advent to the speculation of computing technological know-how. overlaying the most parts of complexity thought, automata and formal languages in a coherent manner, the textual content additionally covers the theoretical points of extra utilized parts. The author's strategy is to stimulate scholars' realizing of the relevance of idea to special program parts - for instance, photograph processing, conversation networks and cryptography are all mentioned.

Compressed Data Structures for Strings: On Searching and Extracting Strings from Compressed Textual Data

Facts compression is necessary to control vast datasets, indexing is prime to question them. although, their pursuits look as counterposed: the previous goals at minimizing information redundancies, while the latter augments the dataset with auxiliary details to hurry up the question solution. during this monograph we introduce recommendations that conquer this dichotomy.

A Boole Anthology: Recent and Classical Studies in the Logic of George Boole

Sleek mathematical good judgment wouldn't exist with out the analytical instruments first constructed via George Boole within the Mathematical research of good judgment and The legislation of proposal. The effect of the Boolean tuition at the improvement of good judgment, constantly recognized yet lengthy underestimated, has lately develop into an important learn subject.

Additional resources for Cooperative Bug Isolation: Winning Thesis of the 2005 ACM Doctoral Dissertation Competition

Example text

A region consisting of a branch with one site on each arm is still a singleton region, as any path through that region crosses at most one site. 1 and Fig. 2 included empty and singleton region specialization. 3 shows how overheads grow or shrink when this optimization is disabled and empty and singleton regions are cloned into fast and slow paths like all other regions. Positive numbers indicate that disabling region specialization makes code slower. In the branches and returns schemes we see a general trend toward larger overheads without this optimization.

Our native C compiler, GCC, treats the many “--countdown” decrements along the fast path quite poorly. It will not, for example, coalesce a sequence of five such decrements into a single “countdown -= 5” adjustment. This lack of optimization apparently stems from conservative assumptions about aliasing of global variables. Efficient countdown management requires that the native C compiler take greater liberties when optimizing these decrements. We assist the native compiler by caching the countdown in a local variable within each function: 1.

2 showed that many benchmarks fail to reach a performance goal of 15% maximum overhead when all functions are instrumented. 4 Adaptive Sampling 35 overhead at 1/1,000 sampling was no greater than 15%. 2 shows how many functions had to be excluded in each case, as an absolute count of functions and as a percentage of all non-library functions in the benchmark. Benchmark and scheme configurations that met the 15% goal with no exclusion at all are listed as “-”. In general we find that the absolute number of excluded functions is small in the small benchmarks, although the percentage may appear large.

Download PDF sample

Rated 4.01 of 5 – based on 13 votes