3457 search results - page 317 / 692 » A Symbol Is Not a Symbol |
161
click to vote
ATVA
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
162
click to vote
CHES
2005
Springer
16 years 7 days ago
2005
Springer
We extend the model of Karlof and Wagner for modelling side channel attacks via Input Driven Hidden Markov Models (IDHMM) to the case where not every state corresponds to a single ...
185
click to vote
COCOON
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. The original definition of P-systems calls for rules to be applied in a maximally parallel fashion. However, in some cases a sequential model may be a more reasonable as...
168
click to vote
ESOP
2005
Springer
16 years 6 days ago
2005
Springer
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
161
click to vote
MKM
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. Many processes in mathematical computing try to use knowledge of the most desired forms of mathematical expressions. This occurs, for example, in symbolic computation sys...