Sciweavers

5639 search results - page 426 / 1128
» Timed Abstract Non-interference
Sort
View
CG
2008
Springer
15 years 6 months ago
About the Completeness of Depth-First Proof-Number Search
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
Akihiro Kishimoto, Martin Müller 0003
ASPDAC
2005
ACM
142views Hardware» more  ASPDAC 2005»
15 years 6 months ago
Bridging fault testability of BDD circuits
Abstract— In this paper we study the testability of circuits derived from Binary Decision Diagrams (BDDs) under the bridging fault model. It is shown that testability can be form...
Junhao Shi, Görschwin Fey, Rolf Drechsler
CONEXT
2008
ACM
15 years 6 months ago
Recursive temporal namespaces
Recursive temporal (RT) namespaces extend spatial namespaces such as IP with the notion of a nested time interval. RT namespace is an architectural approach to dealing with the un...
Venkata K. Pingali, Joseph D. Touch
ESA
2008
Springer
96views Algorithms» more  ESA 2008»
15 years 6 months ago
The Partial Augment-Relabel Algorithm for the Maximum Flow Problem
Abstract. The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient implementation of the highest-label push-relabel...
Andrew V. Goldberg
EUROCRYPT
2008
Springer
15 years 6 months ago
On the Indifferentiability of the Sponge Construction
Abstract. In this paper we prove that the sponge construction introduced in [4] is indifferentiable from a random oracle when being used with a random transformation or a random pe...
Guido Bertoni, Joan Daemen, Michael Peeters, Gille...