This paper presents new methods for restructuring logic networks based on fast Boolean techniques. The basis for these are 1) a cut based view of a logic network, 2) exploiting th...
Alan Mishchenko, Robert K. Brayton, Satrajit Chatt...
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
ional Predicate Abstraction from Game Semantics Adam Bakewell and Dan R. Ghica University of Birmingham, U.K. We introduce a technique for using conventional predicate abstraction ...
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
—This paper proposes an error control scheme that minimizes the total distortion experienced by the receivers using a version of Type-II hybrid ARQ/FEC. Based on the feedback inf...