719 search results - page 112 / 144 » Proving Security Protocols Correct |
DATE
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—The generation of device drivers is a very time consuming and error prone activity. All the strategies proposed up to now to simplify this operation require a manual, ev...
DSN
2007
IEEE
15 years 4 months ago
2007
IEEE
Many important applications in wireless mesh networks require reliable multicast communication. Previously, Forward Error Correction (FEC) techniques have been proved successful f...
109
click to vote
TGC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In the age of the world-wide web and mobile computing, programming communication-centric software is essential. Thus, programmers and program designers are exposed to new...
94
Voted
ENTCS
2006
14 years 9 months ago
2006
We report on an experiment in combining Isabelle with automatic first-order arithmetic provers to increase automation on the verification of distributed protocols. As a case study...
76
Voted
COCO
2004
Springer
15 years 3 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....