Sciweavers

23201 search results - page 82 / 4641
» Rewriting Systems with Data
Sort
View
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
15 years 10 months ago
Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers
Recently proposed algebraic attacks [2, 6] and fast algebraic attacks [1, 5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exp...
Philip Hawkes, Gregory G. Rose
ACS
2007
15 years 5 months ago
Algebra and Geometry of Rewriting
We present various results of the last twenty years converging towards a homotopical theory of computation. This new theory is based on two crucial notions : polygraphs (introduce...
Yves Lafont
ISMVL
2010
IEEE
188views Hardware» more  ISMVL 2010»
15 years 10 months ago
MDGs Reduction Technique Based on the HOL Theorem Prover
—Multiway Decision Graphs (MDGs) subsume Binary Decision Diagrams (BDDs) and extend them by a first-order formulae suitable for model checking of data path circuits. In this pap...
Sa'ed Abed, Otmane Aït Mohamed
FQAS
2006
Springer
136views Database» more  FQAS 2006»
15 years 9 months ago
Robust Query Processing for Personalized Information Access on the Semantic Web
Abstract. Research in Cooperative Query answering is triggered by the observation that users are often not able to correctly formulate queries to databases that return the intended...
Peter Dolog, Heiner Stuckenschmidt, Holger Wache
TLCA
2005
Springer
15 years 10 months ago
Semantic Cut Elimination in the Intuitionistic Sequent Calculus
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...
Olivier Hermant