100 search results - page 1 / 20 » Linear-Time Model Checking: Automata Theory in Practice |
WIA
2007
Springer
13 years 11 months ago
2007
Springer
FOSSACS
2011
Springer
12 years 8 months ago
2011
Springer
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
ATVA
2008
Springer
13 years 7 months ago
2008
Springer
LATA
2009
Springer
14 years 1 days ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
CAV
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. This paper develops a local reasoning method to check lineartime temporal properties of concurrent programs. In practice, it is often infeasible to model check over the p...