22 search results - page 3 / 5 » When Is Reachability Intrinsically Decidable |
FOSSACS
2003
Springer
13 years 11 months ago
2003
Springer
rized Verification by Probabilistic Abstraction . . . . . . . . . . . . . . . . 87 Tamarah Arons, Amir Pnueli, Lenore Zuck Genericity and the π-Calculus . . . . . . . . . . . . ....
POPL
2010
ACM
14 years 3 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
FOSSACS
2009
Springer
14 years 16 days ago
2009
Springer
Abstract. In this work, we introduce the class of Interrupt Timed Automata (ITA), which are well suited to the description of multi-task systems with interruptions in a single proc...
STACS
2010
Springer
14 years 22 days ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
ATVA
2008
Springer
13 years 7 months ago
2008
Springer
Classical verification often uses abstraction when dealing with data. On the other hand, dynamic XML-based applications have become pervasive, for instance with the ever growing im...