798 search results - page 57 / 160 » Proving More Properties with Bounded Model Checking |
127
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
141
click to vote
JOC
2008
15 years 4 months ago
2008
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
172
click to vote
DBPL
1993
Springer
15 years 8 months ago
1993
Springer
In this paper we study the expressive power of query languages for nested bags. We de ne the ambient bag language by generalizing the constructs of the relational language of Brea...
118
click to vote
SPIN
2000
Springer
15 years 7 months ago
2000
Springer
In this paper, we describe our application of SPIN 1 to model an algorithm used to synchronize the clocks of modules that provide periodic real-time communication over a network. W...
180
click to vote
CSFW
2000
IEEE
15 years 8 months ago
2000
IEEE
Some of the non interference properties studied in [4, 6, 18] for information flow analysis in computer systems, notably Æ , are reformulated here in a realtime setting. This is...