534 search results - page 85 / 107 » Proving Termination of Rewrite Systems Using Bounds |
INDOCRYPT
2005
Springer
14 years 2 months ago
2005
Springer
Prouff has introduced recently, at FSE 2005, the notion of transparency order of S-boxes. This new characteristic is related to the ability of an S-box, used in a cryptosystem in ...
AAAI
2007
13 years 11 months ago
2007
Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...
RTCSA
1998
IEEE
14 years 1 months ago
1998
IEEE
Snap-shot mechanisms are used to read a globally consistent set of variable values. Such a mechanism can be used to solve a variety of communication and synchronization problems, ...
CDC
2008
IEEE
14 years 3 months ago
2008
IEEE
— This paper deals with the tracking problem for constrained linear systems using a model predictive control (MPC) law. As it is well known, MPC provides a control law suitable f...
CAV
2010
Springer
14 years 19 days ago
2010
Springer
Abstract. We present the tool MERIT, a CEGAR model-checker for safety propf counter-systems, which sits in the Lazy Abstraction with Interpolants (LAWI) framework. LAWI is parametr...