125 search results - page 23 / 25 » Computing Over-Approximations with Bounded Model Checking |
JACM
2002
13 years 7 months ago
2002
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
ATAL
1997
Springer
13 years 12 months ago
1997
Springer
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
POPL
2011
ACM
12 years 10 months ago
2011
ACM
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
ICSOC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In Service Oriented Architectures (SOAs) services invoked in a composition can be replaced by other services, which are possibly discovered and bound at runtime. Most of ...
ATVA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...