Sciweavers

13 search results - page 2 / 3
» Design Recovery for Incomplete Combinational Logic
Sort
View
DATE
2009
IEEE
127views Hardware» more  DATE 2009»
13 years 11 months ago
Sequential logic synthesis using symbolic bi-decomposition
This paper uses under-approximation of unreachable states of a design to derive incomplete specification of combinational logic. The resulting incompletely-specified functions are...
Victor N. Kravets, Alan Mishchenko
ATAL
2009
Springer
13 years 11 months ago
Combining fault injection and model checking to verify fault tolerance in multi-agent systems
The ability to guarantee that a system will continue to operate correctly under degraded conditions is key to the success of adopting multi-agent systems (MAS) as a paradigm for d...
Jonathan Ezekiel, Alessio Lomuscio
MICRO
2006
IEEE
74views Hardware» more  MICRO 2006»
13 years 10 months ago
Phoenix: Detecting and Recovering from Permanent Processor Design Bugs with Programmable Hardware
Although processor design verification consumes ever-increasing resources, many design defects still slip into production silicon. In a few cases, such bugs have caused expensive...
Smruti R. Sarangi, Abhishek Tiwari, Josep Torrella...
DKE
2008
208views more  DKE 2008»
13 years 4 months ago
Deploying defeasible logic rule bases for the semantic web
Logic is currently the target of the majority of the upcoming efforts towards the realization of the Semantic Web vision, namely making the content of the Web accessible not only t...
Efstratios Kontopoulos, Nick Bassiliades, Grigoris...
CORR
2006
Springer
71views Education» more  CORR 2006»
13 years 4 months ago
Wreath Products in Stream Cipher Design
The paper develops a novel approach to stream cipher design: Both the state update function and the output function of the corresponding pseudorandom generators are compositions of...
Vladimir Anashin