Search
Now showing items 11-20 of 238
Document Recovery from Bag-of-Word Indices
(University of Wisconsin-Madison Department of Computer Sciences, 2008)
Motivated by computer privacy issues, we present the novel problem of document recovery from an index: given only a document's bag-of-words (BOW) vector or other type of index, reconstruct the original ordered document. ...
Graph Isomorphism for Colored Graphs with Color Multiplicity Bounded by 3
(University of Wisconsin-Madison Department of Computer Sciences, 2005)
The colored graph isomorphism problem is a restricted version of the general graph isomorphism (GI)problem that involves deciding the existence of a color preserving isomorphism between a pair of colored graphs. In this ...
Thread-Level Transactional Memory
(University of Wisconsin-Madison Department of Computer Sciences, 2005)
This paper presents thread-level transactional memory (TTM), a memory system interface that separates the semantics of transactions-atomicity, consistency, and isolation-from the implementation. By making transactions a ...
Code Sandwiches
(University of Wisconsin-Madison Department of Computer Sciences, 2008)
A code sandwich consists of before, after, and body code. Typically, the before
code makes some change, the body code works in the context of the change, and the
after code undoes the change. A code sandwich must guarantee ...
Verifying Concurrent Message-Passing C Programs with Recursive Calls
(University of Wisconsin-Madison Department of Computer Sciences, 2005)
We consider the model-checking problem for C programs with (1) data ranging over very large domains, (2) (recursive) procedure calls, and (3) concurrent parallel components that communicate via synchronizing actions. We ...
Recovery of Variables and Heap Structure in x86 Executables
(University of Wisconsin-Madison Department of Computer Sciences, 2005)
This paper addresses two problems that arise when analyzing executables: (1) recovering variable-like quantities in the absence of symbol-table and debugging information, and (2) recovering useful information about objects ...
Badger: An Entropy-Based Web Search Clustering System with Randomization and Voting
(University of Wisconsin-Madison Department of Computer Sciences, 2005)
We have implemented and improved an entropy-based clustering algorithm. In addition to utilizing entropy as a clustering mechanism, our algorithm, Badger, uses randomization and a voting scheme to improve the quality of ...
A Decision Procedure for Detecting Atomicity Violations for Communicating Processes with Locks
(University of Wisconsin-Madison Department of Computer Sciences, 2009)
We present a new decision procedure for detecting property violations
in pushdown models for concurrent programs that use lock-based
synchronization, where each thread's lock operations are properly nested
(a la ...
Wire Speed Packet Classification Without TCAMS: One More Register (and a Bit of Logic) is Enough
(University of Wisconsin-Madison Department of Computer Sciences, 2006)
Many Internet functions, such as QoS and security, require classification of each packet based on a set of rules. As Internet bandwidth and data transmission rates continue to grow, the available time budget to classify ...
Recency-Abstraction for Heap-Allocated Storage
(University of Wisconsin-Madison Department of Computer Sciences, 2005)
In this paper, we present an abstraction for heap-allocated storage, called the recency-abstraction, that allows abstract-interpretation algorithms to recover non-trivial information for heap-allocated data objects. As an ...