219 search results - page 18 / 44 » Context-aware counter abstraction |
151
click to vote
ATVA
2005
Springer
15 years 11 months 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 ...
163
click to vote
FOSSACS
2008
Springer
15 years 7 months ago
2008
Springer
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
183
click to vote
INDOCRYPT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The recently introduced Galois/Counter Mode (GCM) of operation for block ciphers provides both encryption and message authentication, using universal hashing based on mul...
162
click to vote
CSL
2009
Springer
16 years 17 days ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
155
click to vote
FORTE
2003
15 years 7 months ago
2003
We present a new, on-the-fly algorithm that given a push-down model representing a sequential program with (recursive) procedure calls and an extended finite-state automaton repr...