Abstract. We address the problem of runtime monitoring for hard realtime programs—a domain in which correctness is critical yet has largely been overlooked in the runtime monitor...
Lee Pike, Alwyn Goodloe, Robin Morisset, Sebastian...
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...
Abstract--Proper admission control in cognitive radio networks is critical in providing QoS guarantees to secondary unlicensed users. In this paper, we study the admission control ...
Abstract-- In this paper we present the Statistical Retimingbased Timing Analysis (SRTA) algorithm. The goal is to compute the timing slack distribution for the nodes in the timing...
Abstract Benny Pinkas HP Labs Abstract. We demonstrate a transformation of Yao’s protocol for secure two-party computation to a fair protocol in which neither party gains any sub...