72 search results - page 9 / 15 » Proving Consistency of Equational Theories in Bounded Arithm... |
AML
2011
13 years 2 months ago
2011
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
CCS
2005
ACM
14 years 29 days ago
2005
ACM
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
CRYPTO
2011
Springer
12 years 7 months ago
2011
Springer
Structure-preserving signatures are signatures defined over bilinear groups that rely on generic group operations. In particular, the messages and signatures consist of group elem...
ICTAC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Model programs are used as high-level behavioral specifications typically representing abstract state machines. For modeling reactive systems, one uses input-output mode...