655 search results - page 92 / 131 » Automata, Logic, and XML |
104
click to vote
CADE
2005
Springer
16 years 4 days ago
2005
Springer
We prove that, if the initial knowledge of the intruder is given by a deterministic bottom-up tree automaton, then the insecurity problem for cryptographic protocols with atomic ke...
CALCO
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. This is a theoretical paper giving the extended Stone duality perspective on the recently discovered connection between duality theory as studied in non-classical logic a...
101
click to vote
TIME
2007
IEEE
15 years 6 months ago
2007
IEEE
We present a symbolic algorithm for deciding safety (reachability) of timed systems modelled as Timed Automata (TA), under the notion of robustness w.r.t. infinitesimal clock-drif...
ISCAS
1999
IEEE
15 years 4 months ago
1999
IEEE
In this paper, the problem of determining if a given sequential specification can be made to fit a predetermined set of shape constraints is explored. Shape constraints are constr...
CP
2008
Springer
15 years 1 months ago
2008
Springer
Constraint programming often involves global constraints, for which various custom filtering algorithms have been published. This work presents a semi-automatic generation of CHR s...