798 search results - page 67 / 160 » Proving More Properties with Bounded Model Checking |
144
click to vote
FAC
2007
15 years 4 months ago
2007
Abstract. We report on a case study in applying different formal methods to model and verify an architecture for administrating digital signatures. The architecture comprises seve...
178
click to vote
PLDI
2012
ACM
13 years 6 months ago
2012
ACM
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
132
click to vote
JSAC
2006
15 years 4 months ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
126
click to vote
BIS
2008
15 years 5 months ago
2008
Abstract. A common task in business process modelling is the verification of process models regarding syntactical and structural errors. While the former might be checked with low ...
143
click to vote
CTRSA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Known compact e-cash schemes are constructed from signature schemes with efficient protocols and verifiable random functions. In this paper, we introduce a different ap...