We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Several recent papers have focused on OLAP over imprecise data, where each fact can be a region, instead of a point, in a multidimensional space. They have provided a multiple-wor...
Douglas Burdick, AnHai Doan, Raghu Ramakrishnan, S...
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...