777 search results - page 104 / 156 » Model Checking with Formula-Dependent Abstract Models |
SPIN
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Computational resources are increasing rapidly with the explosion of multi-core processors readily available from major vendors. Model checking needs to harness these res...
CAV
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
100
click to vote
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
Abstract. We describe how the PVS verification system has been used to verify a safety property of a garbage collection algorithm, originally suggested by Ben-Ari. The safety prope...
116
click to vote
ACOM
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. This paper explores the use of temporal logics in the context of communication protocols for multiagent systems. We concentrate on frameworks where protocols are used to ...
CHARME
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Unbounded model checking of invariant properties is typically solved using symbolic reachability. However, BDD based reachability methods suffer from lack of robustness ...