Sciweavers

1536 search results - page 145 / 308
» The Underlying Logic of Hoare Logic
Sort
View
DSD
2010
IEEE
126views Hardware» more  DSD 2010»
15 years 6 months ago
Low Power FPGA Implementations of 256-bit Luffa Hash Function
Low power techniques in a FPGA implementation of the hash function called Luffa are presented in this paper. This hash function is under consideration for adoption as standard. Tw...
Paris Kitsos, Nicolas Sklavos, Athanassios N. Skod...
AML
2008
57views more  AML 2008»
15 years 6 months ago
Sheaf toposes for realizability
We compare realizability models over partial combinatory algebras by embedding them into sheaf toposes. We then use the machinery of Grothendieck toposes and geometric morphisms t...
Steven Awodey, Andrej Bauer
AML
2007
95views more  AML 2007»
15 years 6 months ago
Complexity of admissible rules
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition unde...
Emil Jerábek
FUIN
2007
93views more  FUIN 2007»
15 years 6 months ago
Davis-Putnam Style Rules for Deciding Property S
Two set systems E, F on an underlying set V will be said to have Property S if there exists a subset σ of V , such that σ ∩ e = ∅, for all e ∈ E and f ⊆ σ, for all f âˆ...
Robert Cowen, Adam Kolany
ET
2002
77views more  ET 2002»
15 years 6 months ago
Reusing Scan Chains for Test Pattern Decompression
The paper presents a method for testing a system-on-achip by using a compressed representation of the patterns on an external tester. The patterns for a certain core under test ar...
Rainer Dorsch, Hans-Joachim Wunderlich