592 search results - page 76 / 119 » Can Component Service-Based Systems Be Proved Correct |
CCS
2007
ACM
14 years 1 months ago
2007
ACM
In this paper we propose a new voting protocol with desirable security properties. The voting stage of the protocol can be performed by humans without computers; it provides every...
LREC
2010
13 years 9 months ago
2010
Evaluating complex Natural Language Processing (NLP) systems can prove extremely difficult. In many cases, the best one can do is to evaluate these systems indirectly, by looking ...
TCOM
2008
13 years 7 months ago
2008
This paper proposes a general and systematic code design method to efficiently combine constrained codes with parity-check (PC) codes for optical recording. The proposed constraine...
TIFS
2008
13 years 7 months ago
2008
Abstract--Network intrusion detection systems (NIDSs) monitor network traffic for suspicious activity and alert the system or network administrator. With the onset of gigabit netwo...
SIGSOFT
2003
ACM
14 years 8 months ago
2003
ACM
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...