1743 search results - page 260 / 349 » Generalized Modal Satisfiability |
125
click to vote
FAC
2008
15 years 2 months ago
2008
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
131
Voted
IANDC
2008
15 years 2 months ago
2008
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weakn...
127
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Abstract--We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of...
130
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
120
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements ...