4212 search results - page 657 / 843 » On Compressible Pairings and Their Computation |
169
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
A low overhead DFT technique, called clock-grouping, for delay testing of sequential synchronous circuits is presented. The proposed technique increases robust path delay fault co...
144
click to vote
CRYPTO
1990
Springer
15 years 10 months ago
1990
Springer
We study the following two kinds of one-way hash functions: universal oneway hash functions (UOHs) and collision intractable hash functions (CIHs). The main property of the former...
193
click to vote
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
186
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
301
click to vote
ACL2
2006
ACM
15 years 10 months ago
2006
ACM
We have extended the ACL2 theorem prover to automatically prove properties of VHDL circuits with IBM's Internal SixthSense verification system. We have used this extension to...