1724 search results - page 2 / 345 » Types as models: model checking message-passing programs |
UAI
2008
13 years 6 months ago
2008
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
FORTE
2010
13 years 6 months ago
2010
Abstract. The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the for...
CSL
2004
Springer
13 years 10 months ago
2004
Springer
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, ¢¡ , comprised of finite, but arbitrarily many,...
SIGMETRICS
1998
ACM
13 years 9 months ago
1998
ACM
In many real applications, for example those with frequent and irregular communication patterns or those using large messages, network contention and contention for message proces...
CLUSTER
2004
IEEE
13 years 4 months ago
2004
IEEE
Fault tolerance in parallel systems has traditionally been achieved through a combination of redundancy and checkpointing methods. This notion has also been extended to message-pas...