Today's university library has many digitally accessible resources, both indexes to content and considerable original content. Using off-the-shelf search technology provides a single point of access into library resources, but we have found that such full-text indexing technology is not entirely satisfactory for library searching.
In response to this, we...
Through the use of conditional compilation and related tools, many software projects can be used to generate a huge
number of related programs. The problem of typing such variational software is difficult. The brute-force strategy
of generating all variants and typing each one individually is (1) usually infeasible for efficiency...
Theories of human behavior are an important but largely untapped resource for software engineering research. They facilitate understanding of human developers’ needs and activities, and thus can serve as a valuable resource to researchers designing software engineering tools. Furthermore, theories abstract beyond specific methods and tools to fundamental principles that...
Aggressive random testing tools (“fuzzers”) are impressively effective
at finding compiler bugs. For example, a single test-case
generator has resulted in more than 1,700 bugs reported for a single
JavaScript engine. However, fuzzers can be frustrating to use:
they indiscriminately and repeatedly find bugs that may not be severe
enough...
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ε > 0 and given n terminals in the plane with connection requests between some pairs of terminals, our scheme finds a (1 + ε) approximation to the minimum-length...
For an undirected n-vertex planar graph G with non-negative edge-weights, we consider the following type of query: given two vertices s and t in G, what is the weight of a min st-cut in G? We show how to answer such queries in constant time with O(n log⁴ n) preprocessing...
This article was first presented as a conference paper in June 2012 at the 12th ACM/IEEE-CS joint conference on Digital Libraries, Washington, D.C., U.S.A.