1465 search results - page 138 / 293 » Making the Correct Mistakes |
310
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
This work develops an integrated approach to the verification of behaviourally rich programs, founded directly on operational semantics. The power of the approach is demonstrated ...
187
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
161
click to vote
MOBISYS
2005
ACM
16 years 6 months ago
2005
ACM
This paper presents a new pairing protocol that allows two CPU-constrained wireless devices Alice and Bob to establish a shared secret at a very low cost. To our knowledge, this i...
166
click to vote
EUROSYS
2008
ACM
16 years 3 months ago
2008
ACM
Programs written in type-unsafe languages such as C and C++ incur costly memory errors that result in corrupted data structures, program crashes, and incorrect results. We present...
153
click to vote
ALT
2004
Springer
16 years 3 months ago
2004
Springer
In this paper we introduce a paradigm for learning in the limit of potentially infinite languages from all positive data and negative counterexamples provided in response to the ...