1463 search results - page 263 / 293 » Model Checking Implicit-Invocation Systems |
128
click to vote
IANDC
2011
14 years 8 months ago
2011
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 res...
203
click to vote
POPL
2008
ACM
16 years 1 months ago
2008
ACM
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
196
click to vote
POPL
2007
ACM
16 years 1 months ago
2007
ACM
In recent years we have seen great progress made in the area of automatic source-level static analysis tools. However, most of today's program verification tools are limited ...
FSEN
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. During the last years, timed automata have become a popular model for describing the behaviour of real-time systems. In particular, there has been much research on proble...
103
click to vote
TSD
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. After the years of hesitation the conservative Slovak telecommunication market seems to become conscious of the need of voice driven services. In the last year, all the t...