59 search results - page 8 / 12 » Generating all polynomial invariants in simple loops |
IFIP
2004
Springer
14 years 24 days ago
2004
Springer
We analyze an algebraic representation of AES–128 as an embedding in BES, due to Murphy and Robshaw. We present two systems of equations S and K concerning encryption and key gen...
VSTTE
2005
Springer
14 years 28 days ago
2005
Springer
: Verifying design instead of code can be an effective and practical approach to obtaining verified software. This paper argues that proof scores are an attractive method for ver...
LICS
2000
IEEE
13 years 12 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
CSR
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
DBPL
2005
Springer
13 years 9 months ago
2005
Springer
XQuery is known to be a powerful XML query language with many bells and whistles. For many common queries we do not need all the expressive power of XQuery. We investigate the eff...