Sciweavers

210 search results - page 34 / 42
» Widening Integer Arithmetic
Sort
View
TCS
2008
13 years 7 months ago
Verification of qualitative Z constraints
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
Stéphane Demri, Régis Gascon
ARSCOM
2002
69views more  ARSCOM 2002»
13 years 7 months ago
On Deuber's partition theorem for (m, p, c)-sets
In 1973, Deuber published his famous proof of Rado's conjecture regarding partition regular sets. In his proof, he invented structures called (m, p, c)-sets and gave a partit...
David S. Gunderson
BSL
2000
153views more  BSL 2000»
13 years 7 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon
FPL
2003
Springer
164views Hardware» more  FPL 2003»
14 years 19 days ago
FPGA Implementations of the RC6 Block Cipher
RC6 is a symmetric-key algorithm which encrypts 128-bit plaintext blocks to 128-bit ciphertext blocks. The encryption process involves four operations: integer addition modulo 2w ,...
Jean-Luc Beuchat
SIAMCOMP
2000
76views more  SIAMCOMP 2000»
13 years 7 months ago
On Interpolation and Automatization for Frege Systems
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system ...
Maria Luisa Bonet, Toniann Pitassi, Ran Raz