846 search results - page 51 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
182
click to vote
ECCB
2008
IEEE
14 years 11 months ago
2008
IEEE
Abstract: Models of the dynamics of cellular interaction networks have become increasingly larger in recent years. Formal verification based on model checking provides a powerful t...
99
Voted
MIDDLEWARE
2007
Springer
15 years 5 months ago
2007
Springer
Recent research advances in Peer-to-Peer (P2P) computing have enabled the P2P paradigm to be used for developing complex applications beyond file sharing and data storage. These ...
108
click to vote
KI
2009
Springer
15 years 5 months ago
2009
Springer
As a tractable description logic, DL-Lite provides a good compromise between expressive power and computational complexity of inference. It is therefore important to study ways of ...
103
click to vote
ISPA
2007
Springer
15 years 5 months ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
119
click to vote
CONCUR
2011
Springer
13 years 11 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...