798 search results - page 70 / 160 » Proving More Properties with Bounded Model Checking |
156
click to vote
EMSOFT
2005
Springer
15 years 9 months ago
2005
Springer
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
127
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
121
click to vote
FMCAD
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We present a simple method for verifying the safety properties of cache coherence protocols with arbitrarily many nodes. Our presentation begins with two examples. The fi...
149
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
161
click to vote
QEST
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— This paper reports on our efforts to link an industrial state-of-the-art modelling tool to academic state-of-the-art analysis algorithms. In a nutshell, we enable timed...