205 search results - page 26 / 41 » Grid Graph Reachability Problems |
AMAST
2008
Springer
13 years 12 months ago
2008
Springer
Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and quer...
AUSAI
2005
Springer
14 years 3 months ago
2005
Springer
The key problem in applying verification techniques such as model checking to agent architectures is to show how to map systematically from an agent program to a model structure t...
TAPSOFT
1997
Springer
14 years 1 months ago
1997
Springer
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
We are interested in verifying dynamic properties of finite state reactive systems under fairness assumptions by model checking. The systems we want to verify are specified throug...
HPCC
2009
Springer
13 years 7 months ago
2009
Springer
Abstract--The Grid is an heterogeneous and dynamic environment which enables distributed computation. This makes it a technology prone to failures. Some related work uses replicati...