Name
Abstract | ||
|---|---|---|
Alternating automata have been widely used to model and verify systems that handle data from finite domains, such as communication protocols or hardware. The main advantage of the alternating model of computation is that complementation is possible in linear time, thus allowing to concisely encode trace inclusion problems that occur often in verification. In this paper we consider alternating automata over infinite alphabets, whose transition rules are formulae in a combined theory of booleans and some infinite data domain, that relate past and current values of the data variables. The data theory is not fixed, but rather it is a parameter of the class. We show that union, intersection and complementation are possible in linear time in this model and, though the emptiness problem is undecidable, we provide two efficient semi-algorithms, inspired by two state-of-the-art abstraction refinement model checking methods: lazy predicate abstraction cite{HJMS02} and the impact~ semi-algorithm cite{mcmillan06}. We have implemented both methods and report the results of an experimental comparison. |
Year | Venue | Field |
|---|---|---|
2017 | arXiv: Formal Languages and Automata Theory | Discrete mathematics,Data domain,Model checking,Predicate abstraction,Computer science,Automaton,Model of computation,Boolean data type,Time complexity,Undecidable problem |
DocType | Volume | Citations |
Journal | abs/1705.05606 | 0 |
PageRank | References | Authors |
0.34 | 10 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Radu Iosif | 1 | 483 | 42.44 |
| Xiao Xu | 2 | 1 | 3.39 |