798 search results - page 75 / 160 » Proving More Properties with Bounded Model Checking |
211
click to vote
WRLA
2010
15 years 2 months ago
2010
Abstract. This paper presents the foundation, design, and implementation of the Linear Temporal Logic of Rewriting model checker as an extension of the Maude system. The Linear Tem...
114
click to vote
COORDINATION
2010
Springer
15 years 4 months ago
2010
Springer
In the context of service-oriented computing, behavioural contracts are descriptions of the message-passing behaviour of services. They can be used to check properties of service c...
222
click to vote
PODS
2009
ACM
16 years 4 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
164
click to vote
MMB
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
130
click to vote
FORMATS
2004
Springer
15 years 8 months ago
2004
Springer
Davies and Wakerly show that Byzantine fault tolerance can be achieved by a cascade of broadcasts and middle value select functions. We present an extension of the Davies and Waker...